{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:03:12Z","timestamp":1756425792498,"version":"3.44.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662273"},{"type":"electronic","value":"9783540485186"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48518-x_18","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T13:57:15Z","timestamp":1195048635000},"page":"300-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Adaptive Algorithms for Cache-efficient Trie Search"],"prefix":"10.1007","author":[{"given":"Anurag","family":"Acharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huican","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large data bases. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 207\u201316, Washington, D.C., May 1993.","DOI":"10.1145\/170035.170072"},{"key":"18_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases, 1994."},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/329.295","volume":"9","author":"E. Ai-Sunwaiyel","year":"1984","unstructured":"E. Ai-Sunwaiyel and E. Horowitz. Algorithms for trie compaction. ACM Transactions on Database Systems, 9(2):243\u201363, 1984.","journal-title":"ACM Transactions on Database Systems"},{"issue":"9","key":"18_CR4","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1002\/spe.4380220902","volume":"22","author":"J. Aoe","year":"1992","unstructured":"J. Aoe, K. Marimoto, and T. Sato. An efficient implementation of trie structure. Software Practice and Experience, 22(9):695\u2013721, 1992.","journal-title":"Software Practice and Experience"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/69.506713","volume":"8","author":"J. Aoe","year":"1996","unstructured":"J. Aoe, K. Morimoto, M. Shishibori, and K. Park. A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering, 8(3):476\u201391, 1996.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"18_CR6","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1145\/42411.42420","volume":"31","author":"A. Appel","year":"1988","unstructured":"A. Appel and G. Jacobson. The world\u2019s fastest scrabble program. Communications of the ACM, 31(5):572\u20138, 1988.","journal-title":"Communications of the ACM"},{"key":"18_CR7","unstructured":"J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. In Proceedings of SODA\u201997, 1997."},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, J. Blumer, D. Haussler, and R. McConnel. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3):578\u201395, 1987.","journal-title":"Journal of the ACM"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/363958.363987","volume":"7","author":"H. Clampett","year":"1964","unstructured":"H. Clampett. Randomized binary searching with tree structures. Communications of the ACM, 7(3):163\u20135, 1964.","journal-title":"Communications of the ACM"},{"key":"18_CR10","unstructured":"J. Clement, P. Flajolet, and B. Vallee. The analysis of hybrid trie structures. Technical Report 3295, INRIA, Nov 1997."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small forwarding tables for fast routing lookups. Computer Communication Review, October 1997.","DOI":"10.1145\/263105.263133"},{"issue":"10","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1002\/spe.4380211004","volume":"21","author":"J. Dundas","year":"1991","unstructured":"J. Dundas. Implementing dynamic minimal-prefix tries. Software Practice and Experience, 21(10):1027\u201340, 1991.","journal-title":"Software Practice and Experience"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"P. Flajolet and C. Puech. Partial match retrieval of multidimensional data. Journal of the ACM, 33(2):371\u2013407, 1986.","journal-title":"Journal of the ACM"},{"key":"18_CR14","unstructured":"G. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures: in Pascal and C. Addison-Wesley, second edition, 1991."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"E. Han, V. Karypis, and V. Kumar. Scalable parallel data mining for association rules. In Proceedings of SIGMOD\u201997, 1997.","DOI":"10.1145\/253260.253330"},{"key":"18_CR16","unstructured":"J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufman, second edition, 1996."},{"key":"18_CR17","unstructured":"D. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973."},{"key":"18_CR18","unstructured":"A. Lamarca and R. Ladner. The influence of caches on the performance of sorting. In Proceedings of SODA\u201997, 1997."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/spe.4380230103","volume":"23","author":"C. Lucchesi","year":"1993","unstructured":"C. Lucchesi and T. Knowaltowski. Applications of finite automata representing large vocabularies. Software Practice and Experience, 23(1):15\u201330, 1993.","journal-title":"Software Practice and Experience"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/360248.360258","volume":"19","author":"K. Maly","year":"1976","unstructured":"K. Maly. Compressed tries. Communications of the ACM, 19:409\u201315, 1976.","journal-title":"Communications of the ACM"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"S. Nilsson and G. Karlsson. Fast address lookup for internet routers. In Proceedings of IEEE Broadband Communications\u201998, 1998.","DOI":"10.1007\/978-0-387-35378-4_2"},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Computer Programs for Spelling Correction","author":"J. Peterson","year":"1980","unstructured":"J. Peterson. Computer Programs for Spelling Correction. Lecture Notes in Computer Science, Springer Verlag, 1980."},{"key":"18_CR23","unstructured":"IBM Quest Data Mining Project. The Quest retail transaction data generator10, 1996."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/0205003","volume":"5","author":"R. Rivest","year":"1976","unstructured":"R. Rivest. Partial match retrieval algorithms. SIAM Journal on Computing, 5:19\u201350, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"18_CR25","unstructured":"S. Sharma and A. Acharya. The msim memory hierarchy simulator. Personal Communication, 1997."},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"S. Venkatachary and G. Varghese. Faster IP Lookups Using Controlled Prefix Expansion. In Proceedings of SIGMETRICS\u201998, pages 1\u201310, 1998.","DOI":"10.1145\/277851.277863"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable high speed IP routing lookups. In Proceedings of SIGCOMM\u201997, 1997.","DOI":"10.1145\/263105.263136"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"M. Zaki, M. Ogihara, S. Parthasarthy, and W. Li. Parallel data mining for association rules on shared-memory multi-processors. In Proceedings of Supercomputing\u201996, 1996.","DOI":"10.1145\/369028.369117"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"M. Zaki, S. Parthasarathy, and W. Li. A localized algorithm for parallel association mining. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997.","DOI":"10.1145\/258492.258524"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48518-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T07:51:16Z","timestamp":1756367476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48518-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662273","9783540485186"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-48518-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}