Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 109))

  • 477 Accesses

Summary

This chapter deals with the querying of possibilistic relational databases, by means of generalized yes/no queries whose form is: “to what extent is it possible and certain that the answer to Q satisfies property P”. Here, we consider cardinality-based generalized yes/no queries (in this case, property P is about cardinality) for which a processing technique is proposed, which avoids computing all 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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Zadeh, L. A.: Fuzzy Sets as a Basis for a Theory of Possibility. Fuzzy Sets and Systems. 1 (1978) 3–28

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Bosc, P., Pivert, O.: Towards an Algebraic Query Language for Possibilistic Databases. 12th Conference on Fuzzy Systems (FUZZ-IEEE’03). (2003) 671–676

    Google Scholar 

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

    Article  Google Scholar 

  5. Abiteboul, S., Kanellakis, P., Grahne, G.: On the Representation and Querying of Sets of Possible Worlds. Theoretical Computer Science. 78 (1991) 159–187

    Article  MATH  MathSciNet  Google Scholar 

  6. Bosc, P., Duval, L., Pivert, O.: An Initial Approach to the Evaluation of Possibilistic Queries Addressed to Possibilistic Databases. Fuzzy Sets and Systems. 140 (2003) 151–166

    Article  MATH  MathSciNet  Google Scholar 

  7. Bosc, P., Pivert, O.: On a Strong Representation System for Imprecise Relational Databases. 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU’04). Perugia, Italy. (2004) 1759–1766

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bosc, P., Ibenhssaien, N., Pivert, O. (2008). On the Evaluation of Cardinality-Based Generalized Yes/No Queries. In: Chountas, P., Petrounias, I., Kacprzyk, J. (eds) Intelligent Techniques and Tools for Novel System Architectures. Studies in Computational Intelligence, vol 109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77623-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77623-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77621-5

  • Online ISBN: 978-3-540-77623-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics