Efficient searching for multi-dimensional data made simple

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 339-353

  Nardelli, Enrico ^a   Talamo, Maurizio ^b   Vocca, Paola ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; HIERARCHICAL SYSTEMS; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

ARITHMETIC OPERATIONS; DECOMPOSITION TECHNIQUE; MODEL OF COMPUTATION; MULTI-DIMENSIONAL QUERIES; MULTIDIMENSIONAL DATA; MULTIDIMENSIONAL OBJECTS; ONE DIMENSIONAL PROBLEMS; STORAGE REQUIREMENTS;

DIGITAL STORAGE;

EID: 84958055722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_30     Document Type: Conference Paper

References (25)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, September 1988.
2. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationship in large data and knowledge bases. In Proceedings of the International Conference on the Management of Data, pages 253-262, Portland, OR, 1989.
3. R. Bayer and C. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173-179, 1972.
4. R. Devine. Design and implementation of DDH: A distributed dynamic hashing algorithm. In 4th Int. Conf. on Foundations of Data Organization and Algorithms (FODO), Chicago, 1993.
5. D. Mayer and B. Vance. A call to order. In Proceedings ofthe International Conference on Principle of Database Systems, 1993.
6. A. Fiat and M. Naor. Implicit O(1) probe search. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 336-344, Seattle, Washington, 1989.
7. A. Fiat, M. Naor, J. P. Schmidt, and A. Siegel. Non-oblivious hashing. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing: Chicago, Illinois, May 2-4, 1988, pages 367-376, New York, NY 10036, USA, 1988. ACM Press.
8. M. L. Fredman, J. Komlos, and E. Szemeredi. Sorting a sparse table with O(1) worst case access time. In Proc. 23rd Ann. IEEE Symp. on Foundations of Computer Science, pages 165-169, 1982.
9. T. Hagerup. Sorting and searching on the word RAM. In M. Morvan, C. Meinel, and D. Krob, editors, STACS: Annual Symposium on Theoretical Aspects of Computer Science, pages 366-398. LNCS 1373, Springer-Verlag, 1998.
10. P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Indexing for data models with constraints and classes. Journal of Computer and System Science, 52:589-612, 1996.
11. D. J. Kleitman and K. J. Winston. The asymptotic number of lattices. Annuals of Discrete Matemathics, 6:243-249, 1980.
12. B. Kroll and P. Widmayer. Distributing a search tree among a growing number of processors. In ACM SIGMOD Int. Conf. on Management of Data, pages 265-276, Minneapolis, MN, 1994.
13. B. Kreill and P. Widmayer. Balanced distributed search trees do not exists. In S.Akl et al., editor, 4th Int. Workshop on Algorithms and Data Structures (WADS'95), pages 50-61, Kingston, Canada, 1995. LNCS 955, Springer-Verlag.
14. Douglas Lea. Digital and Hilbert K-D trees. Information Processing Letters, 27(1):35-41, 1988.
15. W. Litwin, M. A. Neimat, and D. A. Schneider. LH*-linear hashing for distributed files. In ACM SIGMOD Int. Conf. on Management of Data, Washington, D.C., 1993.
16. W. Litwin, M. A. Neimat, and D. A. Schneider. LH*-a scalable distributed data structure. ACM Trans. Database Systems, 21(4):480-525, 1996.
17. D. Morrison and R. Patricia. Practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM, 15:514-534, 1968.
18. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, Berlin, New York, 1985.
19. S. Ramaswamy and S. Subramanian. Path caching: A technique for optimal external searching. In Proc. ACM Symp. Principles of Database System, pages 25-35, 1994.
20. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
21. M. Talamo and P. Vocca. Compact implicit representation of graphs. In J. Hromkovic and O. Sýkora, editors, Proceedings of 24th International Workshop on Graph-Theoretic Concepts in Computer Science WG'98, pages 164-176. LNCS 1517, Springer-Verlag, 1998.
22. M. Talamo and P. Vocca. A data structure for lattice representation. Theoretical Computer Science, 175(2):373-392, April 1997.
23. M. Talamo and P. Vocca. A time optimal digraph browsing on a sparse representation. Technical Report 8, Matemathics Department, University of Rome "Tor Vergata", 1997.
24. A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings, Redwood City, CA, 1993.
25. M. Yannakakis. Graph-theoretic methods in database theory. In ACM, editor, PODS '90. Proceedings of the Ninth A CM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems: April 2-4, 1990, Nashville, Tennessee, volume 51(1), New York, NY 10036, USA, 1990. ACM Press.