A master thesis from Aalborg University
SpiderLink: a Keyword Search Algorithm
Author(s)
Term
10. Term
Education
Publication year
2003
Submitted on
2012-02-14
Abstract
The increasing need for a keyword-based search systems on relational data-bases motivated us to develop the SpiderLink search engine. It uses a k-tree data structure to find the connections between given keywords. As a result SpiderLink returns the sequences of tuples relating the tuples where keywords were found. In paper we first define a k-tree data structure. It has several important properties: i) it works on hierarchical, parallel and single relationships in a database; ii) it is minimal; iii) it is finite; iv) it can be implemented as a hash-table allowing to use it most efficiently. Later we present the SpiderLink search algorithm and diagram in the example how it actually works. We have implemented SpiderLink and it is a fully developed keyword search engine. The tests done on the databases support all our theoretical assumptions.
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.