Skip to main content

Update Policies

  • Conference paper
  • First Online:
AI 2016: Advances in Artificial Intelligence (AI 2016)

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

Included in the following conference series:

  • 3069 Accesses

Abstract

Underspecified transactions can be supported in databases by enabling administrators to specify update policies that complete underspecified transactions. We propose a language for expressing such update policies. We show that the problem of verifying whether or not a policy is sound and complete with respect to database constraints is undecidable in general. We identify decidable instances of this decision problem, and for such instances, present an algorithm that uses resolution to check whether or not a supplied policy is sound and complete with respect to database constraints.

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

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    https://developers.facebook.com/docs/graph-api/making-multiple-requests.

  2. 2.

    https://dev.twitter.com/tags/bulk-operations.

References

  1. Boutilier, C., Brafman, R.I.: Partial-order planning with concurrent interacting actions. J. Artif. Intell. Res. (JAIR) 14, 105–136 (2001)

    Article  MATH  Google Scholar 

  2. Fikes, R., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3/4), 189–208 (1971)

    Article  MATH  Google Scholar 

  3. Grosof, B.N., Labrou, Y., Chan, H.Y.: A declarative approach to business rules in contracts: courteous logic programs in XML. In: EC, pp. 68–77 (1999)

    Google Scholar 

  4. Orman, L.V.: Transaction repair for integrity enforcement. IEEE Trans. Knowl. Data Eng. 13(6), 996–1009 (2001)

    Article  Google Scholar 

  5. Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and difference operators. J. ACM 27(4), 633–655 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Shmueli, O.: Equivalence of datalog queries is undecidable. J. Logic Program. 15(3), 231–241 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. II. Computer Science Press, Rockville (1989)

    Google Scholar 

  8. Ullman, J.D.: Information integration using logical views. In: Afrati, F., Kolaitis, P. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 19–40. Springer, Heidelberg (1997). doi:10.1007/3-540-62222-5_34. http://dl.acm.org/citation.cfm?id=645502.656100

    Chapter  Google Scholar 

  9. Widom, J., Ceri, S. (eds.): Active Database Systems: Triggers and Rules for Advanced Database Processing. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abhijeet Mohapatra .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Mohapatra, A., Agarwal, S., Genesereth, M. (2016). Update Policies. In: Kang, B.H., Bai, Q. (eds) AI 2016: Advances in Artificial Intelligence. AI 2016. Lecture Notes in Computer Science(), vol 9992. Springer, Cham. https://doi.org/10.1007/978-3-319-50127-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50127-7_24

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics