Search and Navigation in Relational Databases
<|reference_start|>Search and Navigation in Relational Databases: 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.<|reference_end|>
@article{wheeldon2003search,
    title={Search and Navigation in Relational Databases},
    author={Richard Wheeldon, Mark Levene and Kevin Keenoy},
    journal={arXiv preprint arXiv:cs/0307073},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0307073},
    primaryClass={cs.DB}
}