Abstract | ||
---|---|---|
To address the classical selectivity estimation problem for OLAP queries in relational databases, a radically different approach called PlanBouquet was recently proposed in [1] , wherein the estimation process is completely abandoned and replaced with a calibrated discovery mechanism. The beneficial outcome of this new construction is that provable guarantees on worst-case performance, measured a... |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/TKDE.2017.2664827 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | DocType | Volume |
Query processing,Robustness,Estimation,Engines,Three-dimensional displays,Benchmark testing | Journal | 31 |
Issue | ISSN | Citations |
1 | 1041-4347 | 1 |
PageRank | References | Authors |
0.36 | 6 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Srinivas Karthik | 1 | 2 | 0.84 |
Jayant R. Haritsa | 2 | 2004 | 228.38 |
Sreyash Kenkre | 3 | 13 | 4.30 |
Vinayaka Pandit | 4 | 818 | 66.81 |