Temporal aggregates for time-constrained queries
Conference
·
OSTI ID:457115
- Univ. of Alabama, Tuscaloosa, AL (United States)
Some database systems have temporal data as well as timing constraints for processing queries. We have proposed an approximate query processor to produce approximate answers to temporal database queries. In this paper have extend the capability of approximate query processing to include temporal approximate aggregates that provide approximate answers to temporal database queries with time constraints. We define temporal approximate aggregates for minimum, maximum, count and a limited sum aggregate. The approximate answers produced improve as query processing continues, and converge to the exact answer if there is enough time and all of the data are available. We describe how the semantic information maintained by the approximate query processor can be used to effectively implement temporal approximate aggregates. Performance results presented demonstrate the feasibility of the temporal approximate aggregates.
- OSTI ID:
- 457115
- Report Number(s):
- CONF-960678--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Relational aggregate query processing techniques for real-time databases
A framework for query optimization in temporal databases
Precision-time tradeoffs: a paradigm for processing statistical queries on databases
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5897525
A framework for query optimization in temporal databases
Conference
·
Tue Oct 31 23:00:00 EST 1989
·
OSTI ID:6822667
Precision-time tradeoffs: a paradigm for processing statistical queries on databases
Conference
·
Sun May 01 00:00:00 EDT 1988
·
OSTI ID:6929968