Skip to main content
SpringerLink
Log in

Certain Answers for Views and Queries Expressed as Non-recursive Datalog Programs with Negation

  • Conference paper
Book cover Intelligent Information and Database Systems (ACIIDS 2011)

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

Included in the following conference series:

  • 1055 Accesses

Abstract

In this paper, we study the problem to compute certain answers in case when view definitions are expressed as non-recursive datalog programs with negation and queries are expressed as semi-positive non-recursive datalog programs with negation. Two situations are analyzed: the open world assumption (OWA) and the close world assumption (CWA). Associated to a view, and an extension of the view, a tree is constructed, which is useful to specify a method to compute certain answers.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: PODS, pp. 254–263 (1998)

    Google Scholar 

  2. Afrati, F., Li, C., Mitra, P.: Rewriting queries using views in the presence of arithmetic comparisons. Theoretical Computer Science 368, 88–123 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arenas, M., Bertossi, L., Chomicki, J.: Answer set for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3, 394–424 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Call, A., Lembro, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: IJCAI 2003, pp. 16–21 (2003)

    Google Scholar 

  5. Call, A., Lembro, D., Rosati, R.: On the Decodability and Complexity of Query Answering over Inconsistent and Incomplete Databases. In: PODS, pp. 260–271 (2003)

    Google Scholar 

  6. Calvanese, D., Giacomo, G. De., Lenzerini, M., Vardi, M.Y.: View-based query processing. On the relationship between rewriting, answering and losslessness. Theoretical Computer Science 371, 169–182 (2007)

    MATH  Google Scholar 

  7. Calvanese, D.,Giacomo, G. De., Lenzerini, M., Vardi, M.Y.: Answering Regular Path Queries Views. In: Proc. of the 16th IEEE Int. Conf. on Data Engineering, ICDE, pp. 389–398 (2000)

    Google Scholar 

  8. Caniupan, M., Bertossi, L.: The consistency extractor system: Answer set programs for consistent query answering in databases. Data and Knowledge Engineering 69, 545–572 (2010)

    Article  Google Scholar 

  9. Chomicki, J.: Consistent Query Answering, Recent Developments and Future Directions, http://cse.buffalo.edu/~chomicki/papers-iicis0

  10. Duschka, O.M., Genesereth, M.R., Levy, A.: Recursive Query Plans for Data Integration. Journal of Logic Programming 43(1), 49–73 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fagin, R., Kolaitis, P.G., Popa, L., Miller, R.J.: Data Exchange: Semantics and Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Flesca, S., Greco, S.: Rewriting queries using views. IEEE Trans. Knowledge Data Engineering 13(6), 980–995 (2001)

    Article  Google Scholar 

  13. Millstein, T., Halevy, A., Friedman, M.: Query containment for data integration systems. JCSS 66, 20–39 (2003)

    MathSciNet  MATH  Google Scholar 

  14. Nash, A., Segoufin, L., Vianu, V.: Views and Queries. Determinacy and Rewriting. ACM TODS 35(3) (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, ”Al.I.Cuza” University of Iasi, 16 General Berthelot Street, Iasi, Romania

    Victor Felea

Authors
  1. Victor Felea
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University of Technology, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  2. Department of Computer Engineering, Yeungnam University, 712-749, Dae-Dong, Gyeungsan, Korea

    Chong-Gun Kim

  3. Institute of Informatics, Automation and Robotics, Wroclaw University of Technology, 50-370, Wrocław, Poland

    Adam Janiak

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Felea, V. (2011). Certain Answers for Views and Queries Expressed as Non-recursive Datalog Programs with Negation. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20039-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20039-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20038-0

  • Online ISBN: 978-3-642-20039-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation