By Topic

Using constraints for efficient query processing in nondeterministic databases

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
$31 $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)
Vadaparty, K. ; Dept. of Comput. Eng. & Sci., Case Western Reserve Univ., Cleveland, OH, USA ; Naqvi, S.

Nondeterministic databases store disjunctive data using OR-objects. For example, data such as “Part#1 is implementable using Nickel or Cobalt” is stored as Implement(Part#1, o1 ) where Dom(o1)={Nickel, Cobalt} is the domain of the OR-object o1. A possible world of a database is obtained by replacing every OR-object by a member from its domain, and it is said to be conforming if it satisfies all the FDs (functional dependencies) associated with the database. A database D is said to fully incorporate a set F of FDs if every possible world of D is conforming. This paper studies the problem of preprocessing databases to achieve full incorporation, and also the problem of incrementally maintaining a database fully incorporated under insertions and deletions. We first define a certain property called goodness of a class D of databases for a set F of FDs; goodness can be tested efficiently and enforced easily at schema design time. For any class D of databases that is good for F, we present: 1) a quadratic time algorithm for fully incorporating F; 2) efficient algorithms for maintaining full incorporation under updates; and 3) lower-bounds for the algorithms of (1) and (2). Next, we show that, for classes of databases that are not good, the problem of full incorporation is, in general, coNP-complete. We also examine the complexity when OR-objects are restricted to have no more than two members, and obtain some interesting tractable algorithms, and intractability results

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:7 ,  Issue: 6 )