Reference22 articles.
1. Arroyuelo D, Claude F, Maneth S, Mäkinen V, Navarro G, Nguyen K, Sirén J, Välimäki N (2015) Fast in-memory XPath search using compressed indexes. Softw Pract Exp 45(3):399–434
2. Clark DR (1998) Compact PAT trees. PhD thesis, University of Waterloo, Waterloo
3. Lecture notes in computer science, vol;O Delpratt,2006
4. ACM international conference proceeding series, vol;O Delpratt,2008
5. Elias P (1974) Efficient storage and retrieval by content and address of static files. J ACM 21:246–260
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Learned Approach to Design Compressed Rank/Select Data Structures;ACM Transactions on Algorithms;2022-07-31
2. In-memory Representations of Databases via Succinct Data Structures;Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2018-05-27