Search and Navigation in Relational Databases

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails through the graph of foreign key dependencies. It differs from previous efforts in the algorithms used, in the presentation mechanism and in the use of primary-key only database queries at query-time to maintain a fast response for users. We present examples using the DBLP data set.
12 pages, 7 figures

Keywords

Databases, H.3;H.4;H.5

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31732

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0307073
 http://arxiv.org/abs/cs/0307073

Collections

arXiv