{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:59Z","timestamp":1725663719179},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573012"},{"type":"electronic","value":"9783540480471"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57301-1_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:42:36Z","timestamp":1330260156000},"page":"85-100","source":"Crossref","is-referenced-by-count":2,"title":["Filtered hashing"],"prefix":"10.1007","author":[{"given":"Ilsoo","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"No.4","key":"6_CR1","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/362575.362578","volume":"14","author":"V. Lum","year":"1971","unstructured":"V. Lum, P. Yuen, M. Dodd: Key-to address transform techniques: A fundamental performance study on large existing formatted files, Communications of ACM, Vol. 14, No. 4, Apr. 1971, pp. 228\u2013239.","journal-title":"Communications of ACM"},{"issue":"No.6","key":"6_CR2","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1145\/360238.360242","volume":"19","author":"D. Severance","year":"1976","unstructured":"D. Severance, R. Duhne: A Practitioner's Guide to Addressing Algorithms, Communications of ACM, Vol. 19, No. 6, June 1976, pp. 314\u2013326.","journal-title":"Communications of ACM"},{"issue":"No.3","key":"6_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/971701.50223","volume":"17","author":"M. Ramakrishna","year":"1988","unstructured":"M. Ramakrishna: Hashing in Practice, Analysis of Hashing and Universal Hashing, ACM SIGMOD Record, Vol. 17, No. 3, Sep. 1988, pp. 191\u2013199.","journal-title":"ACM SIGMOD Record"},{"issue":"No.2","key":"6_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/46157.330532","volume":"20","author":"R. Enbody","year":"1988","unstructured":"R. Enbody, H. Du: Dynamic Hashing Schemes, ACM Computing Surveys, Vol. 20, No. 2, June, 1988, pp. 85\u2013113.","journal-title":"ACM Computing Surveys"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P. Larson","year":"1978","unstructured":"P. Larson: Dynamic Hashing, BIT, 18 (1978), pp. 184\u2013201.","journal-title":"BIT"},{"issue":"No.3","key":"6_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, H. Strong: Extendible Hashing \u2014 A Fast Access Method for Dynamic Files, ACM Transactions on Database Systems, Vol. 4, No. 3, Sep. 1979, pp. 315\u2013344.","journal-title":"ACM Transactions on Database Systems"},{"issue":"No.6","key":"6_CR7","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSE.1982.236022","volume":"8","author":"H. Mendelson","year":"1982","unstructured":"H. Mendelson: Analysis of Extendible Hashing, IEEE Transactions on Software Engineering, Vol. 8, No. 6, Nov. 1982, pp. 611\u2013619.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR8","unstructured":"W. Litwin: Virtual Hashing: A Dynamically Changing Hashing, Proceedings of the Conference on Very Large Databases, 1978, pp. 517\u2013523."},{"key":"6_CR9","unstructured":"W. Litwin: Linear Hashing: A New Tool For File And Table Addressing, Proceedings of the Conference on Very Large Databases, 1980, pp. 212\u2013223."},{"key":"6_CR10","unstructured":"P. Larson: Linear Hashing with Partial Expansions, Proceedings of the Conference on Very Large Databases, 1980, pp. 224\u2013232"},{"issue":"No.4","key":"6_CR11","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/319758.319763","volume":"7","author":"P. Larson","year":"1982","unstructured":"P. Larson: Performance Analysis of Linear Hashing with Partial Expansions, ACM Transactions on Database Systems, Vol. 7, No. 4, Dec. 1982, pp. 566\u2013587.","journal-title":"ACM Transactions on Database Systems"},{"issue":"No.1","key":"6_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/3148.3324","volume":"10","author":"P. Larson","year":"1985","unstructured":"P. Larson: Linear Hashing with Overflow-Handling by Linear Probing, ACM Transactions on Database Systems, Vol. 10, No. 1, Mar. 1985, pp. 75\u201389.","journal-title":"ACM Transactions on Database Systems"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"K. Kawagoe: Modified Dynamic Hashing, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1985, pp. 201\u2013213.","DOI":"10.1145\/318898.318917"},{"key":"6_CR14","unstructured":"J. Mullen: Unified Dynamic Hashing, Proceedings of the Conference on Very Large Databases, Aug. 1984, pp. 473\u2013480."},{"issue":"No.4","key":"6_CR15","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1093\/comjnl\/25.4.478","volume":"25","author":"K. Ramamohanarao","year":"1982","unstructured":"K. Ramamohanarao, J. Lloyd: Dynamic Hashing Schemes, The Computer Journal, Vol. 25, No. 4, 1982, pp. 478\u2013485.","journal-title":"The Computer Journal"},{"issue":"No.3","key":"6_CR16","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/1270.1285","volume":"9","author":"K. Ramamohanarao","year":"1984","unstructured":"K. Ramamohanarao, R. Sacks-Davis: Recursive Linear Hashing, ACM Transactions on Database Systems, Vol. 9, No. 3, Sep. 1984, pp. 369\u2013391.","journal-title":"ACM Transactions on Database Systems"},{"issue":"No.1","key":"6_CR17","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/319540.319564","volume":"6","author":"M. Scholl","year":"1981","unstructured":"M. Scholl: New File Organizations Based on Dynamic Hashing, ACM Transactions on Database Systems, Vol. 6, No. 1, Mar. 1981, pp. 194\u2013211.","journal-title":"ACM Transactions on Database Systems"},{"issue":"No.1","key":"6_CR18","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/3148.318987","volume":"10","author":"E. Veklerov","year":"1985","unstructured":"E. Veklerov: Analysis of Dynamic Hashing with Deferred Splitting, ACM Transactions on Database Systems, Vol. 10, No. 1, Mar. 1985, pp. 90\u201396.","journal-title":"ACM Transactions on Database Systems"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"M. Ramakrishna, W. Tout: DDynamic External Hashing with Guaranteed Single Access Retrieval, Proceedings of the International Conference on Foundations of Data Organization and Algorithms, 1989, pp. 187\u2013201.","DOI":"10.1007\/3-540-51295-0_127"},{"issue":"No.3","key":"6_CR20","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/44498.44500","volume":"13","author":"P. Larson","year":"1988","unstructured":"P. Larson: Linear Hashing with Separators \u2014 A Dynamic Hashing Scheme Achieving One-Access Retrieval, ACM Transactions on Database Systems, Vol. 13, No. 3, Sep. 1988, pp. 366\u2013388.","journal-title":"ACM Transactions on Database Systems"},{"issue":"No.2","key":"6_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/114325.103714","volume":"16","author":"F. Cesarini","year":"1991","unstructured":"F. Cesarini, G. Soda: A Dynamic Hash Method with Signature, ACM Transactions on Database Systems, Vol. 16, No. 2, Jun. 1991, pp. 309\u2013337.","journal-title":"ACM Transactions on Database Systems"},{"issue":"No.11","key":"6_CR22","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/359863.359887","volume":"20","author":"R. Sprugnoli","year":"1977","unstructured":"R. Sprugnoli: Perfect hash functions: A single probe retrieving method for static sets, Communications of ACM, Vol. 20, No. 11, Nov. 1977, pp. 841\u2013850","journal-title":"Communications of ACM"},{"issue":"No.2","key":"6_CR23","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/63500.63521","volume":"14","author":"M. Ramakrishna","year":"1989","unstructured":"M. Ramakrishna, P. Larson: File Organization Using Composite Perfect Hashing, ACM Transactions on Database Systems, Vol. 14, No. 2, Jun. 1989, pp. 231\u2013263.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Foundations of Data Organization and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57301-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:01Z","timestamp":1619571781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57301-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573012","9783540480471"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-57301-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}