Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abiteboul, S., & Duschka, O.M. (1998). Complexity of answering queries using materialized views. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, Washington (pp. 254–263). New York: ACM.

    Google Scholar 

  • Abiteboul, S., & Grahne, G. (1985). Update semantics for incomplete databases. In Proceedings of 11th International Conference on Very Large Data Bases, Stockholm, Sweden (pp. 1–12). San Francisco, California: Morgan Kaufmann.

    Google Scholar 

  • Brodsky, A., Farkas, C., & Jajodia, S. (2000). Secure databases: Constraints, inference channels, and monitoring disclosures. IEEE Transactions on Knowledge and Data Engineering, 12(6), 900–919.

    Article  Google Scholar 

  • Calvanese, D., Giacomo, G.D., Lenzerini, M., & Vardi, M. Y. (2000). Answering regular path queries using views. In Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA (pp. 389–398). Washington, District of Columbia: IEEE Computer Society.

    Google Scholar 

  • Codd, E. F. (1975). Understanding relations. FDT—Bulletin of ACM SIGMOD, 7(3), 23–28.

    Google Scholar 

  • Grahne, G. (1984). Dependency satisfaction in databases with incomplete information. In Proceedings of 10th International Conference on Very Large Data Bases, Singapore (pp. 37–45). San Franciso, California: Morgan Kaufmann.

    Google Scholar 

  • Grahne, G. (1991). The Problem of Incomplete Information in Relational Databases. Lecture Notes Computer Science 554, 156.

  • Halevy, A. Y. (2001). Answering queries using views: A survey. VLDB Journal, 10(4), 270–294.

    Article  MATH  Google Scholar 

  • Imielinski, T., & Lipski, W. (1984). Incomplete information in relational databases. Journal ACM, 31(4), 761–791.

    Article  MATH  MathSciNet  Google Scholar 

  • Lechtenbörger, J., Shu, H., & Vossen, G. (2002). Aggregate queries over conditional tables. Journal of Intelligent Information Systems, 19(3), 343–362.

    Article  Google Scholar 

  • Levy, A. Y., Mendelzon, A. O., Sagiv, Y., & Srivastava, D. (1995). Answering queries using views. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Jose, California (pp. 95–104). New York: ACM.

    Chapter  Google Scholar 

  • Libkin, L., & Wong, L. (1995). On representation and querying incomplete information in databases with bags. Information Processing Letters, 56(4), 209–214.

    Article  MATH  MathSciNet  Google Scholar 

  • Libkin, L., & Wong, L. (1997). Query languages for bags and aggregate functions. Journal of Computer and System Sciences, 55(2), 241–272.

    Article  MATH  MathSciNet  Google Scholar 

  • Reiter, R. (1978). On closed world data bases. In H. Gallaire & J. Minker (eds.), Advances in Data Base Theory (pp. 55–76). New York: Plenum

    Google Scholar 

  • Yamaguchi, A. (2005). Bag-based data models for incomplete information. Master’s thesis, Graduate School of Information Science and Technology, Osaka University. Retrieved from http://www-infosec.ist.osaka-u.ac.jp/paper/yamaguchi_mthesis2004.pdf.

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Osaka University, 1–5 Yamadaoka, Suita, Osaka, 565–0871, Japan

    Akinari Yamaguchi, Yasunori Ishihara & Toru Fujiwara

  2. Department of Computer and Media Technologies, Hiroshima City University, 3–4–1 Ozuka-higashi, Asaminami–ku, Hiroshima, 731–3194, Japan

    Shougo Shimizu

Authors
  1. Akinari Yamaguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shougo Shimizu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yasunori Ishihara
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Toru Fujiwara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shougo Shimizu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamaguchi, A., Shimizu, S., Ishihara, Y. et al. Bag-based data models for incomplete information and their closure properties. J Intell Inf Syst 30, 115–135 (2008). https://doi.org/10.1007/s10844-006-0020-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-006-0020-1

Keywords

Search

Navigation