Skip to main content
SpringerLink
Log in

On Query Containment Problem for Conjunctive Queries Under Bag-Set Semantics

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2015)

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

Included in the following conference series:

  • 2178 Accesses

Abstract

The query containment is one of the fundamental problems in the context of query processing and optimization. Concerning the answers of queries for databases, three semantics were intensively analyzed. In the first one, called \(set\), both databases and answers of queries for databases are considered sets. In the second one, called \(\textit{bag-set}\), databases are sets, but the answers are bags (multi-sets). In the third one, called \(bag\), both databases and answers are bags.

In this paper, we study the query containment problem for conjunctive queries (\(CQs\)) under \(\textit{bag-set}\) semantics. It is not known whether this problem is decidable. We give a characterization of this problem.

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., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley Publishing Comp. (1995)

    Google Scholar 

  2. Brisaboa, N.R., Hernandez, H.J.: Testing bag-containment of conjunctive queries. Acta Informatica 34, 557–578 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational data bases. In: ACM STOC (1977)

    Google Scholar 

  4. Chaudhuri, S., Vardi, M.: Optimization of real conjunctive queries. In: Proc. of the 12th ACM Symposium on the Principles of Database Systems, pp. 59–70 (1993)

    Google Scholar 

  5. Damigos, M.: Query Optimization under bag and bag-set semantics for multiple heterogeneous data sources, Ph.D. Thesis, NTUA, Athens (2011)

    Google Scholar 

  6. Jayram, T.S., Kolaitis, P.G., Vee, E.: The containment problem for real conjunctive queries with inequalities. In: PODS 2006, pp. 80–89 (2006)

    Google Scholar 

  7. Karvounarakis, G., Tannen, V.: Conjunctive queries and mappings with inequalities, Technical Report (2008)

    Google Scholar 

  8. Klug, A.: On conjunctive queries containing inequalities. JACM 35(1), 146–160 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  9. van der Meyden, R.: The complexity of querying infinite data about linearly ordered domains. Journal of Computer and System Sciences 54(1), 113–135 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Alexandru Ioan Cuza University of Iasi, Iasi, Romania

    Victor Felea

  2. FEMTO-ST, Franche-Comté University, Besançon, France

    Violeta Felea

Authors
  1. Victor Felea
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Violeta Felea
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Felea .

Editor information

Editors and Affiliations

  1. Ton Duc Thang University, Ho Chi Minh city, Vietnam

    Ngoc Thanh Nguyen

  2. Wroclaw University of Technology, Wroclaw, Poland

    Bogdan Trawiński

  3. Bina Nusantara University, Jakarta, Indonesia

    Raymond Kosala

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Felea, V., Felea, V. (2015). On Query Containment Problem for Conjunctive Queries Under Bag-Set Semantics. In: Nguyen, N., Trawiński, B., Kosala, R. (eds) Intelligent Information and Database Systems. ACIIDS 2015. Lecture Notes in Computer Science(), vol 9011. Springer, Cham. https://doi.org/10.1007/978-3-319-15702-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15702-3_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15701-6

  • Online ISBN: 978-3-319-15702-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation