The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
VideoTrails: representing and visualizing structure in video sequences
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Multidimensional access methods
ACM Computing Surveys (CSUR)
Wavelets for computer graphics: theory and applications
Wavelets for computer graphics: theory and applications
WALRUS: a similarity retrieval algorithm for image databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Constructing Suffix Trees On-Line in Linear Time
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A review on time series data mining
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
We present the S2-Tree, an indexing method for subsequence matching of spatial objects. The S2-Tree locates subsequences within a collection of spatial sequences, i.e., sequences made up of spatial objects, such that the subsequences match a given query pattern within a specified tolerance. Our method is based on (i) the string-searching techniques that locate substrings within a string of symbols drawn from a discrete alphabet (e.g., ASCII characters) and (ii) the spatial access methods that index (unsequenced) spatial objects. Particularly, the S2-Tree can be applied to solve problems such as subsequence matching of time-series data, where features of subsequences are often extracted and mapped into spatial objects. Moreover, it supports queries such as "what is the longest common pattern of the two time series?", which previous subsequence matching algorithms find difficult to solve efficiently.