Sciweavers

109 search results - page 4 / 22
» New Rewritings and Optimizations for Regular Path Queries
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 6 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
BDA
2004
13 years 7 months ago
A new way of optimizing OLAP queries
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
Arnaud Giacometti, Dominique Laurent, Patrick Marc...
AIPS
1998
13 years 7 months ago
Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments
We present the application of the Planning by Rewriting PbR framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for e cient high-quali...
José Luis Ambite, Craig A. Knoblock
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
13 years 4 months ago
Query Rewrites with Views for XML in DB2
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
Parke Godfrey, Jarek Gryz, Andrzej Hoppe, Wenbin M...
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 6 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...