Search and Navigation in Relational Databases

Computer Science – Databases

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 7 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Search and Navigation in Relational Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Search and Navigation in Relational Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search and Navigation in Relational Databases will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-333674

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.