Management of uncertainty in database systems
Modern database systems
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Face recognition: A literature survey
ACM Computing Surveys (CSUR)
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Approximated clustering of distributed high-dimensional data
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
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
ProUD: Probabilistic Ranking in Uncertain Databases
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
Top-k dominating queries in uncertain databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Probabilistic Inverse Ranking Queries over Uncertain Data
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic Similarity Search for Uncertain Time Series
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
The VLDB Journal — The International Journal on Very Large Data Bases
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)
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
Querying and cleaning uncertain data
QuaCon'09 Proceedings of the 1st international conference on Quality of context
Selective data acquisition for probabilistic K-NN query
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Finding the least influenced set in uncertain databases
Information Systems
Ranking continuous probabilistic datasets
Proceedings of the VLDB Endowment
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
A unified approach to ranking in probabilistic 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
The elements of probabilistic time geography
Geoinformatica
Probabilistic time consistent queries over moving objects
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Evaluating probabilistic spatial-range closest pairs queries over uncertain objects
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Shooting top-k stars in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently answering probability threshold-based shortest path queries over uncertain graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
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
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
Probabilistic range monitoring of streaming uncertain positions in geosocial networks
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A filter-based protocol for continuous queries over imprecise location data
Proceedings of the 21st ACM international conference on Information and knowledge management
A probabilistic approach to correlation queries in uncertain time series data
Proceedings of the 21st ACM international conference on Information and knowledge management
Probabilistic top-k dominating queries in uncertain databases
Information Sciences: an International Journal
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
Causality and responsibility: probabilistic queries revisited in uncertain databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Entity resolution for distributed probabilistic data
Distributed and Parallel Databases
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
Hi-index | 0.00 |
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or face recognition systems, distances between objects have to be computed based on vague and uncertain data. A successful approach is to express the distance between two uncertain objects by probability density functions which assign a probability value to each possible distance value. By integrating the complete probabilistic distance function as a whole directly into the query algorithm, the full information provided by these functions is exploited. The result of such a probabilistic query algorithm consists of tuples containing the result object and a probability value indicating the likelihood that the object satisfies t he query predicate. In this paper we introduce an efficient strategy for cessing probabilistic nearest-neighbor queries, as the computation of these probability values is very expensive. In a detailed experimental evaluation, we demonstrate the benefits of our probabilistic query approach. The experiments show that we can achieve high quality query results with rather low computational cost.