<?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-22T09:53:20Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/59322" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/59322</identifier><datestamp>2026-05-15T19:46:42Z</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">Dubey, Ayush</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Sirer, Emin G.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Kleinberg, Jon M.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Foster, John N.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-10-23T13:21:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-10-23T13:21:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-05-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 10733</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 10747175</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/59322</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/X46W989V</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">10489406</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">This dissertation describes techniques to store and process large graphs in modern datacenters with high performance and strong consistency guarantees.  Graph-structured data is ubiquitous: social networks, content networks, cryptocurrency transaction histories, and business analytics routinely store and manipulate large graphs.  For reasons of scale, both in terms of data size as well as workload volume, it is necessary to store such large graphs in a distributed fashion.  Moreover, graph workloads have unique characteristics, such as long running read queries interspersed with shorter updates, that naturally lead to a programming interface consisting of a hybrid of transactions and analytics.  Providing efficient and consistent access to graph-structured data is a significant challenge. This dissertation makes three contributions.  First, it describes a novel technique to order distributed transactions by introducing the concept of an ordering service.  An ordering service seeks to simplify the design of modern distributed systems by factoring out the task of ordering from the core system into a separate service.  Second, it details techniques that scale up the performance of a centralized ordering service by combining it with a lightweight timestamping mechanism.  Third, it describes a full implementation of Weaver, a new distributed, transactional graph store that includes mechanisms for practical and efficient graph data management, such as dynamic resharding of graph partitions and caching of query results.  Overall, these techniques lead to a scalable and consistent graph store that is capable of supporting modern distributed applications with high performance.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject">graphs</dim:field>
   <dim:field mdschema="dc" element="subject">Distributed systems</dim:field>
   <dim:field mdschema="dc" element="subject">Computer science</dim:field>
   <dim:field mdschema="dc" element="subject">databases</dim:field>
   <dim:field mdschema="dc" element="title">On Consistent and Efficient Graph Data Management</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Computer Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</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">Dubey, Ayush</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="5fa4fae2-1601-431b-9766-178f2dd9ddde">
	&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>On Consistent and Efficient Graph Data Management&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2018-05-30&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/X46W989V&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Dubey, Ayush&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>graphs&lt;/Keyword>
    &lt;Keyword>Distributed systems&lt;/Keyword>
    &lt;Keyword>Computer science&lt;/Keyword>
    &lt;Keyword>databases&lt;/Keyword>
   	&lt;Abstract>This dissertation describes techniques to store and process large graphs in modern datacenters with high performance and strong consistency guarantees.  Graph-structured data is ubiquitous: social networks, content networks, cryptocurrency transaction histories, and business analytics routinely store and manipulate large graphs.  For reasons of scale, both in terms of data size as well as workload volume, it is necessary to store such large graphs in a distributed fashion.  Moreover, graph workloads have unique characteristics, such as long running read queries interspersed with shorter updates, that naturally lead to a programming interface consisting of a hybrid of transactions and analytics.  Providing efficient and consistent access to graph-structured data is a significant challenge. This dissertation makes three contributions.  First, it describes a novel technique to order distributed transactions by introducing the concept of an ordering service.  An ordering service seeks to simplify the design of modern distributed systems by factoring out the task of ordering from the core system into a separate service.  Second, it details techniques that scale up the performance of a centralized ordering service by combining it with a lightweight timestamping mechanism.  Third, it describes a full implementation of Weaver, a new distributed, transactional graph store that includes mechanisms for practical and efficient graph data management, such as dynamic resharding of graph partitions and caching of query results.  Overall, these techniques lead to a scalable and consistent graph store that is capable of supporting modern distributed applications with high performance.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>