<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-22T08:41:56Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/2640" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/2640</identifier><datestamp>2026-05-14T13:52:43Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Crainiceanu, Adina</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-02-08T13:52:12Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-02-08T13:52:12Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2006-02-08T13:52:12Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/2640</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476058</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Peer-to-peer (P2P) systems provide a robust, scalable and&#xd;
decentralized way to share and publish data. However, most existing&#xd;
P2P systems only support equality or keyword search queries. We&#xd;
believe that future P2P applications, such as digital libraries,&#xd;
resource discovery on a grid, or military applications, will require&#xd;
more complex query functionality, as users will publish semantically&#xd;
rich data.&#xd;
&#xd;
Towards the goal of supporting complex queries in P2P systems, this&#xd;
dissertation focuses on developing index structures that allow fast&#xd;
access to distributed data. We introduce first a general modular&#xd;
indexing framework that identifies and separates the different&#xd;
functional components of a P2P index structure. One of the benefits&#xd;
of such a framework is that it allows \eat{tailoring the index&#xd;
structure to the needs of the different applications, with different&#xd;
requirements. Another benefit is that it allows }reusing the&#xd;
existing algorithms for different components rather than&#xd;
implementing everything anew. We can thus concentrate on creating&#xd;
algorithms that provide new functionality.&#xd;
&#xd;
We introduce P-Tree, a distributed fault-tolerant index structure.&#xd;
P-Trees support range queries in addition to equality queries in P2P&#xd;
systems in which each user (peer) publishes a small number of data&#xd;
items. We describe algorithms to maintain a P-Tree under insertions&#xd;
and deletions of data items/peers, and evaluate its performance&#xd;
using both a simulation and a real distributed implementation. Our&#xd;
results show the efficacy of our approach.&#xd;
&#xd;
We introduce then P-Ring, a novel index structure based on our&#xd;
framework, that supports both equality and range queries, is&#xd;
fault-tolerant, efficiently supports large sets of data items per&#xd;
peer (as opposed to P-Tree), and provides guaranteed logarithmic&#xd;
search performance in a stable system.&#xd;
&#xd;
In a thorough Wide Area Network experimental study we evaluate the&#xd;
performance of P-Ring and \eat{ we quantify the performance&#xd;
trade-offs of the different system components. We also }compare&#xd;
P-Ring with three other P2P index structures, Chord, Skip Graphs,&#xd;
and Online Balancing, implemented in the context of our indexing&#xd;
framework. Our performance results indicate that P-Ring outperforms&#xd;
Skip Graphs in terms of both query and maintenance cost. P-Ring&#xd;
offers a better load balance than Online Balancing, at a lower cost.&#xd;
P-Ring outperforms Chord in terms of search performance and supports&#xd;
a larger class of queries, with a low overhead.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">714404 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">peer-to-peer systems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">range index</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">databases</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">complex queries</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Answering Complex Queries in Peer-to-Peer Systems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Crainiceanu, Adina</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="d9c32022-051f-4301-b323-cec5d3830ede">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Answering Complex Queries in Peer-to-Peer Systems&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2006-02-08T13:52:12Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Crainiceanu, Adina&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>peer-to-peer systems&lt;/Keyword>
    &lt;Keyword>range index&lt;/Keyword>
    &lt;Keyword>databases&lt;/Keyword>
    &lt;Keyword>complex queries&lt;/Keyword>
   	&lt;Abstract>Peer-to-peer (P2P) systems provide a robust, scalable and&#xd;
decentralized way to share and publish data. However, most existing&#xd;
P2P systems only support equality or keyword search queries. We&#xd;
believe that future P2P applications, such as digital libraries,&#xd;
resource discovery on a grid, or military applications, will require&#xd;
more complex query functionality, as users will publish semantically&#xd;
rich data.&#xd;
&#xd;
Towards the goal of supporting complex queries in P2P systems, this&#xd;
dissertation focuses on developing index structures that allow fast&#xd;
access to distributed data. We introduce first a general modular&#xd;
indexing framework that identifies and separates the different&#xd;
functional components of a P2P index structure. One of the benefits&#xd;
of such a framework is that it allows \eat{tailoring the index&#xd;
structure to the needs of the different applications, with different&#xd;
requirements. Another benefit is that it allows }reusing the&#xd;
existing algorithms for different components rather than&#xd;
implementing everything anew. We can thus concentrate on creating&#xd;
algorithms that provide new functionality.&#xd;
&#xd;
We introduce P-Tree, a distributed fault-tolerant index structure.&#xd;
P-Trees support range queries in addition to equality queries in P2P&#xd;
systems in which each user (peer) publishes a small number of data&#xd;
items. We describe algorithms to maintain a P-Tree under insertions&#xd;
and deletions of data items/peers, and evaluate its performance&#xd;
using both a simulation and a real distributed implementation. Our&#xd;
results show the efficacy of our approach.&#xd;
&#xd;
We introduce then P-Ring, a novel index structure based on our&#xd;
framework, that supports both equality and range queries, is&#xd;
fault-tolerant, efficiently supports large sets of data items per&#xd;
peer (as opposed to P-Tree), and provides guaranteed logarithmic&#xd;
search performance in a stable system.&#xd;
&#xd;
In a thorough Wide Area Network experimental study we evaluate the&#xd;
performance of P-Ring and \eat{ we quantify the performance&#xd;
trade-offs of the different system components. We also }compare&#xd;
P-Ring with three other P2P index structures, Chord, Skip Graphs,&#xd;
and Online Balancing, implemented in the context of our indexing&#xd;
framework. Our performance results indicate that P-Ring outperforms&#xd;
Skip Graphs in terms of both query and maintenance cost. P-Ring&#xd;
offers a better load balance than Online Balancing, at a lower cost.&#xd;
P-Ring outperforms Chord in terms of search performance and supports&#xd;
a larger class of queries, with a low overhead.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>