Skyline index for time series data

Citations Over TimeTop 10% of 2004 papers

Abstract

We have developed a new indexing strategy that helps overcome the curse of dimensionality for time series data. Our proposed approach, called skyline index, adopts new skyline bounding regions (SBR) to approximate and represent a group of time series data according to their collective shape. Skyline bounding regions allow us to define a distance function that tightly lower bounds the distance between a query and a group of time series data. In an extensive performance study, we investigate the impact of different distance functions by various dimensionality reduction and indexing techniques on the performance of similarity search, including index pages accessed, data objects fetched, and overall query processing time. In addition, we show that, for k-nearest neighbor queries, the proposed skyline index approach can be coupled with the state of the art dimensionality reduction techniques such as adaptive piecewise constant approximation (APCA) and improve its performance by up to a factor of 3.

Related Papers

• → Indexing Methods for Similarity Searching(2007)9 cited
• Indexing techniques for metric databases with costly searches(2007)
• → Node Availability for Distributed Systems considering processor and RAM utilization(2007)4 cited
• → Dimensionality reduction for dimension-specific search(2007)
• → Indexing Methods for Similarity Searching(2007)