Search and Navigation in Relational Databases
Richard Wheeldon, Mark Levene, Kevin Keenoy
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.
Create a lesson
Related papers
Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Oktie Hassanzadeh, Dharmashankar Subramanian
ProvQML: Efficient Provenance Capture for Machine Learning as Recursive Aggregate SQL [Extended Version]
Nkechi J. Akinwale, Seokki Lee
Benchmarking Content-Defined Chunking Algorithms for Data Deduplication
Marcel Gregoriadis, Leonhard Balduf, Björn Scheuermann et al.
Time-Varying Favorite-Longshot Bias in Polymarket Weather Markets
Shouchen Qiu, Huaijun Qiu
MatQuery: Execution-Grounded Natural-Language Querying over Heterogeneous Materials Databases
Chen Jason Zhang, Qi Chen
CALQA: Conformal Screening of Forecast-Ensemble Configurations from One Mergeable State
Xiufeng Liu, Ruyu Liu, Yusen Liu et al.