Intensional Answers to Database Queries

In addition to data, database systems store various kinds of information about their data. Examples are: class hierarchies, to define the various data classes and their relationships; integrity constraints, to state required relationships among the data; and inference rules, to define new classes in terms of known classes. This information is often referred to as intensional information (the data are referred to as extensional information). There have been several independent research works that suggested ways by which intensional information may be used to improve the conventional (extensional) database answers. Although each of these efforts developed its own specific methods, they all share a common belief: database answers would be improved if accompanied by intensional statements that describe them more abstractly. We study and compare the various approaches to intensional answers by using various classifications; we examine their relative merits with regard to key aspects; we discuss remaining issues; and we offer new research directions. >

[1]  Roger King,et al.  Semantic database modeling: survey, applications, and research issues , 1987, CSUR.

[2]  Won Kim,et al.  Object-Oriented Concepts, Databases, and Applications , 1989 .

[3]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

[4]  Paul G. Sorenson,et al.  Resolving the query inference problem using Steiner trees , 1984, TODS.

[5]  Joan Peckham,et al.  Semantic data models , 1988, CSUR.

[6]  Amihai Motro.  SEAVE: a mechanism for verifying user presuppositions in query systems , 1986, TOIS.

[7]  Richard R. Muntz,et al.  Implicit Representation for Extensional Answers , 1988, Expert Database Conf..

[8]  David Maier,et al.  Maximal objects and the semantics of universal relation databases , 1983, TODS.

[9]  Francisco Corella.  Semantic Retrieval and Levels of Abstraction , 1984, Expert Database Workshop.

[10]  Alain Pirotte,et al.  Constraints for improving the generation of intentional answers in a deductive database , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[11]  Robert Demolombe,et al.  Querying a Rule Base , 1986, Expert Database Conf..

[12]  David Maier,et al.  Toward logical data independence: a relational query language without relations , 1982, SIGMOD '82.

[13]  Ryszard S. Michalski,et al.  A theory and methodology of inductive learning , 1993 .

[14]  Bonnie L. Webber,et al.  A Natural Language Processing: A Survey , 1986, On Knowledge Base Management Systems.

[15]  Jack Minker,et al.  Semantic Query Optimization in Expert Systems and Database Systems , 1984, Expert Database Workshop.

[16]  Richard R. Muntz,et al.  An Information-Theoretic Study on Aggregate Responses , 1988, VLDB.

[17]  Amihai Motro.  Using Integrity Constraints to Provide Intensional Answers to Relational Queries , 1989, VLDB.

[18]  Frédéric Cuppens,et al.  Cooperative Answering: A Methodology to Provide Intelligent Access to databases , 1988, Expert Database Conf..

[19]  Tomasz Imielinski,et al.  Intelligent Query Answering in Rule Based Systems , 1988, J. Log. Program..

[20]  Francisco Corella,et al.  Cooperative responses to boolean queries , 1984, 1984 IEEE First International Conference on Data Engineering.

[21]  Amihai Motro.  FLEX: A Tolerant and Cooperative User Interface to Databases , 1990, IEEE Trans. Knowl. Data Eng..

[22]  Bonnie L. Webber,et al.  Questions, Answers and Responses: Interacting with Knowledge-Base Systems , 1986, On Knowledge Base Management Systems.

[23]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[24]  Qiming Chen,et al.  Using type inference and induced rules to provide intensional answers , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[25]  Tomasz Imeilinski.  Intelligent query answering in rule based systems , 1987 .