Name
Abstract | ||
|---|---|---|
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (probabilistic) data as a native data type. New automatic query optimizations having the ability to estimate the cost of execution of a given query plan, as available in existing databases, need to be developed. For probabilistic data this involves providing selectivity estimations that can handle multiple values for each attribute and also new query types with threshold values. This paper presents novel selectivity estimation functions for uncertain data and shows how these functions can be integrated into PostgreSQL to achieve query optimization for probabilistic queries over uncertain data. The proposed methods are able to handle both attribute- and tuple-uncertainty. Our experimental results show that our algorithms are efficient and give good selectivity estimates with low space-time overhead. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-69497-7_7 | SSDBM |
Keywords | Field | DocType |
uncertain data,query optimization,native data type,good selectivity estimate,query selectivity estimation,probabilistic data,query plan,new query type,novel selectivity estimation function,new automatic query,probabilistic query,data type,relational database,space time,database management | Query optimization,Data mining,Query expansion,Computer science,Sargable,View,Uncertain data,Query by Example,Database,Probabilistic database,Query plan | Conference |
Volume | ISSN | Citations |
5069 | 0302-9743 | 6 |
PageRank | References | Authors |
0.68 | 24 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sarvjeet Singh | 1 | 338 | 12.79 |
| Chris Mayfield | 2 | 335 | 18.86 |
| Rahul Shah | 3 | 1059 | 61.31 |
| Sunil Prabhakar | 4 | 2664 | 152.75 |
| Susanne E. Hambrusch | 5 | 1210 | 102.99 |