(Enter summary)
Abstract: In this paper, we study the progressive evaluation
of nested queries with aggregates (i.e.,
the inner query block is an aggregate query),
where users are provided progressively with
(approximate) answers as the inner query
block is being evaluated. We propose an incremental
evaluation strategy to present answers
that are certainly in the final answer
space first, before presenting those whose validity
may be affected as the inner query aggregates
are refined. We also propose a... (Update)
Context of citations to this paper: More
.... results proposed by Hellerstein et al. and Tan et al. present solutions for specific non monotonic aggregate operators, such as average [3,7], and thus do not extend to non monotonic operators such as nest and negation that are becoming increasingly important for network query...
...and that early feedback during query execution can help speed up the process. Recently, a variety of work on online processing (e.g. [13, 24, 1]) has attempted to address this problem by providing incremental, refining results during time consuming tasks. An additional focus...
Cited by: More
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks - Madden, Franklin.. (2002)
(Correct)
TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks - Madden, Franklin.. (2002)
(Correct)
Partial Results for Online Query Processing - Vijayshankar Raman Ibm (2002)
(Correct)
Active bibliography (related documents): More All
0.3: Online Aggregation - Hellerstein, Haas, Wang (1997)
(Correct)
0.3: Bulletin of the Technical Committee on Data Engineering.. - Society, IEEE (1997)
(Correct)
0.2: Join Algorithms for Online Aggregation - Haas, al. (1998)
(Correct)
Similar documents based on text: More All
0.2: Indexing the Edges - A simple and yet efficient approach.. - Ooi, Tan, Yu, Bressan (2000)
(Correct)
0.2: Executing Nested Queries - Goetz Graefe Microsoft (2003)
(Correct)
0.2: Nested Queries and Quantifiers in an Ordered Context - May, Helmer, Moerkotte (2003)
(Correct)
Related documents from co-citation: More All
7: Online Aggregation
- Hellerstein, Haas et al. - 1997
5: Data cube: A relational aggregation operator generalizing group-by
- Gray, Bosworth et al. - 1996
5: Differential evaluation of continual queries
- Liu, Pu et al. - 1996
BibTeX entry: (Update)
K. Tan, C. H. Goh, B. C. Ooi, "Online Feedback for Nested Aggregate Queries with Multi-Threading", Proceedings of the 1999 VLDB Conference, Edinburgh, Scotland, September 1999. http://citeseer.ist.psu.edu/tan99online.html More
@inproceedings{ tan99online,
author = "Kian-Lee Tan and Cheng Hian Goh and Beng Chin Ooi",
title = "Online Feedback for Nested Aggregate Queries with Multi-Threading",
booktitle = "The {VLDB} Journal",
pages = "18-29",
year = "1999",
url = "citeseer.ist.psu.edu/tan99online.html" }
Citations (may not include all citations):
194
Online aggregation
- Hellerstein, Haas et al. - 1997
90
Dataflow query execution in parallel main-memory environment
- Wilschut, Apers - 1991
74
On optimizing an sql-like nested query (context) - Kim - 1982
57
Ripple joins for online aggregation (context) - Haas, Hellerstein - 1999
47
Optimization of nested sql queries revisited (context) - Ganski, Wong - 1987
38
Random Sampling from Databases
- Olken - 1993
28
Processing aggregate relational queries with hard time const.. (context) - Hou, Ozsoyoglua et al. - 1989
27
Statistical estimators for relational algebra expressions (context) - Hou, Ozsoyoglua et al. - 1988
19
Processing queries for the first few answers
- Bayardo, Miranker - 1996
18
Large-sample and deterministic confidence intervals for onli..
- Haas - 1997
17
Efficient sampling strategies for relational database operat.. (context) - Lipton, Naughton et al. - 1993
12
Selectivity and cost estimation for joins based on random sa.. (context) - Haas, Naughton et al. - 1996
8
Optimization of nested queries in a distributed relational d.. (context) - Lohman, Daniels et al. - 1984
6
On getting some answers quickly (context) - Tan, Goh et al. - 1999
1
Of nests and trees: A unified approach of processing queries.. (context) - Dayal - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.comp.nus.edu.sg/~ooibc/papers.html): More
chi-tree : A New Class Hierarchy Access Method for Object-Oriented.. - Ooi
(Correct)
Efficient Scheduling of Page Access in Join Processing - Chan, Ooi
(Correct)
Indexing in Spatial Databases - Ooi, Sacks-Davis, Han
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC