Abstract
dc:description.abstractThe amount of String data around the world is constantly growing. As more of it accumulates, methods to search through it, and at higher capacities needs to be continually improved. This thesis analyzes string searching solutions that: support dynamic updates, support prefix searching, and can perform well using external memory. These solutions are compared against each other using different types of string data while performing various operations. The strengths and weaknesses of each solution is then identified and discussed.
Degree
thesis:*- Name thesis:degree_name
- Master of Computer Science (M.C.S.)
- Level thesis:degree_level
- Master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- Carleton University
- Year dc:date.issued
- 2016
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fraser, Cory
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright © 2016 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Language dc:language.iso
- en