Using multiple indexes for efficient subsequence matching in time-series databases
From MaRDI portal
Recommendations
- Efficient time-series subsequence matching using duality in constructing windows
- scientific article; zbMATH DE number 2088759
- Efficient indexing of interval time sequences
- Efficient moving average transform-based subsequence matching algorithms in time-series databases
- scientific article; zbMATH DE number 2089862
Cites work
Cited in
(10)- Efficient moving average transform-based subsequence matching algorithms in time-series databases
- Qualitative-probabilistic-network-based modeling of temporal causalities and its application to feedback loop identification
- scientific article; zbMATH DE number 1700004 (Why is no real title available?)
- Boundary-based lower-bound functions for dynamic time warping and their indexing
- scientific article; zbMATH DE number 2101174 (Why is no real title available?)
- Time-series data aggregation index
- scientific article; zbMATH DE number 1982690 (Why is no real title available?)
- Efficient indexing of interval time sequences
- Efficient time-series subsequence matching using duality in constructing windows
- An efficient algorithm for attribute-based subsequence matching
This page was built for publication: Using multiple indexes for efficient subsequence matching in time-series databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465341)