Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scalable Query Rewriting: A Graph-Based Approach George Konstantinidis
 

Summary: Scalable Query Rewriting: A Graph-Based Approach
George Konstantinidis
Information Sciences Institute
University of Southern California
Marina Del Rey, CA 90292
konstant@usc.edu
Josť Luis Ambite
Information Sciences Institute
University of Southern California
Marina Del Rey, CA 90292
ambite@isi.edu
ABSTRACT
In this paper we consider the problem of answering queries using
views, which is important for data integration, query optimization,
and data warehouses. We consider its simplest form, conjunctive
queries and views, which already is NP-complete. Our context is
data integration, so we search for maximally-contained rewritings.
By looking at the problem from a graph perspective we are able
to gain a better insight and develop an algorithm which compactly
represents common patterns in the source descriptions, and (option-

  

Source: Ambite, Josť Luis - Information Sciences Institute & Department of Computer Science, University of Southern California

 

Collections: Computer Technologies and Information Sciences