{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:15Z","timestamp":1725663255643},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_35","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:01:25Z","timestamp":1330203685000},"page":"362-371","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of compact 0-complete trees: A new access method to large databases"],"prefix":"10.1007","author":[{"given":"Ratko","family":"Orlandic","sequence":"first","affiliation":[]},{"given":"John L.","family":"Pfaltz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"R. Bayer and E. McCreight, \u201cOrganization and Maintenance of Large Ordered Indexes\u201d, Acta Informatica, 1972, 173\u2013189.","DOI":"10.1007\/BF00288683"},{"issue":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin and et.al., \u201cExtendible Hashing\u2014A Fast Access Method for Dynamic Files\u201d, Trans. Database Systems 4, 3 (Sep. 1979), 315\u2013344.","journal-title":"Trans. Database Systems"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"P. Flajolet, \u201cOn the Performance Evaluation of Extendible Hashing and Trie Searching\u201d, Acta Inf. 20 (1983), 345\u2013369.","journal-title":"Acta Inf."},{"issue":"9","key":"35_CR4","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"E. Fredkin, \u201cMany-way Information Retrieval\u201d, Comm. of the ACM 3, 9 (Sep. 1960), 490\u2013499.","journal-title":"Comm. of the ACM"},{"key":"35_CR5","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, The Art of Computer Programming: Sorting and Searching, Addison Wesley, Reading, MA, 1973."},{"key":"35_CR6","unstructured":"R. Orlandic and J. L. Pfaltz, \u201cCompact 0-Complete Trees\u201d, Proc. 14th Conf. on VLDB, Long Beach, CA, Aug. 1988, 372\u2013381."},{"key":"35_CR7","unstructured":"R. Orlandic, \u201cDesign, Analysis and Applications of Compact 0-Complete Trees\u201d, Ph.D. Dissertation, University of Virginia, Apr. 1989."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:38Z","timestamp":1619571818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}