<?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-22T16:55:07Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/21799" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/21799</identifier><datestamp>2025-11-06T08:09:48Z</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">Alquraan, Ahmed</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-05-27T14:49:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-05-27T14:49:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2025-05-27</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2025-05-26</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10012/21799</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Distributed in-memory storage systems play a critical role in supporting modern applications and meeting their performance, reliability, and scalability requirements. Current in-memory storage systems adopt three design decisions that limit their performance and efficiency. First, these systems rely on the write-ahead log to guarantee data consistency and tolerate failures. The write-ahead log enforces a strict sequential ordering on operations that is often unnecessary for many applications, introducing a performance bottleneck. Second, these systems are designed for traditional, server-centric hardware, overlooking potential design optimization of emerging hardware capabilities and rendering them incompatible with the recently proposed hardware-disaggregated architecture. Third, their disaster recovery mechanisms are designed under the assumption of complete time asynchrony across machines, resulting in either a large data loss window or a significant performance overhead. This thesis explores a fundamentally different design space for building high-performance, replicated in-memory storage systems.

First, to address the inefficiency of the write-ahead log, this thesis explores a novel system design that forgoes the write-ahead log and builds the Logless, Linearizable Key-Value storage system (LoLKV). By removing the log, LoLKV eliminates the serialization bottleneck and unnecessary memory copy operations, achieving a higher level of concurrency and improving resource utilization. LoLKV relies on one-sided RDMA to efficiently replicate data. Evaluation results demonstrate that LoLKV achieves 1.7–10× higher throughput and 20–92% lower tail latency compared to state-of-the-art RDMA-based systems.

Second, to address the performance challenges of current storage systems on the hardware-disaggregated architecture, I propose SplitKV, a low-latency linearizable key-value store designed for the hardware-disaggregated architecture. SplitKV leverages one-sided RDMA for communication with memory nodes, ensuring that memory nodes remain completely passive. SplitKV co-designs the replication protocol with the data structures of the system to minimize the number of RDMA operations required to process client requests. Evaluation results show that SplitKV achieves 2.6–21× higher throughput and 80–89% lower latency compared to Sift, the state-of-the-art disaggregated key-value store.

Finally, to address the shortcomings of current disaster recovery mechanisms, I leverage modern data center time synchronization hardware and protocols to build Slogger, a new disaster recovery system. Slogger achieves near-zero data loss and guarantees prefix linearizability at the backup site. Slogger uses continuous asynchronous replication to minimize the overhead on the system. Slogger employs a watermark service to guarantee the linearizability of the backup site while avoiding across-shard coordination. Evaluation experiments show that Slogger reduces the data loss window by 50% compared to the incremental snapshotting approach.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject">key-value stores</dim:field>
   <dim:field mdschema="dc" element="subject">consensus</dim:field>
   <dim:field mdschema="dc" element="subject">storage systems</dim:field>
   <dim:field mdschema="dc" element="subject">RDMA</dim:field>
   <dim:field mdschema="dc" element="subject">disaster recovery</dim:field>
   <dim:field mdschema="dc" element="subject">hardware disaggregation</dim:field>
   <dim:field mdschema="dc" element="subject">strong consistency</dim:field>
   <dim:field mdschema="dc" element="title">Leveraging Emerging Data Center Technologies to Build High-Performance Data Stores</dim:field>
   <dim:field mdschema="dc" element="type">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Al-Kiswany, Samer</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>