ComputationWorld 2017
February 19 - 23, 2017 - Athens, Greece

  • SERVICE COMPUTATION 2017, The Ninth International Conferences on Advanced Service Computing
  • CLOUD COMPUTING 2017, The Eighth International Conference on Cloud Computing, GRIDs, and Virtualization
  • FUTURE COMPUTING 2017, The Ninth International Conference on Future Computational Technologies and Applications
  • COGNITIVE 2017, The Ninth International Conference on Advanced Cognitive Technologies and Applications
  • ADAPTIVE 2017, The Ninth International Conference on Adaptive and Self-Adaptive Systems and Applications
  • CONTENT 2017, The Ninth International Conference on Creative Content Technologies
  • PATTERNS 2017, The Ninth International Conferences on Pervasive Patterns and Applications
  • COMPUTATION TOOLS 2017, The Eighth International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking
  • BUSTECH 2017, The Seventh International Conference on Business Intelligence and Technology

DigitalWorld 2017
March 19 - 23, 2017 - Nice, France

  • ICDS 2017, The Eleventh International Conference on Digital Society and eGovernments
  • ACHI 2017, The Tenth International Conference on Advances in Computer-Human Interactions
  • GEOProcessing 2017, The Ninth International Conference on Advanced Geographic Information Systems, Applications, and Services
  • eTELEMED 2017, The Ninth International Conference on eHealth, Telemedicine, and Social Medicine
  • DIGITAL HEALTHY LIVING 2017, A Multidisciplinary View on Digital Support for Healthy Living and Self-management for Health
  • MATH 2017, The International Symposium on Mobile and Assistive Technology for Healthcare
  • eLmL 2017, The Ninth International Conference on Mobile, Hybrid, and On-line Learning
  • eKNOW 2017, The Ninth International Conference on Information, Process, and Knowledge Management
  • ALLSENSORS 2017, The Second International Conference on Advances in Sensors, Actuators, Metering and Sensing

NexComm 2017
April 23 - 27, 2017 - Venice, Italy

  • ICDT 2017, The Twelfth International Conference on Digital Telecommunications
  • SPACOMM 2017, The Ninth International Conference on Advances in Satellite and Space Communications
  • ICN 2017, The Sixteenth International Conference on Networks
  • SOFTNETWORKING 2017, The International Symposium on Advances in Software Defined Networking and Network Functions Virtualization
  • ICONS 2017, The Twelfth International Conference on Systems
  • MMEDIA 2017, The Ninth International Conferences on Advances in Multimedia
  • PESARO 2017, The Seventh International Conference on Performance, Safety and Robustness in Complex Systems and Applications
  • CTRQ 2017, The Tenth International Conference on Communication Theory, Reliability, and Quality of Service
  • COCORA 2017, The Seventh International Conference on Advances in Cognitive Radio
  • ALLDATA 2017, The Third International Conference on Big Data, Small Data, Linked Data and Open Data
  • KESA 2017, The International Workshop on Knowledge Extraction and Semantic Annotation
  • SOFTENG 2017, The Third International Conference on Advances and Trends in Software Engineering

 


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 - 2015 © ThinkMind. All rights reserved.
Read Terms of Service and Privacy Policy.