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
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
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 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
An Index Structure for Efficient Reverse Nearest Neighbor Queries
Proceedings of the 17th International Conference on Data Engineering
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
Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
GADT: A Probability Space ADT for Representing and Querying the Physical World
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Indexing spatio-temporal trajectories with Chebyshev polynomials
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
Reverse Nearest Neighbors in Large Graphs
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Indexing multi-dimensional uncertain data with arbitrary probability density functions
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Working Models for Uncertain Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Mining Frequent Trajectory Patterns for Activity Monitoring Using Radio Frequency Tag Arrays
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Multidimensional reverse kNN search
The VLDB Journal — The International Journal on Very Large Data Bases
Reverse nearest neighbor aggregates over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient indexing methods for probabilistic threshold queries over uncertain data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Indexable PLA for efficient similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic ranked queries in uncertain databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Underground coal mine monitoring with wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Efficient Processing of Top-k Queries in Uncertain Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
On High Dimensional Indexing of Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Database Support for Probabilistic Attributes and Tuples
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Top-k Spatial Joins of Probabilistic Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic nearest-neighbor query on uncertain objects
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Efficient join processing on uncertain data streams
Proceedings of the 18th ACM conference on Information and knowledge management
Reverse skyline search in uncertain databases
ACM Transactions on Database Systems (TODS)
Reverse ranking query over imprecise spatial data
Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application
Finding the least influenced set in uncertain databases
Information Systems
Similarity search and mining in uncertain databases
Proceedings of the VLDB Endowment
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
Top-K probabilistic closest pairs query in uncertain spatial databases
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Efficient probabilistic reverse nearest neighbor query processing on uncertain data
Proceedings of the VLDB Endowment
A visual evaluation framework for spatial pruning methods
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Evaluating probabilistic spatial-range closest pairs queries over uncertain objects
WAIM'11 Proceedings of the 12th international conference on Web-age information management
On efficient obstructed reverse nearest neighbor query processing
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient processing of probabilistic set-containment queries on uncertain set-valued data
Information Sciences: an International Journal
MUD: Mapping-based query processing for high-dimensional uncertain data
Information Sciences: an International Journal
Evaluating trajectory queries over imprecise location data
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Efficiently processing snapshot and continuous reverse k nearest neighbors queries
The VLDB Journal — The International Journal on Very Large Data Bases
Finding top k most influential spatial facilities over uncertain objects
Proceedings of the 21st ACM international conference on Information and knowledge management
Optimal k-constraint coverage queries on spatial objects
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
UV-diagram: a voronoi diagram for uncertain spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Causality and responsibility: probabilistic queries revisited in uncertain databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient identification and approximation of k-nearest moving neighbors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Reverse nearest neighbor (RNN) search is very crucial in many real applications. In particular, given a database and a query object, an RNN query retrieves all the data objects in the database that have the query object as their nearest neighbors. Often, due to limitation of measurement devices, environmental disturbance, or characteristics of applications (for example, monitoring moving objects), data obtained from the real world are uncertain (imprecise). Therefore, previous approaches proposed for answering an RNN query over exact (precise) database cannot be directly applied to the uncertain scenario. In this paper, we re-define the RNN query in the context of uncertain databases, namely probabilistic reverse nearest neighbor (PRNN) query, which obtains data objects with probabilities of being RNNs greater than or equal to a user-specified threshold. Since the retrieval of a PRNN query requires accessing all the objects in the database, which is quite costly, we also propose an effective pruning method, called geometric pruning (GP), that significantly reduces the PRNN search space yet without introducing any false dismissals. Furthermore, we present an efficient PRNN query procedure that seamlessly integrates our pruning method. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed GP-based PRNN query processing approach, under various experimental settings.