Opening book details…
Can I read Generating Efficient Safe Query Plans for Probabilistic Databases on EtoBox?
Generating Efficient Safe Query Plans for Probabilistic Databases by Biao Qin; Yuni Xia is a Computer Science article available to read on EtoBox.
What is Generating Efficient Safe Query Plans for Probabilistic Databases about?
Managing uncertain information using probabilistic databases has drawn much attention recently in many fields. Generating efficient safe plans is the key to evaluating queries whose data complexities are PTIME. In this paper, we propose a new approach generating efficient safe plans for queries. Our algorithm adopts effective preprocessing and multiway split techniques, thus the generating safe plans avoid unnecessary probabilistic cartesianproducts and have the minimum number of probabilistic projections. Further, we extend existing transformation rules to allow the safe plans generated by the Safe-Plan algorithm [N. Dalvi, D. Suciu, Efficient query evaluation on probabilistic database, The VLDB Journal 16 (4) (2007) 523-544] and the proposed algorithm to be transformed by each other. Applying our approach through the TPC-H benchmark queries, the experiments show that the safe plans generated by our algorithm are more efficient than those generated by the Safe-Plan algorithm.
Who reads Generating Efficient Safe Query Plans for Probabilistic Databases?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Biao Qin; Yuni Xia
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0169-023X)
- Published
- 2008
- Language
- EN
- Field
- Computer Science (Physical Sciences)