Sciweavers

654 search results - page 28 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
VLDB
2001
ACM
114views Database» more  VLDB 2001»
14 years 27 days ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
VLDB
2000
ACM
155views Database» more  VLDB 2000»
14 years 21 hour ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
DOLAP
2000
ACM
14 years 25 days 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
DKE
2002
107views more  DKE 2002»
13 years 8 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 2 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv