A framework for expressing and controlling impressions in databases
Technical Report
·
OSTI ID:7153537
There are many database applications in which substantial reduction in the costs of data management and query processing may be achieved if some imprecision in the stored data is allowed. In such applications, a precision requirement may be assigned to a query which implies that the error in the answer should not exceed some predetermined bound. The degree of imprecision in the database must be controlled such that a query always operates on data which is sufficiently accurate such that the computed answer meets or exceeds the precision requirements of the query. In this paper, the concept of precision in databases for both queries and data is introduced and formalized. Algorithms for maintaining a database at a specified degree of precision are presented and analyzed. We then describe how these algorithms may be employed for the purpose of choosing an optimal query plan by a query optimizer. 23 refs., 5 figs., 5 tabs.
- Research Organization:
- Lawrence Berkeley Lab., CA (USA)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 7153537
- Report Number(s):
- LBL-24894; ON: DE88014036
- Country of Publication:
- United States
- Language:
- English
Similar Records
Precision-time tradeoffs: a paradigm for processing statistical queries on databases
Declustering databases on heterogeneous disk systems
A probabilistic NF2 relational algebra for integrated information retrieval and database systems
Conference
·
Sun May 01 00:00:00 EDT 1988
·
OSTI ID:6929968
Declustering databases on heterogeneous disk systems
Conference
·
Fri Mar 31 23:00:00 EST 1995
·
OSTI ID:129221
A probabilistic NF2 relational algebra for integrated information retrieval and database systems
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:501651