A probabilistic relational model and algebra
ACM Transactions on Database Systems (TODS)
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 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
Imprecise and Uncertain Information in Databases: An Evidential Approach
Proceedings of the Eighth International Conference on Data Engineering
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Density-based clustering of uncertain data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
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
Trio: a system for data, uncertainty, and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
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
Query answering techniques on uncertain and probabilistic data: tutorial summary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Managing Uncertain Data: Probabilistic Approaches
WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
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
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
Probabilistic threshold join over distributed uncertain data
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Evaluating probabilistic spatial-range closest pairs queries over uncertain objects
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.03 |
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggregate (PTRA) query retrieves summarized information about the uncertain objects satisfying a range query, with respect to a given probability threshold. This paper is the first one to address this important type of query. We develop a new index structure aU-tree and propose an exact querying algorithm based on aU-tree. For the pursue of efficiency, two techniques SingleSample and DoubleSample are developed. Both techniques provide approximate answers to a PTRA query with accuracy guarantee. Experimental study demonstrates the efficiency and effectiveness of our proposed methods.