{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:35:20Z","timestamp":1752550520618,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662518"},{"type":"electronic","value":"9783540484813"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48481-7_30","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T23:49:40Z","timestamp":1193528980000},"page":"339-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Searching for Multi\u2014dimensional Data Made Simple"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Nardelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Vocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"issue":"9","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter. The input\/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116\u20131127, September 1988.","journal-title":"Communications of the ACM"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013262, Portland, OR, 1989.","DOI":"10.1145\/67544.66950"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and C. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173\u2013179, 1972.","journal-title":"Acta Informatica"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-57301-1_7"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"D. Mayer and B. Vance. A call to order. In Proceedings of the International Conference on Principle of Database Systems, 1993.","DOI":"10.1145\/153850.153851"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013344, Seattle,Washington, 1989.","DOI":"10.1145\/73007.73039"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013376, NewYork, NY 10036, USA, 1988. ACM Press.","DOI":"10.1145\/62212.62248"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"M. L. Fredman, J. Koml\u00f3s, 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\u2013169, 1982.","DOI":"10.1109\/SFCS.1982.39"},{"key":"30_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS: Annual Symposium on Theoretical Aspects of Computer Science","author":"T. Hagerup","year":"1998","unstructured":"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\u2013398. LNCS 1373, Springer-Verlag, 1998."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1006\/jcss.1996.0043","volume":"52","author":"P. C. Kanellakis","year":"1996","unstructured":"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\u2013612, 1996.","journal-title":"Journal of Computer and System Science"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0167-5060(08)70708-8","volume":"6","author":"D. J. Kleitman","year":"1980","unstructured":"D. J. Kleitman and K. J. Winston. The asymptotic number of lattices. Annuals of Discrete Matemathics, 6:243\u2013249, 1980.","journal-title":"Annuals of Discrete Matemathics"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"B. Kr\u00f6ll and P. Widmayer. Distributing a search tree among a growing number of processors. In ACM SIGMOD Int. Conf. on Management of Data, pages 265\u2013276, Minneapolis,MN, 1994.","DOI":"10.1145\/191843.191891"},{"key":"30_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-60220-8_50","volume-title":"4th Int. Workshop on Algorithms and Data Structures (WADS\u201995)","author":"B. Kr\u00f6ll","year":"1995","unstructured":"B. Kr\u00f6ll 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\u201995), pages 50\u201361, Kingston, Canada, 1995. LNCS 955, Springer-Verlag."},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(88)90079-8","volume":"27","author":"D. Lea","year":"1988","unstructured":"Douglas Lea. Digital and Hilbert K-D trees. Information Processing Letters, 27(1):35\u201341, 1988.","journal-title":"Information Processing Letters"},{"key":"30_CR15","unstructured":"W. Litwin, M. A. Neimat, and D. A. Schneider. LH* \u2014linear hashing for distributed files. In ACM SIGMOD Int. Conf. on Management of Data,Washington, D.C., 1993."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1145\/236711.236713","volume":"21","author":"W. Litwin","year":"1996","unstructured":"W. Litwin, M. A. Neimat, and D. A. Schneider. LH* \u2014a scalable distributed data structure. ACM Trans. Database Systems, 21(4):480\u2013525, 1996.","journal-title":"ACM Trans. Database Systems"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D. Morrison","year":"1968","unstructured":"D. Morrison and R. Patricia. Practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM, 15:514\u2013534, 1968.","journal-title":"Journal of the ACM"},{"key":"30_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, Berlin, New York, 1985."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"S. Ramaswamy and S. Subramanian. Path caching:Atechnique for optimal external searching. In Proc. ACM Symp. Principles of Database System, pages 25\u201335, 1994.","DOI":"10.1145\/182591.182595"},{"key":"30_CR20","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990."},{"key":"30_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/10692760_14","volume-title":"Proceedings of 24th InternationalWorkshop on Graph-Theoretic Concepts in Computer Science WG\u201998","author":"M. Talamo","year":"1998","unstructured":"M. Talamo and P. Vocca. Compact implicit representation of graphs. In J. Hromkovi\u010d and O. S\u00fdkora, editors, Proceedings of 24th InternationalWorkshop on Graph-Theoretic Concepts in Computer Science WG\u201998, pages 164\u2013176. LNCS 1517, Springer-Verlag, 1998."},{"issue":"2","key":"30_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0304-3975(96)00209-5","volume":"175","author":"M. Talamo","year":"1997","unstructured":"M. Talamo and P. Vocca. A data structure for lattice representation. Theoretical Computer Science, 175(2):373\u2013392, April 1997.","journal-title":"Theoretical Computer Science"},{"key":"30_CR23","unstructured":"M. Talamo and P. Vocca. A time optimal digraph browsing on a sparse representation. Technical Report 8, Matemathics Department, University of Rome \u201cTor Vergata\u201d, 1997."},{"key":"30_CR24","volume-title":"Temporal Databases: Theory, Design, and Implementation","author":"A. Tansel","year":"1993","unstructured":"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."},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Graph-theoretic methods in database theory. In ACM, editor, PODS\u2019 90. Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems: April 2-4, 1990, Nashville, Tennessee, volume 51(1), NewYork, NY 10036, USA, 1990. ACM Press.","DOI":"10.1145\/298514.298576"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA\u2019 99"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48481-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:44:02Z","timestamp":1737503042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48481-7_30"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662518","9783540484813"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-48481-7_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}