{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:43Z","timestamp":1725663463427},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190745"},{"type":"electronic","value":"9783540390954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19074-0_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:01:21Z","timestamp":1330200081000},"page":"309-335","source":"Crossref","is-referenced-by-count":2,"title":["Multilevel trie hashing"],"prefix":"10.1007","author":[{"given":"W.","family":"Litwin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Zegour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., Mc. Creight, E. Organization and maintenance of large ordered indexes. Acta Informatica, 1, 3 (1972), 173\u2013189.","journal-title":"Acta Informatica"},{"issue":"1","key":"17_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/320521.320530","volume":"2","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Unterauer, K. Prefix B-Trees. ACM TODS, 2, 1,(Mar 1977), 11\u201326.","journal-title":"ACM TODS"},{"key":"17_CR3","unstructured":"Briandais (de la), R. File Searching Using Variable Length Keys. Proc. of Est. Joint Comp. Conf, 295\u2013298."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Burkhard, W. Interpolation-Based Index Maintenance. PODS 83.ACM, (March 1983), 76\u201389.","DOI":"10.1145\/588058.588070"},{"issue":"2","key":"17_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D. The ubiquitous B-tree. ACM Comp. Surv. 11, 2 (June 1979), 121\u2013137.","journal-title":"ACM Comp. Surv."},{"key":"17_CR6","unstructured":"Date, C., J. An Introduction to Relational Database Systems. 4-th ed., Addison-Wesley, 1986, 639"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ellis, C., S. Extendible Hashing for Concurrent Operation and Distributed Data. PODS 83. ACM, (March 1983), 106\u2013116.","DOI":"10.1145\/588058.588072"},{"issue":"3","key":"17_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R. Extendible hashing \u2014 a fast access method for dynamic files. ACM-TODS, 4, 3, (Sep 1979), 315\u2013344.","journal-title":"ACM-TODS"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"Ph. Flajolet","year":"1983","unstructured":"Ph. Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica, 20, 345\u2013369 (1983).","journal-title":"Acta Informatica"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Fredkin, E. Trie Memory, CACM, 3, 490\u2013499.","DOI":"10.1145\/367390.367400"},{"key":"17_CR11","unstructured":"Gonnet, G., H. Handbook of ALGORITHMS and DATA STRUCTURES. Addison-Wesley, 1984."},{"key":"17_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, 1973."},{"key":"17_CR13","unstructured":"Krishnamurty, R., Morgan S., P. Query Processing on Personal Computers \u2014 A Pragmatic Approach. VLDB-84, Singapore (Aug. 1984), 26\u201329."},{"key":"17_CR14","unstructured":"de Jonge, W., Tanenbaum, A., S., Van de Riet R. A Fast, Tree-based Access Method for Dynamic Files. Rapp IR-70, Vrije Univ. Amsterdam, (Jul 1981), 20."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P. Larson","year":"1978","unstructured":"Larson, P., A. Dynamic hashing. BIT 18 (1978), 184\u2013201.","journal-title":"BIT"},{"key":"17_CR16","first-page":"300","volume":"82","author":"P. Larson","year":"1982","unstructured":"Larson, P.,, A. A single file version of linear hashing with partial expansions. VLDB 82, ACM, (Sep 1982), 300\u2013309.","journal-title":"VLDB"},{"key":"17_CR17","first-page":"517","volume":"78","author":"W. Litwin","year":"1978","unstructured":"Litwin, W. Virtual hashing: a dynamically changing hashing. VLDB 78, ACM, (Sep 1978), 517\u2013523.","journal-title":"VLDB"},{"key":"17_CR18","first-page":"212","volume":"80","author":"W. Litwin","year":"1980","unstructured":"Litwin, W. Linear hashing: A new tool for files and tables addressing. VLDB 80, ACM, (Sep 1980), 212\u2013223.","journal-title":"VLDB"},{"key":"17_CR19","first-page":"19","volume":"81","author":"W. Litwin","year":"1981","unstructured":"Litwin, W. Trie hashing. SIGMOD 81. ACM, (May 1981), 19\u201329.","journal-title":"SIGMOD"},{"key":"17_CR20","unstructured":"Litwin, W. Data Access Methods and Structures to Enhance Performance. Database performance, State of the Art Report 12:4. Pergamon Infotech, 1984, 93\u2013108."},{"key":"17_CR21","unstructured":"Litwin, Witold. Trie hashing: Further properties and performances. Int. Conf. on Foundation of Data Organisation. Kyoto, May 1985. Plenum Press."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Litwin, W., Lomet, D. Bounded Disorder Access Method. 2-nd Int. Conf. on Data Eng. IEEE, Los Angeles, (Feb. 1986).","DOI":"10.1109\/ICDE.1986.7266204"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Lomet, D., B. Multi-table search for B-tree files. ACM-SIGMOD, 1979, 35\u201342.","DOI":"10.1145\/582095.582101"},{"key":"17_CR24","first-page":"333","volume":"81","author":"D. Lomet","year":"1981","unstructured":"Lomet, D. Digital B-trees. VLDB 81. ACM, (Sep 1981), 333\u2013344.","journal-title":"VLDB"},{"issue":"1","key":"17_CR25","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/319830.319837","volume":"8","author":"D. Lomet","year":"1983","unstructured":"Lomet, D. Bounded Index Exponential Hashing. ACM TODS, 8, 1, (Mar 1983), 136\u2013165.","journal-title":"ACM TODS"},{"issue":"4","key":"17_CR26","first-page":"389","volume":"21","author":"J. Mullin","year":"1891","unstructured":"Mullin, J., K. Tightly controlled linear hashing without separate overflow storage. BIT, 21, 4, (1891), 389\u2013400.","journal-title":"BIT"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K., C. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM TODS, (March 1984).","DOI":"10.1145\/348.318586"},{"key":"17_CR28","first-page":"132","volume":"83","author":"J. Orenstein","year":"1983","unstructured":"Orenstein, J. A Dynamic Hash File for Random and Sequential Accessing. VLDB 83, (Nov 1983), 132\u2013141.","journal-title":"VLDB"},{"key":"17_CR29","first-page":"90","volume":"83","author":"M. Ouksel","year":"1983","unstructured":"Ouksel, M. Scheuerman, P. Storage Mapping for Multidimensional Linear Dynamic Hashing. PODS 83. ACM, (March 1983), 90\u2013105.","journal-title":"PODS"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Ramamonohanarao, K., Sacks-Davis, R. Recursive Linear Hashing. ACM-TODS, 9, 3, (Sep. 1984).","DOI":"10.1145\/1270.1285"},{"key":"17_CR31","unstructured":"Regnier, M. Linear hashing with groups of reorganization. An algorithm for files without history. In Sheuermann P. (ed): Improving Database Usability and Responsiveness, Academic Press, (1982), 257\u2013272."},{"issue":"1","key":"17_CR32","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1145\/319540.319565","volume":"6","author":"A. Rosenberg","year":"1981","unstructured":"Rosenberg, A.,, L., Snyder, L. Time and space optimality in B-trees. ACM-TODS, 6,1 (1981), 174\u2013193.","journal-title":"ACM-TODS"},{"issue":"2","key":"17_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H. The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16, 2 (June 1984), 187\u2013260.","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"17_CR34","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/319540.319564","volume":"6","author":"M. Scholl","year":"1981","unstructured":"Scholl, M. New File Organizations Based on Dynamic Hashing. ACM TODS, 6, 1, (March 1981), 194\u2013211.","journal-title":"ACM TODS"},{"issue":"2","key":"17_CR35","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/3857.3858","volume":"10","author":"Shou-Hsuan Stephen Huang","year":"1985","unstructured":"Shou-Hsuan Stephen Huang. Height-Balanced Trees. ACM TODS, 10, 2 (1985), 261\u2013284.","journal-title":"ACM TODS"},{"issue":"5","key":"17_CR36","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(82)90123-5","volume":"15","author":"M. Tamminen","year":"1982","unstructured":"Tamminen, M. Extendible hashing with overflow. Inf. Proc. Lett. 15, 5, 1982, 227\u2013232.","journal-title":"Inf. Proc. Lett."},{"key":"17_CR37","first-page":"142","volume":"83","author":"L. Torenvliet","year":"1983","unstructured":"Torenvliet, L., Van Emde Boas, P. The Reconstructive and Optimization of Trie Hashing Functions. VLDB 83, (Nov. 1983), 142\u2013157.","journal-title":"VLDB"},{"key":"17_CR38","unstructured":"Tremblay, J-P., Sorenson, P., G. An Introduction to Data Structures. 2-nd ed., McGraw-Hill, 1984, 861."},{"key":"17_CR39","unstructured":"Tropf, H., Herzog, H. Multidimensional range search in dynamically balanced trees. Agnew. Inf. 2, 71\u201377."},{"key":"17_CR40","unstructured":"Wiederhold, G. Database design. McGraw-hill Book Company, 1983."},{"key":"17_CR41","first-page":"159","volume":"18","author":"A. Yao","year":"1983","unstructured":"Yao, A.,, C. On random 2\u20133 trees. Acta Inf. 18, (1983), 159\u2013170.","journal-title":"Acta Inf."},{"key":"17_CR42","unstructured":"Zegour, D. Implementation du hachage digital multiniveaux. Techn. Rep., (Sep. 1986), INRIA."}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology\u2014EDBT '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19074-0_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:37Z","timestamp":1605644197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19074-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190745","9783540390954"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-19074-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}