Towards a concurrent implementation of keyword search over relational databases.

dc.contributor.advisor	Pu, Ken
dc.contributor.author	Drake, Richard J.I.
dc.date.accessioned	2014-08-07T19:25:57Z
dc.date.accessioned	2022-03-30T17:05:44Z
dc.date.available	2014-08-07T19:25:57Z
dc.date.available	2022-03-30T17:05:44Z
dc.date.issued	2014-06-01
dc.identifier.uri	https://hdl.handle.net/10155/433
dc.description.abstract	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.	en
dc.description.sponsorship	University of Ontario Institute of Technology	en
dc.language.iso	en	en
dc.subject	Relational database	en
dc.subject	Full-text search	en
dc.subject	Graph search	en
dc.subject	Algorithms	en
dc.title	Towards a concurrent implementation of keyword search over relational databases.	en
dc.type	Thesis	en
dc.degree.level	Master of Science (MSc)	en
dc.degree.discipline	Computer Science	en