Sciweavers

18 search results - page 1 / 4
» Query rewriting using views in the presence of inclusion dep...
Sort
View
WIDM
2003
ACM
13 years 9 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
ICDE
1998
IEEE
99views Database» more  ICDE 1998»
13 years 8 months ago
Query Folding with Inclusion Dependencies
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
Jarek Gryz
EDBT
2006
ACM
103views Database» more  EDBT 2006»
14 years 4 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
ICDT
2005
ACM
130views Database» more  ICDT 2005»
13 years 10 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash
CASCON
2004
108views Education» more  CASCON 2004»
13 years 6 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi