Sciweavers

255 search results - page 6 / 51
» Grid-Based Indexing for Large Time Series Databases
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 2 months ago
Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
Davood Rafiei, Alberto O. Mendelzon
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
15 years 11 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
DEXA
2008
Springer
120views Database» more  DEXA 2008»
14 years 11 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
TMA
2012
Springer
278views Management» more  TMA 2012»
13 years 5 months ago
tsdb: A Compressed Database for Time Series
Large-scale network monitoring systems require efficient storage and consolidation of measurement data. Relational databases and popular tools such as the Round-Robin Database sho...
Luca Deri, Simone Mainardi, Francesco Fusco
DBA
2006
236views Database» more  DBA 2006»
14 years 11 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...