Towards a concurrent implementation of keyword search over relational databases.

Vast amounts of data are stored in relational databases. Traditionally, querying this data required a deep understanding of the underlying schema in addition to knowledge of a query language such as structured query language (SQL). We present a framework for the automatic, lossless transformation of data from the relational model to the document model. By performing this transformation, users may locate information by using simple keyword queries. We further this by implementing graph search, allowing users to automatically discover related facts of information. The effects of performing graph search concurrently are explored, revealing a substantial reduction in graph search run-time over the serial implementation.

Name thesis:degree_name

Master of Science (MSc)

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Ontario Institute of Technology

Year dc:date.issued

2014

Author dc:creator

• Drake, Richard J.I.

Advisor dc:contributor.advisor

• Pu, Ken

• Relational database
• Full-text search
• Graph search
• Algorithms

Language dc:language.iso

en

Handle dc:identifier.uri

https://hdl.handle.net/10155/433

OAI identifier oai:identifier

oai:ontariotechu.scholaris.ca:10155/433