The S2-Tree: An index structure for subsequence matching of spatial objects

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2035, Issue , 2001, Pages 312-323

  Wang, Haixun ^a   Perng, Chang Shing ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTER SETS; FORESTRY; INDEXING (OF INFORMATION); TIME SERIES; TREES (MATHEMATICS);

DISCRETE ALPHABET; INDEXING METHODS; SPATIAL ACCESS METHODS; SPATIAL SEQUENCES; STRING-SEARCHING; SUBSEQUENCE MATCHING; SUBSEQUENCE MATCHING ALGORITHMS; TIME-SERIES DATA;

DATA MINING;

EID: 84942852653     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45357-1_34     Document Type: Conference Paper

References (16)

1. McCreight, E.M. (1976) \A space-economical suffix tree construction algorithm," In Journal of the ACM, Vol. 23, No.2, pp. 262-72, April 1976.
2. Ukkonen, E. (1992) \Constructing suffix-trees on-line in linear time," In Algorithms, Software, Architecture: Information Processing 92, Vol. 1, pp. 484-92.
3. Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos: \Fast subsequence matching in time-series databases," In SIGMOD Conference 1994: Pp. 419-429.
4. S. Berchtold, D. A. Keim, H. Kriegel: \The X-tree: An index structure for highdimensional data." In VLDB 1996, Mumbai(Bombay), India.
5. Shawney H., Hafner J.: \Eficient color histogram indexing", In Proc. Int. Conf. on Image Processing, 1994.
6. Beckmann N., Kriegel H.-P., Schneider R., Seeger B.: \The R∗-tree: An eficient and robust access method for points and rectangles", In SIGMOD 90.
7. Guttman A.: \R-trees: A dynamic index structure for spatial searching", In Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, MA, 1984, pp. 47-57.
8. V. Gaede, O. Günther: \Multidimensional access methods", In ACM Computing Surveys, Volumn 30, Number 2, June 1998.
9. K. Hinriches, J. Nievergelt: \The grid file: A data structure to support proximity queries on spatial objects." In Proc. of the WG'83, 100-113, Linz, Austria, 1983.
10. C. S. Perng, H. Wang, S. R. Zhang, D. S. Parker: \Landmarks: A new model for similarity-based pattern querying in time series databases." In ICDE 2000.
11. A. Natsev, R. Rastogi, K. Shim: \WALRUS: A similarity retrieval algorithm for image databases." In SIGMOD, Philadelphia, 1999.
12. E. J. Stollnitz, T. D. DeRose, and D. H. Salesin: Wavelets for Comptuer Graphics: Theory and Applications. Morgan Kaufmann, 1996.
13. V. Kobla, D. Doermann, C. Faloutsos: \VideoTrails: Representing and visualizing structure in video sequences." In ACM Multimedia 1997: 335-346.
14. Y. Lamdan, H. Wolfson, "Geometric Hashing: A General and Eficient Model Based Recognition Scheme." In Intl. Conf. on Computer Vision, 218-249, 1988.
15. Kukich K.: \Techniques for Automatically Correcting Words in Text", In ACM Computing Surveys, Vol. 24, No. 4, 1992, pp. 377-440.
16. Ralf Hartmut Güting, et al: \A Foundation for Representing and Querying Moving Objects", To appear in ACM Transactions on Database Systems.