<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T20:41:17Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5724" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5724</identifier><datestamp>2017-03-21T17:19:19Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="919bf84e-ef04-4d54-b75b-a7786f4a53bc" confidence="600">Soliman, Mohamed</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2011-01-17T21:35:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2011-01-17T21:35:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2011-01-17T21:35:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2011</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5724</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Ranking queries are widely used in data exploration, data analysis and decision &#xd;
making scenarios. While most of the currently proposed ranking techniques focus &#xd;
on deterministic data, several emerging applications involve data that are imprecise &#xd;
or uncertain. Ranking uncertain data raises new challenges in query semantics and &#xd;
processing, making conventional methods inapplicable. Furthermore, the interplay &#xd;
between ranking and uncertainty models introduces new dimensions for ordering query &#xd;
results that do not exist in the traditional settings. &#xd;
&#xd;
This dissertation introduces new formulations and processing techniques for ranking queries on uncertain data. The formulations are based on marriage of traditional ranking semantics with possible worlds semantics under widely-adopted uncertainty models. In particular, we focus on studying the impact of tuple-level and attribute-level uncertainty on the semantics and processing techniques of ranking queries. &#xd;
&#xd;
Under the tuple-level uncertainty model, we introduce a processing framework leveraging the capabilities of relational database systems to recognize and handle data &#xd;
uncertainty in score-based ranking. The framework encapsulates a state space model, &#xd;
and efficient search algorithms that compute query answers by lazily materializing the &#xd;
necessary parts of the space. Under the attribute-level uncertainty model, we give a new probabilistic ranking model, based on partial orders, to encapsulate the space of possible rankings originating from uncertainty in attribute values. We present a set of efficient query evaluation algorithms, including sampling-based techniques based on the theory of Markov chains and Monte-Carlo method, to compute query answers.&#xd;
&#xd;
We build on our techniques for ranking under attribute-level uncertainty to support &#xd;
rank join queries on uncertain data. We show how to extend current rank join methods &#xd;
to handle uncertainty in scoring attributes. We provide a pipelined query operator &#xd;
implementation of uncertainty-aware rank join algorithm integrated with sampling &#xd;
techniques to compute query answers.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Ranking</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Uncertainty</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Probabilistic Models</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Query Processing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Top-k</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Partial Order</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Ranked Retrieval in Uncertain and Probabilistic Databases</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">The thesis includes published work in academic conferences and journals that authorize the use of published material in author&amp;apos;s thesis.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>