Fast subsequence matching in time-series databases
Explore this paper's citation graph
- Type
- article
- Published
- 1994-05-24
- Cited by
- 2,078
- References
- 43
- Access
- Open access
- OpenAlex
- https://openalex.org/W2128061541
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6595462
Keywords
Subsequence, Search engine indexing, Computer science, Bounding overwatch, Sliding window protocol
References
- A Bibliography on Temporal Databases
- An Interval Classifier for Database Mining Applications
- Technical Analysis of Stock Trends
- QBISM: A Prototype 3-D Medical Image Database System.
- Bibliography on temporal databases
- The JPEG still picture compression standard
- Bibliography on spatiotemporal databases
- Basic local alignment search tool.
- Access methods for text
- QBIC project: querying images by content, using color, texture, and shape
- Spatial query processing in an object-oriented database system
- Database Mining: A Performance Perspective
- QBISM: extending a DBMS to support 3D medical images
- On packing R-trees
- R-trees: a dynamic index structure for spatial searching
- The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
- Spatial search with polyhedra
- The Grid File
- A retrieval technique for similar shapes
- The R*-tree: an efficient and robust access method for points and rectangles
Cited by
- Discovering Causal Chains by Integrating Plan Recognition and Sequential Pattern Mining
- A Representation of Time Series for Temporal Web Mining
- Using Multi-Scale Histograms to Answer Pattern Existence and Shape Match Queries
- Fourier-transform based techniques in efficient retrieval of similar time sequences
- Probabilistic Process Monitoring in Process-Aware Information Systems
- Indexation de séquences de descripteurs
- An Efficient Framework for Iterative Time-Series Trend Mining
- Recherche de sous-structures arborescentes ordonnées fréquentes au sein de bases de données semi-structurées
- Making Time-Series Classification More Accurate Using Learned Constraints
- Optimal Construction of Multi-Dimensional Indexes in Time-Series Databases: A Physical Database Design Approach
- Efficient Stream Sequence Matching Algorithms for Handheld Devices on Time-Series Stream Data
- A Suffix Tree for Fast Similarity Searches of Time-Warped Sub-Sequences in Sequence Databases
- PATTERN-BASED CHARACTERIZATION OF TIME SERIES
- Iterative Deepening Dynamic Time Warping for Time Series
- Moving Objects Management
- Early abandon to accelerate exact dynamic time warping
- Representatives for Visually Analyzing Cluster Hierarchies
- Parallel Algorithms for High-Dimensional Proximity Joins
- Relational Implementation of Multi-dimensional Indexes for Time Series
- Time Series Indexing Taking Advantage of the Generalized Suffix Tree
Related papers
- Discordances in HER2 status between primary gastric cancer and corresponding metastatic sites.
- A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings
- Computing The Longest Common Almost-Increasing Subsequence
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- Algorithms For The Constrained Longest Common Subsequence Problems
- Video clips matching based on efficient and effective longest common subsequence
- Longest increasing subsequences in sliding windows