By Topic

Querying Incomplete Information Using Bag Relational Algebra

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

1 Author(s)
Lubomir Stanchev ; Comput. Sci. Dept., Indiana Univ.- Purdue Univ. Fort Wayne, Fort Wayne, IN, USA

In the paper, we introduce bag relational algebra with grouping and aggregation overa particular representation of incomplete information called c-tables, which wasfirst introduced byGrahne in 1984.In order for this algebra to be closed and ``well-defined'', we adopt the closed world assumptionas described by Reiter in 1978 and extend the tuple and table conditions to linear ones.It turns out that query answering overthe described extension remains polynomial timerelative to the size of the certain information. Therefore, the proposed algebra can be implemented as partof a SQL engine that can query incomplete information. The execution time will be acceptable as long as the size of the incomplete information issmall relative to the total size of the database.

Published in:

Information, Process, and Knowledge Management, 2010. eKNOW '10. Second International Conference on

Date of Conference:

10-15 Feb. 2010