Reasoning about Duplicate Elimination with Description Logic (2000)
| Venue: | In Rules and Objects in Databases (DOOD, part of CL’00 |
| Citations: | 21 - 14 self |
BibTeX
@INPROCEEDINGS{Khizder00reasoningabout,
author = {Vitaliy L. Khizder and David Toman and Grant Weddell},
title = {Reasoning about Duplicate Elimination with Description Logic},
booktitle = {In Rules and Objects in Databases (DOOD, part of CL’00},
year = {2000},
pages = {1017--1032}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Queries commonly perform much better if they manage to avoid duplicate elimination operations in their execution plans. In this paper, we report on a technique that provides a necessary and sucient condition for removing such operators from object relational conjunctive queries under the standard duplicate semantics. The condition is fully captured as a membership problem in a dialect of description logic called CFD, which is capable of expressing a number of common constraints implicit in object relational database schemas. We also present a PTIME algorithm for arbitrary membership problems in CFD. 1 Introduction The paper presents a combination of two techniques to provide a very powerful tool for reasoning about duplicate semantics of conjunctive object relational queries, in particular about elimination operations and situations in which these operations can be completely removed. The query language studied in the paper contains many other practical query languages, in ...
