Sciweavers

26 search results - page 3 / 6
» Improved Unnesting Algorithms for Join Aggregate SQL Queries
Sort
View
SIGMOD
2001
ACM
147views Database» more  SIGMOD 2001»
14 years 6 months ago
Optimizing Queries Using Materialized Views: A practical, scalable solution
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
Jonathan Goldstein, Per-Åke Larson
TKDE
2002
148views more  TKDE 2002»
13 years 5 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 18 days ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
13 years 10 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
GIS
2005
ACM
14 years 6 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang