Journal ArticleDOI
Cassandra: a decentralized structured storage system
Avinash Lakshman,Prashant Malik +1 more
TLDR
Cassandra is a distributed storage system for managing very large amounts of structured data spread out across many commodity servers, while providing highly available service with no single point of failure.Abstract:
Cassandra is a distributed storage system for managing very large amounts of structured data spread out across many commodity servers, while providing highly available service with no single point of failure. Cassandra aims to run on top of an infrastructure of hundreds of nodes (possibly spread across different data centers). At this scale, small and large components fail continuously. The way Cassandra manages the persistent state in the face of these failures drives the reliability and scalability of the software systems relying on this service. While in many ways Cassandra resembles a database and shares many design and implementation strategies therewith, Cassandra does not support a full relational data model; instead, it provides clients with a simple data model that supports dynamic control over data layout and format. Cassandra system was designed to run on cheap commodity hardware and handle high write throughput while not sacrificing read efficiency.read more
Citations
More filters
Proceedings ArticleDOI
DottedDB: Anti-Entropy without Merkle Trees, Deletes without Tombstones
TL;DR: Results show that causality metadata per object always converges rapidly to only one id-counter pair; distributed deletes are correctly achieved without global coordination and with constant metadata; divergent nodes are synchronized faster, with less memory-footprint and with less communication overhead than using Merkle Trees.
Proceedings ArticleDOI
Adaptive State Consistency for Distributed ONOS Controllers
TL;DR: This paper proposes an adaptive consistency model for the distributed ONOS controllers following the notion of continuous and compulsory (per-controller) eventual consistency, where network application states adapt their eventual consistency level dynamically at runtime based on the observed state inconsistencies under changing network conditions.
Posted Content
Kollaps: Decentralized and Dynamic Topology Emulation.
Paulo Gouveia,João Neves,Carlos David Pérez Segarra,Luca Liechti,Shady Issa,Valerio Schiavoni,Miguel Matos +6 more
TL;DR: Kollaps is fully decentralized, agnostic of the application language and transport protocol, scales to thousands of processes and is accurate when compared against a bare-metal deployment or state-of-the-art approaches that emulate the full state of the network.
Journal ArticleDOI
Scalable computational geometry in MapReduce
TL;DR: CG_Hadoop is introduced; a suite of scalable and efficient MapReduce algorithms for various fundamental computational geometry operations, namely polygon union, Voronoi diagram, skyline, convex hull, farthest pair, and closest pair, which present a set of key components for other geometric algorithms.
Proceedings ArticleDOI
Semantic Data Querying over NoSQL Databases with Apache Spark
TL;DR: This paper presents techniques for distributed RDF data storage and querying schemes for HBase and Cassandra clusters and presents a compiler that translates SPARQL queries into their Spark SQL equivalent for execution.
References
More filters
Journal ArticleDOI
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
Journal ArticleDOI
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Journal ArticleDOI
The Google file system
TL;DR: This paper presents file system interface extensions designed to support distributed applications, discusses many aspects of the design, and reports measurements from both micro-benchmarks and real world use.
Proceedings Article
Bigtable: A Distributed Storage System for Structured Data (Awarded Best Paper!).
Fay W. Chang,Jeffrey Dean,Sanjay Ghemawat,Wilson C. Hsieh,Deborah A. Wallach,Michael Burrows,Tushar Deepak Chandra,Andrew Fikes,Robert Gruber +8 more
TL;DR: Bigtable as mentioned in this paper is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers, including web indexing, Google Earth and Google Finance.