Models of approximation in databases

• Published in: Theoretical computer science Vol. 190; no. 2; pp. 167 - 210
• Main Author: Libkin, Leonid
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 1998
• Subjects: Approximate answers; Partial information; Powerdomains; Approximate answers; Partial information; Databases; Powerdomains
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/S0304-3975(97)00090-X

Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some “world”, the combined databases will not be, and answers to queries against such combined databases can only be approximated. In this paper we describe various situations in which a precise answer cannot be obtained for a query asked against multiple databases. Based on an analysis of these situations, we propose a classification of constructs that can be used to model approximations. The main goal of the paper is to study several formal models of approximations and their semantics. In particular, we obtain universality properties for these models of approximations. Universality properties suggest syntax for languages with approximations based on the operations which are naturally associated with them. We prove universality properties for most of the approximation constructs. Then we design languages built around datatypes given by the approximation constructs. A straightforward approach results in languages that have a number of limitations. In an attempt to overcome those limitations, we explain how all the languages can be embedded into a language for conjunctive and disjunctive sets from Libkin and Wong (1996) and demonstrate its usefulness in querying independent databases. We also discuss the semantics of approximation constructs and the relationship between them.