Linear programming: active set analysis and computer programs
Linear programming: active set analysis and computer programs
Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
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
A retrieval technique for similar shapes
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Molecular docking using shape descriptors
Journal of Computational Chemistry
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Nearest neighbor searching and applications
Nearest neighbor searching and applications
Enclosing a set of objects by two minimum area rectangles
Journal of Algorithms
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Feature-Based Retrieval of Similar Shapes
Proceedings of the Ninth International Conference on Data Engineering
Proceedings of the Ninth International Conference on Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Enclosing Many Boxes by an Optimal Pair of Boxes
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
The Performance of Object Decomposition Techniques for Spatial Query Processing
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Query Processing of Spatial Objects: Complexity versus Redundancy
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
ACM Computing Surveys (CSUR)
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On semantic caching and query scheduling for mobile nearest-neighbor search
Wireless Networks - Special issue: Pervasive computing and communications
The Active Vertice method: a performant filtering approach to high-dimensional indexing
Data & Knowledge Engineering
A web-based spatial data access system using semantic R-trees
Information Sciences—Informatics and Computer Science: An International Journal
IEEE Transactions on Knowledge and Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
A practical approach for efficiently answering top-k relational queries
Decision Support Systems
Symbolic adaptive neuro-fuzzy inference for data mining of heterogenous data
Intelligent Data Analysis
Mathematical Linguistics in Cognitive Medical Image Interpretation Systems
Journal of Mathematical Imaging and Vision
Quality and efficiency in high dimensional nearest neighbor search
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
A new enhancement to the R-tree node splitting
Journal of Information Science
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
ACM Transactions on Database Systems (TODS)
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Picture languages in medical pattern knowledge representation and understanding
MDAI'05 Proceedings of the Second international conference on Modeling Decisions for Artificial Intelligence
Intelligent semantic information retrieval in medical pattern cognitive analysis
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
Data & Knowledge Engineering
SIMP: accurate and efficient near neighbor search in high dimensional spaces
Proceedings of the 15th International Conference on Extending Database Technology
Searching continuous nearest neighbors in road networks on the air
Information Systems
Hi-index | 0.00 |
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor search which corresponds to a computation of the Voronoi cell of each data point. In a second step, we store conservative approximations of the Voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e., it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in other index structures such as the X-tree.