Crates.io | unbase |
lib.rs | unbase |
version | 0.0.2 |
source | src |
created_at | 2017-03-13 21:32:17.367101 |
updated_at | 2018-01-17 07:05:17.460555 |
description | Unbase intends to be a causal, coordination-free distributed data-persistence and application framework. It is fundamentally reactive, fault tolerant, and decentralized. |
homepage | https://unba.se |
repository | https://github.com/unbase/unbase |
max_upload_size | |
id | 8965 |
size | 290,613 |
Unbase is a concept for a distributed database/application framework that is fundamentally reactive, fault tolerant, and decentralized. It seeks to address some very specific shortcomings in traditional paradigms; to create a distributed architecture that transcends device, geography, programming language, and present orthodoxy about what constitutes a "database". It seeks to blur the lines between application/database, and client/server.
We believe that for many use cases, data (or computation thereof) should not be assigned to any specific storage location (as is the case in "sharded" systems) but rather it should be stored close its origin, and its consumers. Data should not be "based"1 anywhere, thus the name Unbase.
Unbase is presently under active development.
See Design Goals for more details
Unbase seeks to implement a specific causal consistency model which we are calling "Infectious Knowledge". See Consistency Model for more details
1: When data storage locality is determined by an algorithm which fails to consider the points in space where the data is originated or observed, the requester must wait longer for its retrieval. We can think of light cones{:target="define"} as a good approximation of our upper-bound.
2: Using the term "partition" for conversational understanding. Partitions are not actually a thing.
3: We believe there should be no difference between "client" and "server" except for computational/storage/network capacity and policy.