NexComm 2014
February 23 - 27, 2014
Nice, France

DigitalWorld 2014
March 23 - 27, 2014
Barcelona, Spain

InfoSys 2014
April 20 - 24, 2014
Chamonix, France

BioSciencesWorld 2014
April 20 - 24, 2014
Chamonix, France

ComputationWorld 2014
May 25 - 29, 2014
Venice, Italy

InfoWare 2014
June 22 - 26, 2014
Seville, Spain

DataSys 2014
July 20 - 24, 2014
Paris, France

NexTech 2014
August 24 - 28, 2014
Rome, Italy

SoftNet 2014
October 12 - 16, 2014
Nice, France

NetWare 2014
November 16 - 20, 2014
Lisbon, Portugal

 

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.