Skip to main content
SpringerLink
Log in

Degrees of Exclusivity in Disjunctive Databases

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4994))

Included in the following conference series:

  • 1027 Accesses

Abstract

Ever since the emergence of the relational database model, the problem of incompleteness has been studied extensively. Declarative semantics for disjunctive databases widely adopt two methodologies representing opposite ends of the spectrum - Minker’s GCWA interprets disjunctions exclusively while Ross and Topor’s DDR interprets them inclusively. We argue that the use of either one as the semantics is limiting. For example, in a blood group relation, saying that the blood group of John is A or B, BG(John,A) ∨ BG(John,B) can be interpreted exclusively while the statement supplier S1 supplies part P1 or P2 to project J1, supplies(S1,P1,J1) ∨ supplies(S1,P2,J1) need not necessarily be exclusive. In this paper, we present a model that allows the nature of the disjunctions to be represented explicitly and show its relation to other semantics for disjunctive databases. A notable feature of this extension is that it does not require variables in order to represent indefinite information.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chan, E.P.F.: A possible world semantics for disjunctive databases. Knowledge and Data Engineering 5(2), 282–292 (1993)

    Article  Google Scholar 

  2. Chiu, J.-S., Chen, A.L.P.: An exploration of relationships among exclusive disjunctive data. IEEE Trans. Knowl. Data Eng. 7(6), 928–940 (1995)

    Article  Google Scholar 

  3. Gire, F., Plourde, C.: A new partial semantics for disjunctive deductive databases. Fundam. Inf. 67(4), 323–342 (2005)

    MATH  MathSciNet  Google Scholar 

  4. Imieliński, T., Lipski Jr., W.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)

    Article  Google Scholar 

  5. Liu, K.-C., Sunderraman, R.: On representing indefinite and maybe information in relational databases. In: ICDE, pp. 250–257 (1988)

    Google Scholar 

  6. Liu, K.-C., Sunderraman, R.: Indefinite and maybe information in relational databases. ACM Trans. Database Syst. 15(1), 1–39 (1990)

    Article  MathSciNet  Google Scholar 

  7. Liu, K.-C., Sunderraman, R.: On representing indefinite and maybe information in relational databases: A generalization. In: ICDE, pp. 495–502 (1990)

    Google Scholar 

  8. Liu, K.-C., Sunderraman, R.: A generalized relational model for indefinite and maybe information. IEEE Trans. Knowl. Data Eng. 3(1), 65–77 (1991)

    Article  Google Scholar 

  9. Lozinskii, E.L.: Plausible world assumption. In: Brachman, R.J., Levesque, H.J., Reiter, R. (eds.) KR 1989: Proc. of the First International Conference on Principles of Knowledge Representation and Reasoning, pp. 266–275. Kaufmann, San Mateo (1989)

    Google Scholar 

  10. Ola, A.: Relational databases with exclusive disjunctions. In: ICDE, pp. 328–336 (1992)

    Google Scholar 

  11. Ross, K.A., Topor, R.W.: Inferring negative information from disjunctive databases. J. Autom. Reason. 4(4), 397–424 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sakama, C.: Possible model semantics for disjunctive databases II (extended abstract). Logic Programming and Non-monotonic Reasoning, 107–114 (1990)

    Google Scholar 

  13. Sarma, A.D., Benjelloun, O., Halevy, A., Widom, J.: Working models for uncertain data. In: ICDE 2006: Proceedings of the 22nd International Conference on Data Engineering (ICDE 2006), p. 7. IEEE Computer Society, Washington (2006)

    Chapter  Google Scholar 

  14. Vadaparty, K.V., Naqvi, S.A.: Using constraints for efficient query processing in nondeterministic databases. IEEE Trans. Knowl. Data Eng. 7(6), 850–864 (1995)

    Article  Google Scholar 

  15. Zhang, L., Liu, K.-C.: Towards a relational model for exclusively disjunctive information. In: CSC 1993: Proceedings of the 1993 ACM conference on Computer science, pp. 143–150. ACM Press, New York (1993)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Georgia State University, Atlanta, GA 30302

    Navin Viswanath & Rajshekhar Sunderraman

Authors
  1. Navin Viswanath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajshekhar Sunderraman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Aijun An Stan Matwin Zbigniew W. Raś Dominik Ślęzak

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Viswanath, N., Sunderraman, R. (2008). Degrees of Exclusivity in Disjunctive Databases. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds) Foundations of Intelligent Systems. ISMIS 2008. Lecture Notes in Computer Science(), vol 4994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68123-6_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68123-6_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68122-9

  • Online ISBN: 978-3-540-68123-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation