Sciweavers

620 search results - page 6 / 124
» Algorithms for Rewriting Aggregate Queries Using Views
Sort
View
98
Voted
ICEIS
2003
IEEE
15 years 5 months ago
QUEROM: An Object-Oriented Model to Rewriting Query Using Views
: We propose in this article an object-oriented approach to rewriting queries using views. Our approach aims to mitigate certain limitations of existing query rewriting approaches....
Abdelhak Seriai
VLDB
2001
ACM
157views Database» more  VLDB 2001»
15 years 12 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
PODS
2005
ACM
104views Database» more  PODS 2005»
15 years 11 months ago
Views and queries: determinacy and rewriting
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Luc Segoufin, Victor Vianu
DOLAP
2000
ACM
15 years 4 months ago
Comparing Nested GPSJ Queries in Multidimensional Databases
A multidimensional database can be seen as a collection of multidimensional cubes, from which information is usually extracted by aggregation; aggregated data can be calculated ei...
Matteo Golfarelli, Stefano Rizzi
PODS
2003
ACM
142views Database» more  PODS 2003»
15 years 11 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