Archived
This content is available here strictly for research, reference, and/or recordkeeping and as such it may not be fully accessible. If you work or study at University of Kentucky and would like to request an accessible version, please use the SensusAccess Document Converter.
Date Available
12-7-2018
Year of Publication
2018
Document Type
Master's Thesis
Degree Name
Master of Science (MS)
College
Engineering
Department/School/Program
Computer Science
Faculty
Dr. Jerzy W. Jaromczyk
Faculty
Dr. Mirek Truszczynski
Abstract
We consider a class of problems characterized by the need for a string based identifier that reflect the ontology of the application domain. We present rules for string-based identifier schemas that facilitate fast filtering in databases used for this class of problems. We provide runtime analysis of our schema and experimentally compare it with another solution. We also discuss performance in our solution to a game engine. The string-based identifier schema can be used in addition scenarios such as cloud computing. An identifier schema adds metadata about an element. So the solution hinges on additional memory but as long as queries operate only on the included metadata there is no need to load the element from disk which leads to huge performance gains.
Digital Object Identifier (DOI)
https://doi.org/10.13023/etd.2018.488
Recommended Citation
Toney, Ethan, "Improving Table Scans for Trie Indexed Databases" (2018). Theses and Dissertations--Computer Science. 76.
https://uknowledge.uky.edu/cs_etds/76
