APPROXIMATE-a query processor that produces monotonically improving approximate answers

Author

Vrbsky, Susan V. ; Liu, Jane W S

Author_Institution

Dept. of Comput. Sci., Alabama Univ., Tuscaloosa, AL, USA

Volume

5

Issue

6

fYear

1993

fDate

12/1/1993 12:00:00 AM

Firstpage

1056

Lastpage

1068

Abstract

APPROXIMATE, a query processor that makes approximate answers available if part of the database is unavailable, or if there is not enough time to produce an exact answer, is described. The processor implements approximate query processing, and the accuracy of the approximate result produced improves monotonically with the amount of data retrieved to produce the result. The monotone query processing algorithm of APPROXIMATE works within a standard relational algebra framework. APPROXIMATE maintains semantic information for approximate query processing at an underlying level, and can be implemented on a relational database system with little change to the relational architecture. It is shown how APPROXIMATE is implemented to make effective use of the semantic support. The additional overhead required by APPROXIMATE is described

Keywords

query processing; relational algebra; relational databases; trees (mathematics); APPROXIMATE; approximate query processing; class hierarchy; imprecise computation; monotone query processing algorithm; monotonically improving approximate answers; partial-order relation; query processor; query tree; relational database system; semantic information; standard relational algebra framework; Algebra; Computer architecture; Computer science; Database systems; Fault tolerant systems; Information retrieval; Query processing; Relational databases; Sorting; Statistical analysis;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.250091

Filename

250091