Settings

Theme

DoltLab v0.2.0

dolthub.com

41 points by mjangle1985 4 years ago · 16 comments

Reader

sverhagen 4 years ago

Inspired by... but admittedly off-topic... I had recently been wondering how people keep a full auditable history of their data. I've used Hibernate Envers in the past or the now seemingly-defunct Temporal Tables extension for PostgreSQL. What are people using these days? Is DoltLab it, or are there more common solutions?

vorpalhex 4 years ago

This is actually a really cool idea, and while I would have avoided it due to it's SAAS nature, now I'm actually pretty willing to try it.

caffeine 4 years ago

I can’t figure out if this is a real product or a joke site? The name is confusing.

If it’s a real product it’s cool, I’ve wanted something like this for a while (currently I just use git repos full of JSON files but this would be better I think).

  • zachmu 4 years ago

    Yup, it's a real product :)

    If you want experiment quickly and aren't squeamish about putting your data on the internet, DoltHub is easier to get started with. DoltLab is just a (limited) self-hosted version of DoltHub.

richardbarosky 4 years ago

Nice. While I haven't used Dolt, I've definitely enjoyed reading the blog, sepecially the MySQL compatability stuff and some of the other fun ones (like the alcohol dispenser project). Good luck guys!

smoyer 4 years ago

Maybe it's a regional slur here in the U.S. but I'm wondering where the name originated.

parentheses 4 years ago

So many questions about the git-like semantics.

- how are shas created?

- assuming you hash the entire diff, can columns be ignored? e.g. timestamps or other "unimportant" data

- do any two insertions into a table "conflict"?

  • reltuk 4 years ago

    To quickly answer these...

    - it's content addresses / merkle DAG all the way down. The commit's hash is something like meta (author, description, timestamp) + parents hash + root value hash. The root value is composed of the schema, and pointers to table and index maps. Tables and indexes are merkle DAGs of the table data organized in a structure a bit like a B-tree, but with cut points chosen by a rolling value hash in order to probabilistically re-synchronize on incremental changes. Some details: https://www.dolthub.com/blog/2020-04-01-how-dolt-stores-tabl... , https://www.dolthub.com/blog/2020-05-13-dolt-commit-graph-an...

    - currently table data is stored row major for full rows of the table and so diffing cannot efficiently ignore individual columns.

    - direct conflicts are computed on a row-by-row basis, using the primary key of the row. And then constraints and foreign key references are maintained and validated across merges and edits.

    HTH, happy to answer any further questions :).

hestefisk 4 years ago

Looks interesting. It’s like Git, ZFS, and MySQL all in one?

Keyboard Shortcuts

j
Next item
k
Previous item
o / Enter
Open selected item
?
Show this help
Esc
Close modal / clear selection