Abstract
We consider the problem of answering numerical queries, i.e. queries involving cardinalities of sets of objects with specified conditions, in a data base where information is incomplete. We give an algorithm to compute a lower bound and an upper bound on the response to a numerical query. The bounds proceduced by the algorithm are the best logically derivable from the information available in the data base.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.