Abstract
For some applications, it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer to a database query. An approximate query processor, called APPROXIMATE, makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The processor implements monotone approximate query processing — the accuracy of the approximate result produced improves monotonically with the amount of data retrieved to produce the result. The query processing algorithm of APPROXIMATE works within a standard relational algebra framework. APPROXIMATE maintains semantic information for approximate query processing and can be implemented on a relational database system with little change to the relational architecture. We describe how the approximation semantics of APPROXIMATE serve as the basis for meaningful approximations of queries with set-valued or single-valued answers and how APPROXIMATE is implemented to make effective use of the semantic information.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
