The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Accounting for boundary effects in nearest neighbor searching
Proceedings of the eleventh annual symposium on Computational geometry
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Wavelet-based histograms for selectivity estimation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Multi-dimensional selectivity estimation using compressed histogram information
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Approximating multi-dimensional aggregate range queries over real attributes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
ACM Transactions on Mathematical Software (TOMS)
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
Two ellipse-based pruning methods for group nearest neighbor queries
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Cost models for distance joins queries using R-trees
Data & Knowledge Engineering
IMPACT: a twin-index framework for efficient moving object query processing
Data & Knowledge Engineering
Genetic algorithms for approximate similarity queries
Data & Knowledge Engineering
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
A privacy preserving technique for distance-based classification with worst case privacy guarantees
Data & Knowledge Engineering
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Location Privacy in Moving-Object Environments
Transactions on Data Privacy
Adaptive indexing of moving objects with highly variable update frequencies
Journal of Computer Science and Technology
Workload-aware indexing of continuously moving objects
Proceedings of the VLDB Endowment
Efficient difference NN queries for moving objects
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Continuous online index tuning in moving object databases
ACM Transactions on Database Systems (TODS)
Indexing multi-dimensional data in a cloud system
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
The VLDB Journal — The International Journal on Very Large Data Bases
Optimized algorithms for predictive range and KNN queries on moving objects
Information Systems
Design and analysis of a ranking approach to private location-based services
ACM Transactions on Database Systems (TODS)
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
A moving-object index for efficient query processing with peer-wise location privacy
Proceedings of the VLDB Endowment
Efficient construction of histograms for multidimensional data using quad-trees
Decision Support Systems
Bs-tree: a self-tuning index of moving objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Nearest neighbor search on vertically partitioned high-dimensional data
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
A comparative study of two density-based spatial clustering algorithms for very large datasets
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Probabilistic spatial queries on existentially uncertain data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Spatial indexing for massively update intensive applications
Information Sciences: an International Journal
Cost models for nearest neighbor query processing over existentially uncertain spatial data
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.01 |
Existing models for nearest neighbor search in multidimensional spaces are not appropriate for query optimization because they either lead to erroneous estimation or involve complex equations that are expensive to evaluate in real-time. This paper proposes an alternative method that captures the performance of nearest neighbor queries using approximation. For uniform data, our model involves closed formulae that are very efficient to compute and accurate for up to 10 dimensions. Further, the proposed equations can be applied on nonuniform data with the aid of histograms. We demonstrate the effectiveness of the model by using it to solve several optimization problems related to nearest neighbor search.