76 search results - page 7 / 16 » Answering queries using materialized views with minimum size |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
DBISP2P
2005
Springer
14 years 1 months ago
2005
Springer
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...
CASCON
2001
13 years 9 months ago
2001
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
SIGMOD
1996
ACM
13 years 12 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...