Bag-based data models for incomplete information and their closure properties

  • Authors:

  • Akinari Yamaguchi;Shougo Shimizu;Yasunori Ishihara;Toru Fujiwara

  • Affiliations:

  • Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565---0871;Department of Computer and Media Technologies, Hiroshima City University, Hiroshima, Japan 731---3194;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565---0871;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565---0871

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In most practical database applications, incompleteness and duplication of facts should be carefully handled. We propose bag-based data models for incomplete information, called V-bags, CV-bags, GV-bags, and CGV-bags. In V-bags, incompleteness is represented by variables like C-tables by Imielinski and Lipski. GV-bags are a supermodel of V-bags, where global conditions that restrict assignments over variables are attached. CV-bags and CGV-bags are submodels of V-bags and GV-bags, respectively, where the usage of variables for representing the number of duplication of tuples is somewhat restricted. We also investigate the closure properties of forward and inverse algebraic operations (selection, projection, product, union, difference, and unique) on each of the data models under both CWA and OWA. Among these data models, CGV-bags have the most closed operations.