{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:25:36Z","timestamp":1778300736578,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679776","type":"print"},{"value":"9783540444725","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44472-6_19","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T01:16:06Z","timestamp":1185844566000},"page":"239-250","source":"Crossref","is-referenced-by-count":6,"title":["Distributed Searching of k-Dimensional Data with Almost Constant Costs"],"prefix":"10.1007","author":[{"given":"Adriano","family":"Di Pasquale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"EnricoZ","family":"Nardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"19_CR1","unstructured":"F. Barillari, E. Nardelli, M. Pepe: Fully Dinamic Distribuited Search Trees Can Be Balanced in O(log2 N) Time, Technical Report 146, Dipartimento di Matematica Pura ed Applicata, Universita\u2019 di L\u2019Aquila, July 1997, accepted for publication on the Journal of Parallel and Distributed Computation."},{"key":"19_CR2","unstructured":"Y. Breitbart, R. Vingralek: Addressing and Balancing Issues in Distributed B+Trees, 1st Workshop on Distributed Data and Structures (WDAS\u201998), 1998."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Chorochronos: A Research Network for Spatiotemporal Database Systems. SIGMOD Record 28(3): 12\u201321 (1999).","DOI":"10.1145\/333607.333609"},{"key":"19_CR4","unstructured":"A. Di Pasquale, E. Nardelli: Balanced and Distributed Search Trees, Workshop on Distributed Data and Structures (WDAS\u201999), Princeton, NJ, May 1999."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"A. Di Pasquale, E. Nardelli: Design and analysis of distributed searching of k-dimensional data with almost constant costs, Tech.Rep. 00\/14, Dept. of Pure and Applied Mathematics, Univ. of L\u2019Aquila, May 2000.","DOI":"10.1007\/3-540-44472-6_19"},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/364099.364331","volume":"7","author":"B.A. Galler","year":"1964","unstructured":"B.A. Galler, M.J. Fisher, An improved equivalence algorithm, Commun. ACM 7,5(1964), 301\u2013303.","journal-title":"Commun. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"B. Kr\u00f6ll, P. Widmayer: Distributing a search tree among a growing number of processor, in ACM SIGMOD Int. Conf. on Management of Data, pp 265\u2013276 Minneapolis, MN, 1994.","DOI":"10.1145\/191843.191891"},{"key":"19_CR8","unstructured":"W. Litwin, M.A. Neimat, D.A. Schneider:LH*-Linear hashing for distributed files, A CM SIGMOD Int. Conf. on Management of Data, Washington, D. C., 1993."},{"key":"19_CR9","unstructured":"W. Litwin, M.A. Neimat, D.A. Schneider: RP*-A family of order-preserving scalable distributed data structure, in 20th Conf. on Very Large Data Bases, Santiago, Chile, 1994."},{"key":"19_CR10","unstructured":"E. Nardelli: Distribuited k-d trees, in XVI Int. Conf. of the Chilean Computer Science Society (SCCC\u201996), Valdivia, Chile, November 1996."},{"key":"19_CR11","unstructured":"E Nardelli, F Barillari and M. Pepe, Design issues in distributed searching of multi-dimensional data, 3rd International Symposium on Programming and Systems (ISPS\u201997), Algiers, Algeria, April 1997."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"E. Nardelli, F. Barillari, M. Pepe: Distributed Searching of Multi-Dimensional Data: a Performance Evaluation Study, Journal of Parallel and Distributed Computation, 49, 1998.","DOI":"10.1006\/jpdc.1998.1428"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan, Efficiency of a good but non linear set union algorithm, J. Assoc. Comput. Mach., 22(1975), pp. 215\u2013225.","journal-title":"J. Assoc. Comput. Mach."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"T. Tzouramanis, M. Vassilakopoulos, Y. Manolopoulos: Processing of Spatio Temporal Queries in Image Databases. ADBIS 1999, pp. 85\u201397.","DOI":"10.1007\/3-540-48252-0_7"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"J. Leeuwen Van","year":"1984","unstructured":"J. Van Leeuwen, R.E. Tarjan, Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., 31 (1984), pp. 245\u2013281.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Current Issues in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44472-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:50:47Z","timestamp":1556711447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44472-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679776","9783540444725"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44472-6_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}