By Topic

Optimising Query Answering in the Presence of Access Limitations (Position Paper)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Cali ; Free University of Bozen-Bolzano, Italy ; D. Calvanese

Relational data may have access limitations, i.e., relations may require certain attributes to be selected when they are accessed; this happens, for instance, while querying Web data sources (wrapped in relational form) or legacy databases. It is known that the evaluation of a conjunctive query under access limitations requires a recursive algorithm that is encoded into a Datalog program. In this paper we consider the problem of optimising query answering in this setting, where the query language is that of conjunctive queries. We review some optimisation techniques for this problem, that aim to reduce the number of accesses to the data in the query plan. Then we argue that checking query containment is necessary in this case for achieving effective query optimisation. Checking containment in the presence of access limitations would amount to check containment of recursive DATALOG programs, which is undecidable in general. We show however that, due to the specific form of the DATALOG programs resulting from encoding access limitations, the containment problem is indeed decidable. We present a decision procedure, first presented in a paper by the authors and based on chase techniques, and we analyse its computational complexity

Published in:

17th International Workshop on Database and Expert Systems Applications (DEXA'06)

Date of Conference:

0-0 0