Show simple item record

dc.contributor.authorVeraskouski, Aleh 15:25:46 (GMT) 15:25:46 (GMT)
dc.description.abstractKeyword queries are extremely easy for a user to write. They have become a standard way to query for information in web search engines and most other information retrieval systems whose users are usually laypersons and might not have knowledge about the database schema or contained data. As keyword queries do not impose any structural constraints on the retrieved information, the quality of the obtained results is far from perfect. However, one can hardly improve it without changing the ways the queries are asked and the methods the information is stored in the database. The purpose of this thesis is to propose a method to improve the quality of the information retrieving by adding weights to the existing ways of keyword queries asking and information storing in the database. We consider weighted queries on two different data structures: weighted binary relations and weighted multi-labeled trees. We propose adaptive algorithms to solve these queries and prove the measures of the complexity of these algorithms in terms of the high-level operations. We describe how these algorithms can be implemented and derive the upper bounds on their complexity in two specific models of computations: the comparison model and the word-RAM model.en
dc.format.extent565666 bytes
dc.publisherUniversity of Waterlooen
dc.subjectadaptive algorithmsen
dc.subjectkeyword queriesen
dc.subjectbinary relationsen
dc.subjectlabeled treesen
dc.subjectthreshold seten
dc.subjectpertinent seten
dc.subjectnon-increasing path subseten
dc.titleAdaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Treesen
dc.typeMaster Thesisen
dc.subject.programComputer Scienceen of Computer Scienceen
uws-etd.degreeMaster of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages