5 ms·

It amazes me that HN users would spend time commenting here before taking a few seconds to navigate a website. Here is an overview of technical information: htt

It amazes me that HN users would spend time commenting here before taking a few seconds to navigate a website. Here is an overview of technical information: http://deep.is/knowledge/deepdb-white-paper/ http://deep.is/knowledge/deepdb-white-paper/ These are the interesting things that sticks out to me: The understanding that storage system throughput is maximized by using sequential access patterns led to the creation of streaming, append-only transactional and indexing algorithms. Our approach is unique in that all database files (i.e. transactional state, indexes, and metadata) are streamed, append-only files. ... The CASI Tree breaks from a traditional b-tree on-disk approach, eliminating update in-place operations on fixed size pages. Instead, the CASI Tree is an append-only Purely Functional Tree data structure. ... A complete database audit trail is maintained when running in archival mode, making all previous database states available. These states may be queried in read-only mode, efficiently supporting read-only analytics of point-in-time transactional database states

leif 13y ago
This links to the wrong fractal tree paper for discussing write-read optimized data structures. The proper one is http://supertech.csail.mit.edu/papers/sbtree.pdf http://supertech.csail.mit.edu/papers/sbtree.pdf This makes me wonder how much research this team really did. I'm not ready to claim they haven't done it, but it raises the question. I would like to see the actual data structure published somewhere.
bhangi 13y ago
Perhaps I am missing something, but color me skeptical... immutable on-disk structures essentially means that you have to perform run-time compactions on every query... unless your in-memory representation is the cache, in which case you have to worry about durability.
pweissbrod 13y ago
One of the things I was left puzzled with was how could one efficiently leverage a transaction log and data organization for querying all in the same file without memory mapping and have this perform well. Maybe the implementation they are using is part of DeepDb special sauce? Also it seems the company is very young and so many of the things other posters are expecting such as a large engineering team, feature matrixes and downloadable demos arent in place yet and will be soon
jgreen10 13y ago
Those sentences don't make any sense. This whole thing looks like it comes out of some kind of vaporware start-up generator.

leif 13y ago

This links to the wrong fractal tree paper for discussing write-read optimized data structures. The proper one is http://supertech.csail.mit.edu/papers/sbtree.pdf http://supertech.csail.mit.edu/papers/sbtree.pdf This makes me wonder how much research this team really did. I'm not ready to claim they haven't done it, but it raises the question. I would like to see the actual data structure published somewhere.

bhangi 13y ago

Perhaps I am missing something, but color me skeptical... immutable on-disk structures essentially means that you have to perform run-time compactions on every query... unless your in-memory representation is the cache, in which case you have to worry about durability.

pweissbrod 13y ago

One of the things I was left puzzled with was how could one efficiently leverage a transaction log and data organization for querying all in the same file without memory mapping and have this perform well. Maybe the implementation they are using is part of DeepDb special sauce? Also it seems the company is very young and so many of the things other posters are expecting such as a large engineering team, feature matrixes and downloadable demos arent in place yet and will be soon

jgreen10 13y ago

Those sentences don't make any sense. This whole thing looks like it comes out of some kind of vaporware start-up generator.