Sciweavers

203 search results - page 8 / 41
» Answering Queries Using Views with Arithmetic Comparisons
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 7 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
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
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
13 years 11 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
DBISP2P
2005
Springer
105views Database» more  DBISP2P 2005»
14 years 27 days ago
Semantic Caching in Schema-Based P2P-Networks
In this paper, we present the use of semantic caching in the environment of schema-based super-peer networks. Different from traditional caching, semantic caching allows the answe...
Ingo Brunkhorst, Hadhami Dhraief
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
14 years 1 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin