mirror of
https://github.com/dolthub/dolt.git
synced 2026-02-05 18:58:58 -06:00
update spacing
This commit is contained in:
@@ -27,16 +27,13 @@ initial support for a GraphQL-based query language.
|
||||
|
||||
Some additional features include:
|
||||
* Versioning: noms is git-like, so it’s easy to use, compare, or revert to older database versions
|
||||
|
||||
* Efficient diffs: diffing even huge datasets is efficient due to
|
||||
noms’ use of a novel BTree-like data structure called a [Prolly
|
||||
Tree](../intro.md#prolly-trees-probabilistic-b-trees)
|
||||
|
||||
* Efficient storage: data are chunked and content-addressable, so
|
||||
there is exactly one copy of each chunk in the database, shared by
|
||||
other data that reference it. Small changes to massive data
|
||||
structures always result in small operations.
|
||||
|
||||
* Verifiable: The entire database rolls up to a single 20-byte hash
|
||||
that uniquely represents the database at that moment - anyone can
|
||||
verify that a particular database hashes to the same value
|
||||
|
||||
Reference in New Issue
Block a user