2003/07/31 by Richard Wheeldon, Mark Levene, Wheeldon, Richard +3
Computer Science · #Databases (cs.DB) #FOS: Computer and information sciences #H.3 #H.4 #H.5 #cs.DB
paper · pdf · doi:10.48550/arxiv.cs/0307073
12 pages, 7 figures
arxiv created 2003/07/31 · arxiv updated 2009/12/01
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.