Author:
Ferragina Paolo,Koudas Nick,Muthukrishnan S.,Srivastava Divesh
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference17 articles.
1. Geometric range searching and its relatives;Agarwal,1998
2. L. Arge, V. Samoladas, J.S. Vitter, On two-dimensional indexability and optimal range search indexing, Proceedings of ACM Principles of Database Systems (PODS), Philadelphia, PA, 1999, pp. 346–357.
3. Prefix B-trees;Bayer;ACM Trans. Database Systems,1977
4. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of ACM SIGMOD, Atlantic City, NJ, 1990, pp. 220–231.
5. The string B-tree;Ferragina;J. ACM,1999
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Gapped Indexing for Consecutive Occurrences;Algorithmica;2022-10-20
2. Tight dynamic problem lower bounds from generalized BMM and OMv;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. On hardness of several string indexing problems;Theoretical Computer Science;2015-05
4. Spaces, Trees, and Colors;ACM Computing Surveys;2014-04
5. On Hardness of Several String Indexing Problems;Combinatorial Pattern Matching;2014