Approximate Answers in Databases of Labeled Objects
Tadeusz Pankowski · Intelligent Information Systems · 2000
We discuss some problems concerning approximate answering to queries in databases of labeled objects representing semistructured data. An approximate answer is an answer corresponding to a relaxed version of the query. The relaxation is obtained by means of replacement of equality relations by a partial ordering or pre-ordering relations (in “child semantics” and “neighbor semantics”), or by using generalized query instead of the original one. Some novel theorems relevant to the problem are formulated.