Search and Navigation in Relational Databases

Simple item page
dc.creatorWheeldon, Richard
dc.creatorLevene, Mark
dc.creatorKeenoy, Kevin
dc.date2003-07-31
dc.date.accessioned2026-07-07T03:20:10Z
dc.date.available2026-07-07T03:20:10Z
dc.descriptionWe 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.
dc.description12 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/cs/0307073
dc.identifierhttp://arxiv.org/abs/cs/0307073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31732
dc.subjectDatabases
dc.subjectH.3;H.4;H.5
dc.titleSearch and Navigation in Relational Databases
dc.typetext

Files

Collections

arXiv