Skip to main content
Springer Nature Link
Log in

About Inclusion-Based Generalized Yes/No Queries in a Possibilistic Database Context

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2006)

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

Included in the following conference series:

  • 1132 Accesses

Abstract

This paper deals with the querying of possibilistic relational databases, by means of queries called generalized yes/no queries, whose general form is: “to what extent is it possible that the answer to Q satisfies property P”. Here, property P concerns the inclusion in the result, of a set of tuples specified by the user. A processing technique for such queries is proposed, which avoids computing the worlds attached to the possibilistic database.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abiteboul, S., Kanellakis, P., Grahne, G.: On the Representation and Querying of Sets of Possible Worlds. Theoret. Comput. Sci. 78, 159–187 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bosc, P., Pivert, O.: About Projection-selection-join Queries Addressed to Possibilistic Relational Databases. IEEE Transactions on Fuzzy Systems 31, 124–139 (2005)

    Article  Google Scholar 

  3. Bosc, P., Lietard, N., Pivert, O.: About Cardinality-based Possibilistic Queries against Possibilistic Databases. In: EUSFLAT-LFA, pp. 1176–1275 (2005)

    Google Scholar 

  4. Bosc, P., Prade, H.: An Introduction to the Treatment of Flexible Queries and Uncertain or Imprecise Databases. In: Motro, A., Smets, P. (eds.) Uncertainty Management in Information Systems, pp. 285–324. Kluwer Academic Publishers, Dordrecht (1997)

    Google Scholar 

  5. Bosc, P., Pivert, O.: About Yes/No Queries against Possibilistic Databases. International Journal of Intelligent Systems (to appear)

    Google Scholar 

  6. Imielinski, T., Lipski, W.: Incomplete Information in Relational Databases. Journal of the ACM 31, 761–791 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  7. Zadeh, L.A.: Fuzzy Sets as a Basis for a Theory of Possibility. Fuzzy Sets and Systems 1, 3–28 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA/Enssat, Technopole Anticipa, BP 80518, 22300, Lannion, France

    Patrick Bosc, Nadia Lietard & Olivier Pivert

Authors
  1. Patrick Bosc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nadia Lietard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Olivier Pivert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Bari,  

    Floriana Esposito

  2. Department of Computer Science, University of North Carolina, NC 28223, Charlotte, USA

    Zbigniew W. Raś

  3. Dipartimento di Informatica, Università degli Studi di Bari, via Orabona, 4, 70126, Bari, Italy

    Donato Malerba

  4. Dipartimento di Informatica, Università di Bari, Via E. Orabona, 4, 70125, Bari, Italia

    Giovanni Semeraro

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bosc, P., Lietard, N., Pivert, O. (2006). About Inclusion-Based Generalized Yes/No Queries in a Possibilistic Database Context. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_32

Download citation

  • DOI: https://doi.org/10.1007/11875604_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45764-0

  • Online ISBN: 978-3-540-45766-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics