Two-dimensional substring indexing

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 282-288

  Ferragina, P ^a   Koudas, N ^a   Muthukrishnan, S ^a   Srivastava, D ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; INTERNET; PROBABILITY; QUERY LANGUAGES; TREES (MATHEMATICS); XML;

BINARY TREES; SUBSTRING INDEXING;

INDEXING (OF INFORMATION);

EID: 0034819893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375610     Document Type: Conference Paper

References (23)

1. On two-dimensional indexability and optimal range search indexing
2. Geometric range searching and its relatives
3. Prefix B-trees
4. The R*-tree: An efficient and robust access method for points and rectangles
5. A fully dynamic data structure for external substring search
6. Fast string searching in secondary storage: Theoretical developments and experimental results
7. The string B-tree: A new data structure for string search in external memory and its applications
8. Multidimensional access methods
9. New indices for text: PAT trees and PAT arrays
10. Further results on generalized intersection search problems: Counting, reporting and dynamization
11. R-trees: A dynamic index structure for spatial searching
12. On effective multi-dimensional indexing for strings
13. Hilbert R-tree: An improved R-tree using fractals
14. Suffix arrays: A new method for online string searches
15. Augmenting suffix trees with applications
16. A space-economical suffix tree construction algorithm
17. PATRICIA: Practical algorithm to retrieve information coded in alphanumeric
18. The K-D-B-tree: A search structure for large multidimensional dynamic indexes
19. The R+-tree: A dynamic index for multi-dimensional data
20. Filter trees for managing spatial data over a range of size granularities
21. Optimal disk I/O with parallel block transfer
22. External memory algorithms and data structures: Dealing with massive data