The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Texture Features for Browsing and Retrieval of Image Data
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scalable access within the context of digital libraries
IEEE ADL '97 Proceedings of the IEEE international forum on Research and technology advances in digital libraries
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
Multidimensional access methods
ACM Computing Surveys (CSUR)
The Asilomar report on database research
ACM SIGMOD Record
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Clustering declustered data for efficient retrieval
Proceedings of the eighth international conference on Information and knowledge management
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Approximate Nearest Neighbor Searching in Multimedia Databases
Proceedings of the 17th International Conference on Data Engineering
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th 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
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Concentric Hyperspaces and Disk Allocation for Fast Parallel Range Searching
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Vulnerabilities in similarity search based systems
Proceedings of the eleventh international conference on Information and knowledge management
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximate Temporal Aggregation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On computing top-t most influential spatial sites
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Two ellipse-based pruning methods for group nearest neighbor queries
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Reverse Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Exploiting a page-level upper bound for multi-type nearest neighbor queries
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Constrained subspace skyline computation
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
IEEE Transactions on Knowledge and Data Engineering
Continuous Nearest Neighbor Queries over Sliding Windows
IEEE Transactions on Knowledge and Data Engineering
Multidimensional reverse kNN search
The VLDB Journal — The International Journal on Very Large Data Bases
OCRS: an interactive object-based image clustering and retrieval system
Multimedia Tools and Applications
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Multi-point queries in large spatial databases
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Continuous visible nearest neighbor queries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Query assurance verification for outsourced multi-dimensional databases
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
On efficient mutual nearest neighbor query processing in spatial databases
Data & Knowledge Engineering
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Quantization techniques for similarity search in high-dimensional data spaces
BNCOD'03 Proceedings of the 20th British national conference on Databases
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
visible nearest neighbor queries
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Automated data discovery in similarity score queries
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Constrained k-nearest neighbor query processing over moving object trajectories
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
A unified algorithm for continuous monitoring of spatial queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient algorithms to monitor continuous constrained k nearest neighbor queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
The islands approach to nearest neighbor querying in spatial networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Approximate search algorithm for aggregate k-nearest neighbour queries on remote spatial databases
International Journal of Knowledge and Web Intelligence
Saturn: a fast keyword kNN search system in road networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Density-based spatial keyword querying
Future Generation Computer Systems
Context-aware modelling of continuous location-dependent queries in indoor environments
Journal of Ambient Intelligence and Smart Environments - Context Awareness
Mobile Information Systems
| Hi-index | 0.00 |
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as nearest neighbor queries with range constraints. Although both nearest neighbor and range queries have been analyzed extensively in previous literature, the implications of constrained nearest neighbor queries have not been discussed. Due to their versatility, CNN queries are suitable to a wide range of applications from GIS systems to reverse nearest neighbor queries and multimedia applications. We develop methods for answering CNN queries with different properties and advantages. We prove the optimality (with respect to I/O cost) of one of the techniques proposed in this paper. The superiority of the proposed technique is shown by a performance analysis.