{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:43:11Z","timestamp":1648604591315},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00503-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"197-202","source":"Crossref","is-referenced-by-count":0,"title":["Data replication in static tree structures"],"prefix":"10.1016","volume":"86","author":[{"given":"Susanne E","family":"Hambrusch","sequence":"first","affiliation":[]},{"given":"Chuan-Ming","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00503-3_BIB001","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1006\/jcss.1999.1639","article-title":"Replication and consistency in a distributed environment","volume":"59","author":"Breitbart","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(02)00503-3_BIB002","series-title":"Proc. 22nd Internat. Conf. on Very Large Data Bases","first-page":"342","article-title":"Clustering techniques for minimizing external path length","author":"Diwan","year":"1996"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB003","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jagm.1999.1014","article-title":"How to pack trees","volume":"32","author":"Gil","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB004","series-title":"Proc. 16th ACM Symp. Principles of Database Systems","first-page":"249","article-title":"On the analysis of indexing schemes","author":"Hellerstein","year":"1997"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB005","series-title":"Proc. 5th Annual Internat. Conf. Computing and Combinatorics, COCOON","first-page":"51","article-title":"An external memory data structure for shortest path queries (extended abstract)","author":"Hutchinson","year":"1999"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB006","unstructured":"C.-M. Liu, Broadcasting and blocking large data sets with an index tree, PhD Thesis, Purdue University, West Lafayette, IN, May 2002"},{"issue":"2","key":"10.1016\/S0020-0190(02)00503-3_BIB007","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01940646","article-title":"Blocking for external graph searching","volume":"16","author":"Nodine","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB008","series-title":"Proc. 13th ACM Symp. Principles of Database Systems","first-page":"25","article-title":"Path caching: A technique for optimal external searching","author":"Ramaswamy","year":"1994"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB009","series-title":"Proc. 6th Annual SODA","first-page":"378","article-title":"The P-range tree: A new data structure for range searching in secondary memory","author":"Subramanian","year":"1995"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB010","series-title":"Proc. 10th Internat. Conf. Data Engineering","first-page":"32","article-title":"Supporting partial data accesses to replicated data","author":"Triantafillou","year":"1994"},{"key":"10.1016\/S0020-0190(02)00503-3_BIB011","series-title":"Proc. 17th ACM Symp. Principles of Database Systems","first-page":"119","article-title":"External memory algorithms","author":"Vitter","year":"1998"},{"issue":"2","key":"10.1016\/S0020-0190(02)00503-3_BIB012","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/249978.249982","article-title":"An adaptive data replication algorithm","volume":"22","author":"Wolfson","year":"1997","journal-title":"ACM Trans. Database Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:26:19Z","timestamp":1553405179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002005033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002005033"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00503-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}