Recent demands for storing and querying big data have revealed various shortcomings of
traditional relational database systems. This, in turn, has led to the emergence of a new kind …

This paper addresses the problem of category-level image classification. The underlying
image model is a graph whose nodes correspond to a dense set of regions, and edges …

In cloud computing, workloads that lease instances on demand get to execute exclusively for
a set time. In contrast, workloads that lease spot instances execute until a competing …

We tackle the problem of reducing tail latencies in distributed key-value stores, such as the
popular Cassandra database. We focus on workloads of multiget requests, which batch …

As a Distributed Hash Table (DHT), Skip Graph routing overlays are exploited in several
peer-to-peer (P2P) services, including P2P cloud storage. The fully decentralized replication …

To date, it has been difficult for modern geospatial software projects to take advantage of the
benefits provided by distributed computing frameworks due to the implicit challenges of …

Cloud storage systems typically choose between replicating or erasure encoding data to
provide fault tolerance. Replication ensures that data can be accessed from a single site but …

Internet services replicate data to geo-diverse sites around the world, often via consistent
hashing. Collectively, these sites span multiple power authorities that independently control …

Online data-intensive services parallelize query execution across distributed software
components. Interactive response time is a priority, so online query executions return …

The stateless cloud-native design improves the elasticity and reliability of applications
running in the cloud. The design decouples the life-cycle of application states from that of …