Two-dimensional substring indexing

Journal of Computer and System Sciences

Volumn 66, Issue 4, 2003, Pages 763-774

  Ferragina, Paolo ^a   Koudas, Nick ^b   Muthukrishnan, S ^b   Srivastava, Divesh ^b  

^a UNIVERSITY OF PISA   (Italy)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

SUBSTRING MATCHING;

INDEXING (OF INFORMATION);

EID: 0037490904     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00028-X     Document Type: Conference Paper

References (17)

1. P. Agarwal, J. Erickson, Geometric range searching and its relatives, in: B. Chazelle, J. Goodman, R. Pollack (Eds.), Advances in Discrete and Computational Geometry, Amer. Math. Soc., Providence, RI, 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. R. Bayer, K. Unterauer, Prefix B-trees, ACM Trans. Database Systems 2 (1) (1977) 11-26.
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. P. Ferragina, R. Grossi, The string B-tree: a new data structure for string search in external memory and its applications, J. ACM 46 (2) (1999) 237-280.
6. V. Gaede, O. Günther, Multidimensional access methods, ACM Comput. Surveys 30 (2) (1998) 170-231.
7. G. Gonnet, R. Baeza-Yates, T. Snider, New indices for text: PAT trees and PAT arrays, in: Information Retrieval: Data Structures and Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1992.
8. P. Gupta, R. Janardan, M. Smid, Further results on generalized intersection searching problems: counting, reporting, and dynamization, J. Algorithms 19 (1995) 282-317.
9. A. Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of ACM SIGMOD, Boston, MA, 1984, pp. 47-57.
10. H.V. Jagadish, N. Koudas, D. Srivastava, On effective multi-dimensional indexing for strings, Proceedings of ACM SIGMOD, Dallas, TX, 2000, pp. 403-414.
11. U. Manber, G. Myers, Suffix arrays: a new method for online string searches, SIAM J. Comput. 22 (5) (1993) 935-948.
12. Y. Matias, S. Muthukrishnan, S. Sahinalp, J. Ziv, Augmenting suffix trees with applications, Proceedings of European Symposium on Algorithms, Venice, Italy, 1998, pp. 67-78.
13. E.M. McCreight, A space-economical suffix tree construction algorithm, J. ACM 23 (1976) 262-272.
14. D.R. Morrison, PATRICIA: practical algorithm to retrieve information coded in alphanumeric, J. ACM 15 (4) (1968) 514-534.
15. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
16. T. Sellis, N. Roussopoulos, C. Faloutsos, The R + -tree: a dynamic index for multi-dimensional data, Proceedings of VLDB, Brighton, England, 1987, pp. 507-518.
17. J.S. Vitter, E.A.M. Shriver, Optimal disk I/O with parallel block transfer, Proceedings of Symposium on Theory of Computing (STOC), Baltimore, MD, 1990, pp. 159-169.