ACM Home Page
Please provide us with feedback. Feedback
A chase too far?
Full text PdfPdf (1.15 MB)
Source International Conference on Management of Data archive
Proceedings of the 2000 ACM SIGMOD international conference on Management of data table of contents
Dallas, Texas, United States
Pages: 273 - 284  
Year of Publication: 2000
ISBN:1-58113-217-4
Also published in ...
Authors
Lucian Popa  University of Pennsylvania
Alin Deutsch  University of Pennsylvania
Arnaud Sahuguet  University of Pennsylvania
Val Tannen  University of Pennsylvania
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 42,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/342009.335421
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
3
4
 
5
 
6
 
7
8
 
9
 
10
 
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
14
15
 
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
 
20
21
 
22

CITED BY  10
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Lucian Popa: colleagues
Alin Deutsch: colleagues
Arnaud Sahuguet: colleagues
Val Tannen: colleagues

Peer to Peer - Readers of this Article have also read: