Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Quality-Aware Probing of Uncertain Data with Resource Constraints
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
Cleaning uncertain data with quality guarantees
Proceedings of the VLDB Endowment
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
Computing all skyline probabilities for uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for mining constrained frequent patterns from uncertain data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Mining uncertain data for constrained frequent sets
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
The VLDB Journal — The International Journal on Very Large Data Bases
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Effectively indexing uncertain moving objects for predictive queries
Proceedings of the VLDB Endowment
Threshold-based probabilistic top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Mining uncertain data for frequent itemsets that satisfy aggregate constraints
Proceedings of the 2010 ACM Symposium on Applied Computing
Threshold query optimization for uncertain data
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient algorithms for the mining of constrained frequent patterns from uncertain data
ACM SIGKDD Explorations Newsletter
Querying and cleaning uncertain data
QuaCon'09 Proceedings of the 1st international conference on Quality of context
Skyline query processing for uncertain data
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Identifying interesting instances for probabilistic skylines
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Finding the least influenced set in uncertain databases
Information Systems
Ranking continuous probabilistic datasets
Proceedings of the VLDB Endowment
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
Asymptotically efficient algorithms for skyline probabilities of uncertain data
ACM Transactions on Database Systems (TODS)
A unified approach to ranking in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Can the Utility of Anonymized Data be Used for Privacy Breaches?
ACM Transactions on Knowledge Discovery from Data (TKDD)
Efficient probabilistic reverse nearest neighbor query processing on uncertain data
Proceedings of the VLDB Endowment
Ranking continuous nearest neighbors for uncertain trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
Shooting top-k stars in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
k-selection query over uncertain data
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Spatial query processing based on uncertain location information
DNIS'10 Proceedings of the 6th international conference on Databases in Networked 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
Nearest-neighbor searching under uncertainty
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
Data & Knowledge Engineering
DuoWave: Mitigating the curse of dimensionality for uncertain data
Data & Knowledge Engineering
Efficient fuzzy ranking queries in uncertain databases
Applied Intelligence
A filter-based protocol for continuous queries over imprecise location data
Proceedings of the 21st ACM international conference on Information and knowledge management
Nearest neighbor searching under uncertainty II
Proceedings of the 32nd symposium on Principles of database systems
UV-diagram: a voronoi diagram for uncertain spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query for uncertain objects is the Probabilistic Nearest-Neighbor Query (PNN), which computes the probability of each object for being the nearest neighbor of a query point. Evaluating this query is computationally expensive, since it needs to consider the relationship among uncertain objects, and requires the use of numerical integration or Monte-Carlo methods. Sometimes, a query user may not be concerned about the exact probability values. For example, he may only need answers that have sufficiently high confidence. We thus propose the Constrained Nearest-Neighbor Query (C-PNN), which returns the IDs of objects whose probabilities are higher than some threshold, with a given error bound in the answers. The C-PNN can be answered efficiently with probabilistic verifiers. These are methods that derive the lower and upper bounds of answer probabilities, so that an object can be quickly decided on whether it should be included in the answer. We have developed three probabilistic verifiers, which can be used on uncertain data with arbitrary probability density functions. Extensive experiments were performed to examine the effectiveness of these approaches.