Search and Navigation in Relational Databases

TL;DR

This paper introduces a novel keyword search method for relational databases that efficiently finds join paths using primary-key queries, enhancing user navigation and exploration of complex data relationships.

Contribution

It proposes a new algorithm for join discovery that improves speed and usability by leveraging primary-key queries and a Memex-like trail presentation.

Findings

Effective join discovery in relational databases

Fast response times with primary-key only queries

Enhanced user navigation through database graphs

Abstract

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.