The Multiple Path Problem in Database Schemata.

摘要

Certain database query systems, especially those that interpret natural language, do not require the user to have comprehensive knowledge of the database schema in order to form a meaningful query. Instead, the query is used to reference entities in the database schema and a path is automatically found through the schema which connects those entities. In this paper, we will classify those schemata in which all paths are equivalent, and then derive a method of marking a schema in order to determine the natural paths between two entities when different paths give rise to different results. (Author)