{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:39:45Z","timestamp":1648856385738},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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 Systems"],"published-print":{"date-parts":[[1984,1]]},"DOI":"10.1016\/0306-4379(84)90024-3","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"157-165","source":"Crossref","is-referenced-by-count":1,"title":["A pruned TRIE to index a sorted file and its evaluation"],"prefix":"10.1016","volume":"9","author":[{"given":"D.","family":"Plateau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(84)90024-3_BIB1","series-title":"Int. Workshop on Data Base Machine","article-title":"A relational backend data base machine","author":"Bancilhon","year":"1982"},{"key":"10.1016\/0306-4379(84)90024-3_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0306-4379(84)90024-3_BIB3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/320455.320469","article-title":"Hashing and trie algorithm for partial match retrieval","author":"Burkhard","year":"1976","journal-title":"ACM Trans. on Data Base Systems"},{"key":"10.1016\/0306-4379(84)90024-3_BIB4","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/S0022-0000(77)80031-7","article-title":"Associative retrieval trie hash coding","volume":"15","author":"Burkhard","year":"1977","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0306-4379(84)90024-3_BIB5","unstructured":"Erdeleyi et al.: Higher transcendental functions."},{"key":"10.1016\/0306-4379(84)90024-3_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing. A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"TODS"},{"key":"10.1016\/0306-4379(84)90024-3_BIB7","series-title":"Invited paper for the 2nd World Conf. on \u201cMathematics at the Service of Man\u201d","article-title":"A recursive partitioning process on computer science","author":"Flajolet","year":"1982"},{"issue":"No. 3","key":"10.1016\/0306-4379(84)90024-3_BIB8","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1147\/sj.133.0186","article-title":"VSAM data set design parameters","author":"Keehn","year":"1974","journal-title":"IBM Systems J."},{"key":"10.1016\/0306-4379(84)90024-3_BIB9","unstructured":"D. E. Knuth: The Art of Computer Programming, Vol. 3."},{"key":"10.1016\/0306-4379(84)90024-3_BIB10","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"key":"10.1016\/0306-4379(84)90024-3_BIB11","series-title":"Proc. VLDB Conf.","first-page":"517","article-title":"Virtual hashing: a dynamically changing hashing","author":"Litwin","year":"1978"},{"key":"10.1016\/0306-4379(84)90024-3_BIB12","author":"Litwin","year":"1980","journal-title":"Trie hashing. Rapport Sirius"},{"key":"10.1016\/0306-4379(84)90024-3_BIB13","series-title":"Proc. VLDB Conf.","first-page":"333","article-title":"Digital B. Trees","author":"Lomet","year":"1981"},{"key":"10.1016\/0306-4379(84)90024-3_BIB14","article-title":"Multidimensional tries used for associative searching","author":"Orenstein","year":"1981","journal-title":"School of Comp. Science. Mc Gill University, Technical Rep. SOGS-81-23"},{"key":"10.1016\/0306-4379(84)90024-3_BIB15","unstructured":"D. Plateau: Une structure compacte pour indexer un fichier totalement ordonn\u00e9: \u00e9valuation et mise en oeuvre. Thesis, Univ. Paris XI Orsay."},{"key":"10.1016\/0306-4379(84)90024-3_BIB16","unstructured":"M. Regnier: Analyse des performances du hachage dynamique Th\u00e8se Univ. Paris XI Orsay."},{"key":"10.1016\/0306-4379(84)90024-3_BIB17","series-title":"Proc. ACM SIGMOD","first-page":"10","article-title":"The K-D-B tree: a search structure for large multidimensional dynamic indexes","author":"Robinson","year":"1981"},{"key":"10.1016\/0306-4379(84)90024-3_BIB18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/360827.360831","article-title":"Attribute file organization in a paged memory environment","volume":"17","author":"Rothie","year":"1974","journal-title":"Comm ACM"},{"key":"10.1016\/0306-4379(84)90024-3_BIB19","doi-asserted-by":"crossref","DOI":"10.1145\/319540.319564","article-title":"New file organization based on dynamic hashing","author":"Scholl","year":"1981","journal-title":"ACM TODS"},{"key":"10.1016\/0306-4379(84)90024-3_BIB20","unstructured":"J. D. Ullman: Principles of Data Base Systems. Computer Science Press."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437984900243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437984900243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:52:37Z","timestamp":1552625557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437984900243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["0306437984900243"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(84)90024-3","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1984,1]]}}}