{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:49:18Z","timestamp":1725486558239},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429128"},{"type":"electronic","value":"9783540456278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45627-9_18","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T15:57:04Z","timestamp":1181663824000},"page":"211-222","source":"Crossref","is-referenced-by-count":2,"title":["ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs"],"prefix":"10.1007","author":[{"given":"Adriano","family":"Di Pasquale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Nardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"18_CR1","unstructured":"P. Bozanis, Y. Manolopoulos: DSL: Accomodating Skip Lists in the SDDS Model, Workshop on Distributed Data and Structures (WDAS 2000), L\u2019Aquila, June 2000."},{"key":"18_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":"18_CR3","doi-asserted-by":"crossref","unstructured":"R. Devine: Design and implementation of DDH: a distributed dynamic hashingalgorithm, 4th Int.Conf.on Foundations of Data Organization and Algorithms(FODO), Chicago, 1993.","DOI":"10.1007\/3-540-57301-1_7"},{"key":"18_CR4","unstructured":"A. Di Pasquale, E. Nardelli: Fully Dynamic Balanced and Distributed SearchTrees with Logarithmic Costs, Workshop on Distributed Data and Structures(WDAS\u201999), Princeton, NJ, May 1999."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"A. Di Pasquale, E. Nardelli: Distributed searching of k-dimensional data with almostconstant costs, ADBIS 2000, Prague, September 2000.","DOI":"10.1007\/3-540-44472-6_19"},{"key":"18_CR6","unstructured":"A. Di Pasquale, E. Nardelli: ADST: Aggregation in Distributed Search Trees, TechnicalReport 1\/2001, University of L\u2019Aquila, February 2001."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"A. Di Pasquale, E. Nardelli: A Very Efficient Order Preserving Scalable DistributedData Structure, accepted for pubblication at DEXA 2001 Conference.","DOI":"10.1007\/3-540-44759-8_20"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"B. Kr\u00f6ll, P. Widmayer: Distributing a search tree among a growing number ofprocessor, in ACM SIGMOD Int.Conf.on Management of Data, pp 265\u2013276 Minneapolis, MN, 1994.","DOI":"10.1145\/191843.191891"},{"key":"18_CR9","unstructured":"W. Litwin, M.A. Neimat, D.A. Schneider: LH* \u2014 Linear hashing for distributed files, ACM SIGMOD Int.Conf.on Management of Data, Washington, D. C., 1993."},{"key":"18_CR10","unstructured":"W. Litwin, M.A. Neimat, D.A. Schneider: RP* \u2014 A family of order-preserving scalabledistributed data structure, in 20th Conf.on Very Large Data Bases, Santiago, Chile, 1994."},{"key":"18_CR11","unstructured":"W. Litwin, M.A. Neimat, D.A. Schneider: k-RP.s \u2014 A High Performance Multi-Attribute Scalable Distributed Data Structure, in 4th International Conference onParallel and Distributed Information System, December 1996."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"W. Litwin, M.A. Neimat, D.A. Schneider: LH* \u2014 A Scalable Distributed DataStructure, ACM Trans.on Database Systems, 21(4), 1996.","DOI":"10.1145\/236711.236713"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"W. Litwin, T.J.E. Schwarz, S.J.: LH*RS: a High-availability Scalable DistributedData Structure using Reed Solomon Codes, ACM SIGMOD Int.Conf.on Managementof Data, 1999.","DOI":"10.1145\/342009.335418"},{"key":"18_CR14","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(JPDC), 49, 1998.","DOI":"10.1006\/jpdc.1998.1428"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"R. Vingralek, Y. Breitbart, G. Weikum: Distributed file organization with scalablecost\/performance, ACM SIGMOD Int.Conf.on Management of Data, Minneapolis, MN, 1994.","DOI":"10.1145\/191839.191889"},{"key":"18_CR16","unstructured":"R. Vingralek, Y. Breitbart, G. Weikum: SNOWBALL: Scalable Storage on Networksof Workstations with Balanced Load, Distr.and Par.Datab ases, 6, 2, 1998."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2001: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45627-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T02:01:40Z","timestamp":1556503300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45627-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429128","9783540456278"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45627-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}