{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:38:10Z","timestamp":1648993090600},"reference-count":21,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0743-7315(02)00009-6","type":"journal-article","created":{"date-parts":[[2002,11,11]],"date-time":"2002-11-11T16:13:38Z","timestamp":1037031218000},"page":"1617-1628","source":"Crossref","is-referenced-by-count":1,"title":["Fully dynamic distributed search trees can be balanced in time"],"prefix":"10.1016","volume":"62","author":[{"given":"Fabio","family":"Barillari","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Nardelli","sequence":"additional","affiliation":[]},{"given":"Massimo","family":"Pepe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(02)00009-6_BIBBL94","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0022-0000(05)80075-3","article-title":"Efficient rebalancing of chromatic search trees","volume":"49","author":"Boyar","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBDEV93","doi-asserted-by":"crossref","unstructured":"R. Devine, Design and implementation of DDH: a distributed dynamic hashing algorithm, in: Proceedings of the Fourth International Conference on Foundations of Data Organization and Algorithms (FODO), Chicago, 1993.","DOI":"10.1007\/3-540-57301-1_7"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBGRA88","doi-asserted-by":"crossref","unstructured":"J. Gray, The cost of messages, in: Proceedings of the Seventh ACM Symposium on Principles of Distributed Systems, Toronto, Ontario, Canada, 1988, pp. 1\u20137.","DOI":"10.1145\/62546.62547"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBJK93","doi-asserted-by":"crossref","unstructured":"T. Johnson, P. Krishna, Lazy updates for distributed search structures, in: ACM SIGMOD International Conference on Management of Data, Washington, DC, 1993, pp. 337\u2013346.","DOI":"10.1145\/170035.170085"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBKNU73","series-title":"Sorting and Searching","volume":"vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBKW94","doi-asserted-by":"crossref","unstructured":"B. Kr\u00f6ll, P. Widmayer, Distributing a search tree among a growing number of processors, in: ACM SIGMOD International Conference on Management of Data, Minneapolis, MN, 1994, pp. 265\u2013276.","DOI":"10.1145\/191839.191891"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBKW95","doi-asserted-by":"crossref","unstructured":"B. Kr\u00f6ll, P. Widmayer, Balanced distributed search trees do not exist, in: Proceedings of the Fourth International Workshop on Algorithms and Data Structures (WADS\u201995), S. Akl et al., (Eds.), Kingston, Canada, 50\u201361, Lecture Notes in Computer Science, Vol. 955, Springer-Verlag, Berlin, August 1995.","DOI":"10.1007\/3-540-60220-8_50"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBLSW97","doi-asserted-by":"crossref","unstructured":"K. Larsen, E. Soisalon-Soininen, P. Widmayer, Relaxed balance through standard rotations, in: Workshop on Algorithms and Data Structures (WADS\u201997), Halifax, Nova Scotia, Canada, August 1997.","DOI":"10.1007\/3-540-63307-3_82"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBLN96","doi-asserted-by":"crossref","unstructured":"W. Litwin, M.-A. Neimat, k-RP*s: a high performance multi-attribute scalable data structure, in: Proceedings of the Fourth International Conference on Parallel and Distributed Information System, Miami Beach, FL, USA, December 1996, pp. 120\u2013131.","DOI":"10.1109\/PDIS.1996.568674"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBLNS93","unstructured":"W. Litwin, M.-A. Neimat, D.A. Schneider, LH*\u2014linear hasing for distributed files, in: ACM SIGMOD International Conference on Management of Data, Washington, DC, 1993."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBLNS94","unstructured":"W. Litwin, M.-A. Neimat, D.A. Schneider, RP*\u2014a family of order-preserving scalable distributed data structures, in: Proceedings of the 20th Conference on Very Large Data Bases, Santiago, Chile, 1994."},{"issue":"4","key":"10.1016\/S0743-7315(02)00009-6_BIBLNS97","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1145\/236711.236713","article-title":"LH*\u2014a scalable distributed data structure","volume":"21","author":"Litwin","year":"1996","journal-title":"ACM Trans. Database System"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBMS91","doi-asserted-by":"crossref","unstructured":"G. Matsliach, O. Shmueli, An efficient method for distributing search structures, in: Proceedings of the First International Conference on Parallel and Distributed Information Systems (PDIS\u201991), Miami Beach, 1991.","DOI":"10.1109\/PDIS.1991.183086"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBNAR95","unstructured":"E. Nardelli, Some issues on the management of k-d trees in a distributed framework, Technical Report No. 76, Dipartimento di Matematica Pura ed Applicata, Universita\u2019 di L'Aquila, January 1995."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBNAR96","unstructured":"E. Nardelli, Distributed k-d trees, in: XVI International Conference of the Chilean Computer Science Society (SCCC\u201996), Valdivia, Chile, November 1996."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBNBP97","unstructured":"E. Nardelli, F. Barillari, M. Pepe, Design issues in distributed searching of multidimensional data, in: Proceedings of the Third International Symposium on Programming and Systems (ISPS\u201997), Algiers, Algeria, Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, April 1997."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBNBP98","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jpdc.1998.1428","article-title":"Distributed searching of multi-dimensional data: a performance evaluation study","volume":"49","author":"Nardelli","year":"1998","journal-title":"J. Parallel and Distrib. Comput."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBNS96","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s002360050057","article-title":"A structure for concurrent rebalancing","volume":"33","author":"Nurmi","year":"1996","journal-title":"Acta Inform."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBNSW87","doi-asserted-by":"crossref","unstructured":"O. Nurmi, E. Soisalon-Soininen, D. Wood, Concurrency control in database structures with relaxed balance, in: ACM Conference on Principles of Database Systems, San Diego, CA, 1987, pp. 170\u2013176.","DOI":"10.1145\/28659.28677"},{"key":"10.1016\/S0743-7315(02)00009-6_BIBSPW90","unstructured":"C. Severance, S. Pramanik, P. Wolberg, Distributed linear hashing and parallel projection in main memory databases, in: VLDB Conference, Barcelona, 1991."},{"key":"10.1016\/S0743-7315(02)00009-6_BIBVBW94","doi-asserted-by":"crossref","unstructured":"R. Vingralek, Y. Breitbart, G. Weikum, Distributed file organization with scalable cost\/performance, in: ACM SIGMOD International Conference on Management of Data, Minneapolis, MN, 1994.","DOI":"10.1145\/191839.191889"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731502000096?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731502000096?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T15:58:21Z","timestamp":1554393501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731502000096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0743731502000096"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(02)00009-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}