Issue No. 06 - December (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.250091
<p>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.</p>
APPROXIMATE; query processor; monotonically improving approximate answers; approximate query processing; monotone query processing algorithm; standard relational algebra framework; semantic information; relational database system; class hierarchy; imprecise computation; partial-order relation; query tree; query processing; relational algebra; relational databases; trees (mathematics)
J. Liu and S. Vrbsky, "APPROXIMATE: A Query Processor that Produces Monotonically Improving Approximate Answers," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 1056-1068, 1993.