On the Feasibility of Informative Answers

In this chapter, we investigate the situation where a user’s request for data cannot be answered in the desired way because the data base does not contain the data requested. We argue that in such a situation it is not sufficient to report to the user the fact that the query failed, without providing the deeper reasons for the failure; an informative answer to a failing query, however, will adjust the user’s wrong assumptions about the contents of the data base and often will free him/her from the need of asking additional queries. We describe a formal method by means of which the reasons for the failure of a user’s query expressed in a relational calculus based language may be inferred and reported to the user as answer; special attention is paid to the amount of computation required for this answer generation procedure. We then show that a wide class of integrity constraints of a data base may be used to further improve the inference process and that any abuse of informative answers for the deduction of confidential information may be prevented easily.

[1]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

[2]  Michael Stonebraker,et al.  Access control in a relational data base management system by query modification , 1974, ACM '74.

[3]  Raymond Reiter On Closed World Data Bases , 1977, Logic and Data Bases.

[4]  Ronald M. Lee Conversational Aspects of Database Interactions , 1978, VLDB.

[5]  Peter J. Denning,et al.  Data Security , 1979, CSUR.

[6]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[7]  Jack Minker,et al.  The Use of a Semantic Network in a Deductive Question-Answering System , 1977, IJCAI.

[8]  Jack Minker,et al.  Advances in Data Base Theory: Volume 1 , 1981 .

[9]  Robert Demolombe Semantic Checking Of Questions Expressed In Predicate Calculus Language , 1979, Fifth International Conference on Very Large Data Bases, 1979..

[10]  Samuel Jerrold Kaplan,et al.  Cooperative responses from a portable natural language data base query system. , 1979 .

[11]  Robert Demolombe Assigning Meaning to Ill-Defined Queries Expressed in Predicate Caculus Language , 1979, Advances in Data Base Theory.

[12]  Raymond Reiter On the Integrity of Typed First Order Data Bases , 1979, Advances in Data Base Theory.

[13]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[14]  Jürgen M. Janas How Not to Say "NIL": Improving Answers to Failing Queries in Data Base Systems , 1979, IJCAI.

[15]  Jürgen M. Janas Towards More Informative User Interfaces , 1979, Fifth International Conference on Very Large Data Bases, 1979..