Abstract
The problem of optimizing algebraic queries to relational databases which are formulated with the help of inequality selection, projection, and natural join is addressed: We generalize the well-known tableau formalism to handle this type of queries and provide a quadratic-time optimization procedure. We show how optimized tableaux can be translated back into extended SPJ-expressions, thereby dispensing with the computationally harder cartesian product.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
