DigitalWorld 2015
February 22 - 27, 2015 - Lisbon, Portugal

ComputationWorld 2015
March 22 - 27, 2015 - Nice, France

NexComm 2015
April 19 - 24, 2015 - Barcelona, Spain

InfoSys 2015
May 24 - 29, 2015 - Rome, Italy

BioSciencesWorld 2015
May 24 - 29, 2015 - Rome, Italy

DataSys 2015
June 21 - 26, 2015 - Brussels, Belgium

NexTech 2015
July 19 - 24, 2015 - Nice, France

NetWare 2015
August 23 - 28, 2015 - Venice, Italy

InfoWare 2015
October 11 - 16, 2015 - St. Julians, Malta

SoftNet 2015
November 15 - 20, 2015 - Barcelona, Spain

 

ThinkMind // International Journal On Advances in Intelligent Systems, volume 3, numbers 3 and 4, 2010 // View article intsys_v3_n34_2010_8


Bag Relational Algebra with Grouping and Aggregation over C-Tables with Linear Conditions

Authors:
Lubomir Stanchev

Keywords: incomplete information; c-tables; relational model; null values; bag semantics

Abstract:
We introduce bag relational algebra with grouping and aggregation over a particular representation of incomplete information called c-tables, which was first introduced by Grahne in 1984. In order for this algebra to be closed and “well defined”, we adopt the closed world assumption as described by Reiter in 1978 and extend the tuple and table conditions to linear ones. We explore the problem of rewriting and simplifying this novel type of c-tables, show how to perform equivalence test for c-tables, and argue why it is difficult to create a canonical form for c-tables. We present certain answer semantics for a full-blown relational algebra with grouping and aggregation and accordingly present algorithms for executing the different relational algebra operators over our representation of incomplete information. The algorithms run in polynomial time relative to the size of the precise information, which makes them a candidate for implementation as part of a DBMS engine that supports storage and retrieval of incomplete information.

Pages: 258 to 272

Copyright: Copyright (c) to authors, 2010. Used with permission.

Publication date: April 6, 2011

Published in: journal

ISSN: 1942-2679

SERVICES CONTACT
2010 - 2014 © ThinkMind. All rights reserved.
Read Terms of Service and Privacy Policy.