Sciweavers

103 search results - page 3 / 21
» Views and queries: determinacy and rewriting
Sort
View
WAIM
2009
Springer
13 years 12 months ago
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
Junhu Wang, Kewen Wang, Jiuyong Li
PODS
2003
ACM
142views Database» more  PODS 2003»
14 years 5 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 6 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 5 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
13 years 9 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik