mirror/dolt

mirror of https://github.com/dolthub/dolt.git synced 2026-05-03 11:30:28 -05:00

Files

T

History

Rafael Weinstein a00a5f5611 Implement experimental block store (#2870 )

* Move NBS into Noms

* vendor in deps

2016-12-01 10:04:09 -08:00

..

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

block_store_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

compact_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

compact.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

file_manifest_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

file_manifest.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

mem_table_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

mem_table.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

mmap_table_reader_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

mmap_table_reader.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

README.md

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

root_tracker_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

store.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

table_manager.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

table_reader.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

table_test.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

table_writer.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

table.go

Implement experimental block store (#2870 )

2016-12-01 10:04:09 -08:00

README.md

Noms Block Store

An experimental storage layer for noms.

Provides storage for a content-addressed DAG of nodes (with exactly one root), where each node is encoded as a sequence of bytes and addressed by a 20-byte hash of the byte-sequence.
There is no update or delete, only insert, update root and garbage collect.
Insertion of any novel byte-sequence is durable only upon updating the root.
File-level multiprocess concurrency is supported, with optimistic locking for multiple writers.
Writers need not worry about re-writing duplicate chunks. NBS will efficiently detect and drop (most) duplicates.