Title :
Automated logical navigation among relations using Steiner trees
Author_Institution :
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
Abstract :
The use of the Steiner tree (or the shortest connection) as a model for automatic logical navigation among relations is described. An efficient approximation algorithm is introduced for finding shortest connections. The model is extended to allow for ambiguous words in queries. The capability of this method is demonstrated by a simple database interface which is both easy to build and easy to use. The method can also be used in other query systems as a tool for finding navigation routes
Keywords :
information retrieval; relational databases; Steiner tree; ambiguous words; automatic logical navigation; efficient approximation algorithm; navigation routes; query systems; relational database; shortest connection; simple database interface; Approximation algorithms; Database languages; Navigation; Physics computing; Steiner trees; Tree graphs;
Conference_Titel :
Data Engineering, 1989. Proceedings. Fifth International Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
0-8186-1915-5
DOI :
10.1109/ICDE.1989.47265
