Sciweavers

10 search results - page 1 / 2
» Answering Complex SQL Queries Using Automatic Summary Tables
Sort
View
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
13 years 9 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...
VLDB
1995
ACM
155views Database» more  VLDB 1995»
13 years 8 months ago
Aggregate-Query Processing in Data Warehousing Environments
In this paper we introduce generalized projections (GPs), an extension of duplicateeliminating projections, that capture aggregations, groupbys, duplicate-eliminating projections ...
Ashish Gupta, Venky Harinarayan, Dallan Quass
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 5 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 6 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
13 years 9 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass