Sciweavers

251 search results - page 29 / 51
» Optimizing recursive queries in SQL
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
CIKM
2008
Springer
13 years 9 months ago
Pruning nested XQuery queries
We present in this paper an approach for XQuery optimization that exploits minimization opportunities raised in composition-style nesting of queries. More precisely, we consider t...
Bilel Gueni, Talel Abdessalem, Bogdan Cautis, Emma...
SIGMOD
2006
ACM
124views Database» more  SIGMOD 2006»
14 years 7 months ago
Redundancy and information leakage in fine-grained access control
The current SQL standard for access control is coarse grained, in that it grants access to all rows of a table or none. Fine-grained access control, which allows control of access...
Govind Kabra, Ravishankar Ramamurthy, S. Sudarshan
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi