Skip to main content
SpringerLink
Log in

On Monotonic Deductive Database Updating Under the Open World Assumption

  • Conference paper
  • First Online:
Information Search, Integration, and Personalization (ISIP 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 622))

  • 290 Accesses

Abstract

In this paper, we present and discuss our preliminary work on a deductive database model in which insertions and deletions are associated with time stamps. Although time stamps have been used for many purposes in traditional approaches to databases, no approach did investigate their impact in a deductive framework under the so called Open World Assumption (OWA).

To do so, we consider Datalog databases with negation in the body of the rules and define the semantics of such databases using a three valued logics. Relying on our previous work on database updating, we show that updates in our approach are performed in a deterministic way and preserve database consistency with respect to the rules. Moreover, contrary to standard approaches, we argue that our model is monotonic in the sense that through time, updates refine the database semantics, while never overriding results from past semantics. We relate our approach to standard updating approaches from the literature and we discuss implementation issues based on the graph database model.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    RDF stands for ‘Resource Description Framework’ and is a W3C Recommendation, see https://www.w3.org/standards/techs/rdf#w3c_all.

References

  1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 309–328. AAAI-MIT Press (1996)

    Google Scholar 

  2. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

  3. Alves, M.H.F., Laurent, D., Spyratos, N.: Update rules in datalog programs. J. Log. Comput. 8(6), 745–775 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1: 1–1: 39 (2008)

    Article  Google Scholar 

  5. Atzeni, P., Torlone, R.: Updating intensional predicates in datalog. Data Knowl. Eng. 8, 1–17 (1992)

    Article  MATH  Google Scholar 

  6. Baudinet, M., Chomicki, J., Wolper, P.: Temporal deductive databases. In: Temporal Databases, pp. 294–320. Benjamin/Cummings (1993)

    Google Scholar 

  7. Belnap, N.D.: A useful four-valued logic. In: Dunn, J.M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic. D. Reidel, Dordrecht (1977)

    Google Scholar 

  8. Bergman, M.: The open world assumption: elephant in the room. In: AI3: : Adaptative Information, pp. 1–11 (2009). www.mkbergman.com/852/the-open-world-assumption-elephant-in-the-room/

  9. Bidoit, N.: Negation in rule-based database languages: a survey. Theor. Comput. Sci. 78(1), 3–83 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bidoit, N., Froidevaux, C.: Negation by default and unstratifiable logic programs. Theor. Comput. Sci. 78(1), 86–112 (1991)

    MathSciNet  MATH  Google Scholar 

  11. Bidoit, N., Objois, M.: Temporal query languages expressive power: \(\mu \)TL versus T-WHILE. In: 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), pp. 74–82. IEEE Computer Society (2005)

    Google Scholar 

  12. Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)

    Book  Google Scholar 

  13. Chaudhuri, S., Dayal, U.: An overview of data warehousing and OLAP technology. SIGMOD Rec. 26(1), 65–74 (1997)

    Article  Google Scholar 

  14. Fitting, M.: A Kripke-Kleene semantics for logic programs. J. Log. Program. 2(4), 295–312 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Flouris, G., Konstantinidis, G., Antoniou, G., Christophides, V.: Formal foundations for RDF/S KB evolution. Knowl. Inf. Syst. 35(1), 153–191 (2013)

    Article  Google Scholar 

  16. Gabbay, D.M.: Introduction to labelled deductive systems. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic: Observation of Strains, Chap. 3, vol. 17, pp. 179–266. Springer, Heidelberg (2013)

    Google Scholar 

  17. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)

    MathSciNet  MATH  Google Scholar 

  18. Greco, G., Greco, S., Zumpano, E.: A logical framework for querying and repairing inconsistent databases. IEEE Trans. Knowl. Data Eng. 15(6), 1389–1408 (2003)

    Article  Google Scholar 

  19. Gutierrez, C., Hurtado, C.A., Vaisman, A.A.: Introducing time into RDF. IEEE Trans. Knowl. Data Eng. 19(2), 207–218 (2007)

    Article  Google Scholar 

  20. Halpern, J.Y., Shoham, Y.: A propositional modal logic of time intervals. J. ACM 38(4), 935–962 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hussain, F., Liu, H., Suzuki, E., Lu, H.: Exception rule mining with a relative interestingness measure. In: Terano, T., Liu, H., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 86–97. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Robinson, E.E.I., Webber, J.: Graph Databases. New Opportunities for Connected Data, 2nd edn. O’Reilly Media, Beijing (2015)

    Google Scholar 

  23. Iordanov, B.: HyperGraphDB: a generalized graph database. In: Shen, H.T., Pei, J., Özsu, M.T., Zou, L., Lu, J., Ling, T.-W., Yu, G., Zhuang, Y., Shao, J. (eds.) WAIM 2010. LNCS, vol. 6185, pp. 25–36. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  24. Jensen, C.S., Snodgrass, R.T.: Temporal data management. IEEE Trans. Knowl. Data Eng. 11(1), 36–44 (1999)

    Article  Google Scholar 

  25. Laurent, D., Luong, V.P., Spyratos, N.: The use of deleted tuples in database, querying, updating. Acta Inf. 34(12), 905–925 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  26. Laurent, D., Luong, V.P., Spyratos, N.: Updating intensional predicates in deductive databases. Data Knowl. Eng. 26(1), 37–70 (1998)

    Article  MATH  Google Scholar 

  27. Laurent, D., Vrain, C.: Learning query rules for optimizing databases with update rules. In: Pedreschi, D., Zaniolo, C. (eds.) LID 1996. LNCS, vol. 1154, pp. 153–172. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  28. Loyer, Y., Spyratos, N., Stamate, D.: Hypothesis-based semantics of logic programs in multivalued logics. ACM Trans. Comput. Log. 5(3), 508–527 (2004)

    Article  MathSciNet  Google Scholar 

  29. Reiter, R.: On closed world data bases. In: Logic and Data Bases, pp. 55–76 (1977)

    Google Scholar 

  30. Reiter, R.: On formalizing database updates: preliminary report. In: Pirotte, A., Delobel, C., Gottlob, G. (eds.) EDBT 1992. LNCS, vol. 580, pp. 10–20. Springer, Heidelberg (1992)

    Google Scholar 

  31. Terenziani, P., Snodgrass, R.T.: Reconciling point-based and interval-based semantics in temporal relational databases: a treatment of the telic/atelic distinction. IEEE Trans. Knowl. Data Eng. 16(5), 540–551 (2004)

    Article  Google Scholar 

  32. Torlone, R.: Update operations in deductive databases with functional dependencies. Acta Inf. 31(6), 573–600 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

The author wishes to thank the anonymous referees whose comments and suggestions helped improve a preliminary version of the paper.

Author information

Authors and Affiliations

  1. ETIS Laboratory, ENSEA/UCP/CNRS, Cergy-Pontoise, France

    Dominique Laurent

Authors
  1. Dominique Laurent
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dominique Laurent .

Editor information

Editors and Affiliations

  1. University of North Dakota, Grand Forks, North Dakota, USA

    Emanuel Grant

  2. Université de Cergy-Pontoise, Pontoise, France

    Dimitris Kotzinos

  3. Université de Cergy-Pontoise, Pontoise, France

    Dominique Laurent

  4. LRI, University of Paris South LRI, Orsay, France

    Nicolas Spyratos

  5. Information Science, Knowledge Media Lab, Hokkaido University, Sapporo, Hokkaido, Japan

    Yuzuru Tanaka

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Laurent, D. (2016). On Monotonic Deductive Database Updating Under the Open World Assumption. In: Grant, E., Kotzinos, D., Laurent, D., Spyratos, N., Tanaka, Y. (eds) Information Search, Integration, and Personalization. ISIP 2015. Communications in Computer and Information Science, vol 622. Springer, Cham. https://doi.org/10.1007/978-3-319-43862-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43862-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43861-0

  • Online ISBN: 978-3-319-43862-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation