Abstract
This paper is situated in the area of the so-called fuzzy databases, i.e., databases containing imprecise information. It is now recognized that querying databases containing imperfect information raises several problems, including complexity. In this paper, we consider a specific kind of queries, called possibilistic queries, of the form “to what extent is it possible that a given tuple t belongs to the answer of Q (a regular relational query).” The major objective is to show that a reasonable complexity can be expected for a specific (although not too restricted) subset of possibilistic queries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Hull, R, Vianu, V.: Foundations of databases, Addison-Wesley, 1995.
Bosc, P., Duval, L., Pivert, O.: About Possibilistic Queries Against Possibilistic Databases, to appear in the Proc. of the 17th ACM Symposium on Applied Computing (SAC’2002), March 2002.
Bosc, P., Liétard, L., Pivert, O.: A function-based join for the manipulation of possibilistic relations, 16th ACM Conference on Applied Computing (SAC’2001), Las Vegas (USA), 472–476, 2001.
Bosc, P., Prade, H.: An introduction to fuzzy set and possibility theory-based approaches to the treatment of uncertainty and imprecision in data base management systems, In: Uncertainty Management in Information Systems-From Needs to Solutions, (Motro A. and Smets P. Eds.), Kluwer Academic Publishers, 285–324, 1997.
Imielinski, T., Lipski, W.: Incomplete information in relational databases, Journal of the ACM, 31, 761–791, 1984.
Libkin, L., Wong, L.: Semantic representations and query languages for or-sets, 12th PODS Conference, 37–48, 1993.
Prade, H., Testemale, C.: Generalizing database relational algebra for the treatment of incomplete/uncertain information and vague queries, Information Sciences, 34, 115–143, 1984.
Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility, Fuzzy Sets and Systems, 1, 3–28, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bosc, P., Duval, L., Pivert, O. (2002). About Selections and Joins in Possibilistic Queries Addressed to Possibilistic Databases. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_59
Download citation
DOI: https://doi.org/10.1007/3-540-46146-9_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44126-7
Online ISBN: 978-3-540-46146-3
eBook Packages: Springer Book Archive