InfoQ Homepage Riak Content on InfoQ
Articles
RSS Feed-
/articles/dynamo-riak-random-slicing/en/smallimage/dynamo-riak-random-slicing-018-1535144122758.jpg)
A Critique of Resizable Hash Tables: Riak Core & Random Slicing
This fall, Wallaroo Labs will be releasing a large new feature set to our distributed data stream processing framework, Wallaroo. One of the new features requires a size-adjustable, distributed data structure to support growing & shrinking of compute clusters. It might be a good idea to use a distributed hash table to support the new feature, but what distributed hash algorithm should we choose?
-
/articles/virtual-panel-current-state-of-nosql-databases/en/smallimage/logo.jpg)
Virtual Panel: Current State of NoSQL Databases
NoSQL databases have been around for several years now and have become a choice of data storage for managing semi-structured and unstructured data. These databases offer lot of advantages in terms of linear scalability and better performance for both data writes and reads. InfoQ spoke with four panelists to get different perspectives on the current state of NoSQL databases.
-
/articles/key-lessons-learned-from-transition-to-nosql/en/smallimage/logo-nosql.jpg)
Key Lessons Learned from Transition to NoSQL at an Online Gambling Website
In this article, author Dan Macklin discusses the transition to Riak NoSQL and Erlang based architecture coupled with Convergent Replicated Data Types (CRDTs) and lessons learned with the transition.
-
/articles/Highly-Distributed-Computations-Without-Synchronization/en/smallimage/java-logo.jpg)
Highly Distributed Computations Without Synchronization
Synchronization of data across systems is expensive and impractical when running systems at scale. Traditional approaches for performing computations or information dissemination are not viable. In this article Basho Sr. Software Engineer Chris Meiklejohn explores the basic building blocks for crafting deterministic applications that guarantee convergence of data without synchronization.
-
/articles/jepsen/en/smallimage/logo (4).jpg)
Jepsen: Testing the Partition Tolerance of PostgreSQL, Redis, MongoDB and Riak
Distributed systems are characterized by exchanging state over high-latency or unreliable links. The system must be robust to both node and network failure if it is to operate reliably--however, not all systems satisfy the safety invariants we'd like. In this article, we'll explore some of the design considerations of distributed databases, and how they respond to network partitions.