|
On the correct and complete enumeration of the core search space
Moerkotte, Guido
;
Fender, Pit
;
Eich, Marius
|
DOI:
|
https://doi.org/10.1145/2463676.2465314
|
|
URL:
|
http://dblp.uni-trier.de/rec/html/conf/sigmod/Moer...
|
|
Document Type:
|
Conference or workshop publication
|
|
Year of publication:
|
2013
|
|
Book title:
|
SIGMOD/PODS'13 : compilation proceedings of the 2013 ACM Symposium on Principles of Database Systems, ACM SIGMOD International Conference on Management of Data, and SIGMOD/PODS 2013 PhD Symposium; June 22 - 27, 2013, New York, New York, USA
|
|
Page range:
|
493-504
|
|
Date of the conference:
|
22.-27.06.2013
|
|
Publisher:
|
Ross, Kenneth A.
|
|
Place of publication:
|
[New York, NY]
|
|
Publishing house:
|
ACM Press
|
|
ISBN:
|
978-1-4503-2037-5
|
|
Publication language:
|
English
|
|
Institution:
|
School of Business Informatics and Mathematics > Practical Computer Science III (Moerkotte 1996-)
|
|
Subject:
|
004 Computer science, internet
|
|
Abstract:
|
Reordering more than traditional joins (e.g. outerjoins, antijoins) requires some care, since not all reorderings are valid. To prevent invalid plans, two approaches have been described in the literature. We show that both approaches still produce invalid plans.
We present three conflict detectors. All of them are (1) correct, i.e., prevent invalid plans, (2) easier to understand and implement than the previous (buggy) approaches, (3) more flexible in the sense that the restriction that all predicates must reject nulls is no longer required, and (4) extensible in the sense that it is easy to add new operators. Further, the last of our three approaches is complete, i.e., it allows for the generation of all valid plans within the core search space.
|
|
Additional information:
|
Online-Ressource
|
 | Dieser Eintrag ist Teil der Universitätsbibliographie. |
 Search Authors in
You have found an error? Please let us know about your desired correction here: E-Mail
Actions (login required)
 |
Show item |
|
|
