Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient and robust feature extraction and pattern matching of time series by a lattice structure
Proceedings of the tenth international conference on Information and knowledge management
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continually evaluating similarity-based pattern queries on a streaming time series
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
The VLDB Journal — The International Journal on Very Large Data Bases
Maintaining variance and k-medians over data stream windows
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Q+Rtree: Efficient Indexing for Moving Object Databases
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Contorting high dimensional data for efficient main memory KNN processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Online event-driven subsequence matching over financial data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Identifying similarities, periodicities and bursts for online search queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Distributed caching of multi-dimensional data in mobile environments
Proceedings of the 6th international conference on Mobile data management
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
Indexing multi-dimensional uncertain data with arbitrary probability density functions
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Atomic Wedgie: Efficient Query Filtering for Streaming Times Series
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Real-Time Processing of Range-Monitoring Queries in Heterogeneous Mobile Databases
IEEE Transactions on Mobile Computing
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
An adaptive nearest neighbor classification algorithm for data streams
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
The influence of global constraints on similarity measures for time-series databases
Knowledge-Based Systems
| Hi-index | 0.01 |
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified when the database we are dealing with, is frequently updated, as only limited time is available to perform the maintenance. In this paper, we propose a novel tree maintenance mechanism for the problem of answering approximate k-Nearest Neighbor queries with a probabilistic guarantee on timeseries streams. When the underlying data change, we may choose to defer updating the tree as long as the probabilistic guarantee of answering queries is high. To prolong such deferment, we present innovative techniques that maintain the utility of the tree by migrating its pivots and by partially reconstructing it. As the probabilistic guarantee decays with time and crosses the minimum guarantee threshold, all of the deferred updates are performed. In essence, our work offers an elegant compromise between the accuracy guarantee of query results and the cost of providing them. With extensive empirical studies, we also show the flexibility and efficiency of our approach.