Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Rewriting General Conjunctive Queries Using Views

Wang, J., Maher, M. and Toper, R.

    The problem of rewriting queries using views has important applications in data integration, query optimization, and physical data independence maintenance. Previous researchers have proposed rewriting algorithms for queries and views that are Datalog programs or conjunctive queries with arithmetic comparisons such as x < y and y 10. We present a method for finding rewritings of general conjunctive queries, i.e, conjunctive queries with arbitrary built-in predicates, using views. Our method also has advantages over previous algorithms when there are no built-in predicates or when the built-in predicates are conjunctions of arithmetic comparisons. In particular, our method finds strictly more rewritings than the MiniCon [PL00] and the Shared-Variable-Bucket [Mit01] algorithms and tends to be more efficient when the built-in predicates of the query involve only distinguished variables. It finds all rewritings that can be found by the Bucket [LRO96] algorithm in most practical cases, and more efficiently. It finds maximum rewritings in several special cases.
Cite as: Wang, J., Maher, M. and Toper, R. (2002). Rewriting General Conjunctive Queries Using Views. In Proc. Thirteenth Australasian Database Conference (ADC2002), Melbourne, Australia. CRPIT, 5. Zhou, X., Ed. ACS. 197-206.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007