Adaptive Algorithms for Cache-efficient Trie Search-Reference-Cited by-同舟云学术

Adaptive Algorithms for Cache-efficient Trie Search

Published:1999 Issue: Volume: Page:300-315
ISSN:0302-9743
Container-title:Algorithm Engineering and Experimentation
language:
Short-container-title:

Author:

Acharya Anurag,Zhu Huican,Shen Kai

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48518-X_18

Reference29 articles.

1. 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–16, Washington, D.C., May 1993.

2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases, 1994.

3. E. Ai-Sunwaiyel and E. Horowitz. Algorithms for trie compaction. ACM Transactions on Database Systems, 9(2):243–63, 1984.

4. J. Aoe, K. Marimoto, and T. Sato. An efficient implementation of trie structure. Software Practice and Experience, 22(9):695–721, 1992.

5. 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–91, 1996.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Nonlinear Learned String Indexing;IEEE Access;2023

2. Engineering a Textbook Approach to Index Massive String Dictionaries;String Processing and Information Retrieval;2023

3. Applying burst-tries for error-tolerant prefix search;Information Retrieval Journal;2022-10-18

4. Compressed String Dictionaries via Data-Aware Subtrie Compaction;String Processing and Information Retrieval;2022

5. A Compression-Based Design for Higher Throughput in a Lock-Free Hash Map;Euro-Par 2020: Parallel Processing;2020