Abstract
It is now recognized that querying databases containing imprecise information raises several problems, including that of the computational complexity of evaluating the query. In this paper, we consider a new kind of query, called possibilistic query, of the form “to what extent is it possible that a given tuple t belongs to the answer of Q”, where Q is a regular relational query. The aim is to show that a reasonable complexity can be expected for a specified subset of possibilistic queries.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
