Article

Free access

A chase too far?

Authors:

Arnaud Sahuguet,

Val TannenAuthors Info & Claims

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

Pages 273 - 284

https://doi.org/10.1145/342009.335421

Published: 16 May 2000 Publication History

Abstract

In a previous paper we proposed a novel method for generating alternative query plans that uses chasing (and back-chasing) with logical constraints. The method brings together use of indexes, use of materialized views, semantic optimization and join elimination (minimization). Each of these techniques is known separately to be beneficial to query optimization. The novelty of our approach is in allowing these techniques to interact systematically, eg. non-trivial use of indexes and materialized views may be enabled only by semantic constraints.

We have implemented our method for a variety of schemas and queries. We examine how far we can push the method in term of complexity of both schemas and queries. We propose a technique for reducing the size of the search space by “stratifying” the sets of constraints used in the (back)chase. The experimental results demonstrate that our method is practical (i.e., feasible and worthwhile).

References

[1]

Bonnie Baker. Responsible SQL: Creative Solutions for Performance Problems in DB2 for OS/390. DB2 Magazine, 4(2):5&55, Summer 1999. Available at htZp: //ww#. db2mag, corn/summer99199sp_prog, shtml.]]

[2]

Catriel Beeri and Yora# Kornatzky. Algebraic optimisation of object oriented query languages. Theoretical Computer Science, 116(1):59-94, August 1993.]]

Digital Library

[3]

1#. Bello and at. Materialized Views in Oracle. In Proc. of 24th VLDB Conference, pages 659-664, 1998.]]

Digital Library

[4]

U. Chakravarthy, J. Grant, and J. Minker. Logic-based approach to semantic query optimization. A CM Trans. actions on Database Systems, 15(2):162-207# 1990.]]

Digital Library

[5]

S. Chaudhuri, P#. Krishnamurty, S. Potamianos, and K. Shim. Optimizing queries with materialized views. In P#vceed#ngs of 1CDE, Taipei, Taiwan, March 1995.]]

Digital Library

[6]

Qi Cheng, Jarek Gryz, Fred Koo, T. Y. Cliff Leu#g, Linqi Liu, Xiaoyan Qian, and Berni Schiefer. Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database. In P,vc. of VLDB# pages 687-698, September 1999.]]

Digital Library

[7]

M. Cherniack and S. B. Zdonik. Inferring Function Semantics to Optimize Queries. In Proc. of 24th VLDB Conference, pages 239-250, 1998.]]

Digital Library

[8]

Sophie Cluet and Claude Delobel. A general framework for #he optimization of object oriented queries. In M. Stonebraker, editor, Proceedings A CM-SIGMOD International Conference on Management of Data, pages 383-392, San Diego, California, June 1992.]]

Digital Library

[9]

Alia Deutsch, Lucian Popa, and Val Tannen. Physical Data s Independence, Constraints and Optimization with Universal Plans. In VLDB, September 1999.]]

Digital Library

[10]

L. Fegaras and D. Maier. An algebraic framework for physical oodb design. In Proc. of the 5#h Int't Workshop on DataSase Programming Languages (DBPL95), Umbria, Italy, August 1995.]]

Digital Library

[11]

D. Florescu. Design and implementation of the Flora Object Oriented Query Optimizer. PhD thesis, Universite of Paris 6, 1996.]]

[12]

D. Florescu, L. Rashid, and P. Valduriez. A methodology for query reformulation in cis using semantic knowledge. International Journal of Cooperative Information Systems, 5(4), 1996.]]

[13]

J. Grant, J. Gryz, J. Minker, and L. Raschid. Semantic query optimization for object d#t#bases. In Proc. of ICDE, April 1997.]]

Digital Library

[14]

M. Jarke, J. Clifford, and Y. Vassiliou. An optimizing prolog front:end to a relational query system. In Proceedings of A CM-SIGMOD, pages 316-325, 1984.]]

Digital Library

[15]

A. Kemper and G. Moerkotte. Access support relations m object bases. In Proceedin9s of A CM:SIGMOD International Conference on Management of Data, pages 364-374, 199(I.]]

Digital Library

[16]

A. Levy. Answering Queries Using Views: A Survey. Forthcoming.]]

[17]

Greg Nelson and Derek C. Oppen. Fast decision algorithms ba#ed on union and find. In FOCS, pages 114-119.]]

[18]

Lucian Popa and Val Tannen. Chase and axioms for PC queries and dependencies. Technical Report MS- CIS-98-34. University of Pennsylvania, 1998. Available online at h#p://www.cis.upenn.edu/- techreports/.]]

[19]

Lucian Popa and Val Tannen. An equational ch#se for path-conjunctive queries, constraints, and views. In Proceedings of ICDT, Jerusalem, Israel, January 1999.]]

Digital Library

[20]

O. Tsatalos, M. Solomon, and Y. ioannidis. The GMAP: A Versatile Tool for Physical Data# Independence. VLDB Journal, 5(2):101-118, 1996.]]

Digital Library

[21]

P. Valduriez. Join indices. A CM Trans. Database Systems, 12(2):218-452, June 1987.]]

Digital Library

[22]

H.Z. Yang and P.A. Larson. Query transformatmn for psi queries, in Proceedings of the 13th International VLDB Conference, pages 245-254, 1987.]]

Digital Library

Cited By

Graur DRöthlisberger RJenny AFourny GDrozdowski FKonigsmark CMüller IAlonso G(2024)Addressing the Nested Data Processing Gap: JSONiq Queries on Snowflake Through Snowpark2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00395(5252-5265)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00395
Wang YAbo Khamis MNgo HPichler RSuciu DIves ZBonifati AEl Abbadi A(2022)Optimizing Recursive Queries with Progam SynthesisProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517827(79-93)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517827
Wang YDong JShah RDillig IMcKinley KFisher K(2019)Synthesizing database programs for schema refactoringProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314588(286-300)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314588
Show More Cited By

Index Terms

A chase too far?
1. Information systems
  1. Data management systems
    1. Query languages

Recommendations

The chase revisited
PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in the negative) the open problem of decidability of termination of the standard chase, and we provide sufficient termination ...
A chase too far?

In a previous paper we proposed a novel method for generating alternative query plans that uses chasing (and back-chasing) with logical constraints. The method brings together use of indexes, use of materialized views, semantic optimization and join ...
Optimizing the chase: scalable data integration under constraints

We are interested in scalable data integration and data exchange under constraints/dependencies. In data exchange the problem is how to materialize a target database instance, satisfying the source-to-target and target dependencies, that provides the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

May 2000

604 pages

ISBN:1581132174

DOI:10.1145/342009

Chairmen:
Maggie Dunham
Southern Methodist Univ.
,
Jeffrey F. Naughton
Univ. of Wisconsin-Madison
,
Weidong Chen
Southern Methodist Univ.
,
Nick Koudas
AT &T Labs

ACM SIGMOD Record Volume 29, Issue 2
June 2000
609 pages
ISSN:0163-5808
DOI:10.1145/335191
Editors:
Weidong Chen
Southern Methodist Univ., Dallas, TX
,
Jeffrey Naughton
Univ. of Wisconsin-Madison, Madison
,
Philip A. Bernstein
Microsoft
Issue’s Table of Contents

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS00

Sponsor:

SIGMOD

SIGMOD/PODS00: ACM International Conference on Management of Data and Symposium on Principles of Database Systems

May 15 - 18, 2000

Texas, Dallas, USA

Acceptance Rates

SIGMOD '00 Paper Acceptance Rate 42 of 248 submissions, 17%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
225
Total Downloads

Downloads (Last 12 months)111
Downloads (Last 6 weeks)13

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Graur DRöthlisberger RJenny AFourny GDrozdowski FKonigsmark CMüller IAlonso G(2024)Addressing the Nested Data Processing Gap: JSONiq Queries on Snowflake Through Snowpark2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00395(5252-5265)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00395
Wang YAbo Khamis MNgo HPichler RSuciu DIves ZBonifati AEl Abbadi A(2022)Optimizing Recursive Queries with Progam SynthesisProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517827(79-93)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517827
Wang YDong JShah RDillig IMcKinley KFisher K(2019)Synthesizing database programs for schema refactoringProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314588(286-300)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314588
Alotaibi RBursztyn DDeutsch AManolescu IZampetakis SBoncz PManegold SAilamaki ADeshpande AKraska T(2019)Towards Scalable Hybrid StoresProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3319895(1660-1677)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3299869.3319895
Chu SMurphy BRoesch JCheung ASuciu D(2018)Axiomatic foundations and algorithms for deciding semantic equivalences of SQL queriesProceedings of the VLDB Endowment10.14778/3236187.323620011:11(1482-1495)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.14778/3236187.3236200
Afrati FChirkova R(2017)Answering Queries Using ViewsSynthesis Lectures on Data Management10.2200/S00805ED1V01Y201709DTM0469:2(1-235)Online publication date: Dec-2017
https://doi.org/10.2200/S00805ED1V01Y201709DTM046
Ileana ICautis BDeutsch AKatsis YDyreson CLi FÖzsu M(2014)Complete yet practical search for minimal query reformulations under constraintsProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2593683(1015-1026)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2593683
Meier MSchmidt MWei FLausen G(2013)Semantic query optimization in the presence of typesJournal of Computer and System Sciences10.1016/j.jcss.2013.01.01079:6(937-957)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.jcss.2013.01.010
Bidoit-Tollu N(2011)Types and Constraints: From Relational to XML DataSemantics in Data and Knowledge Bases10.1007/978-3-642-23441-5_3(40-53)Online publication date: 2011
https://doi.org/10.1007/978-3-642-23441-5_3
Meier MSchmidt MWei FLausen GParedaens JVan Gucht D(2010)Semantic query optimization in the presence of typesProceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1807085.1807102(111-122)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1145/1807085.1807102
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents