ryanworl

20 ms·

181.
by ryanworl 8y ago
Just sent you an email
182.
by ryanworl 8y ago
How are you doing route planning and optimization? I would suggest two hour delivery windows unless you have massive density. Trust me :) (I spent almost two years of my life doing this thing except for food & laundry, not seltzer)
183.
by ryanworl 8y ago
Clickhouse is designed for full table scans. It allows one index per table, usually a compound key including the date as the leftmost part of the key. This allows it to eliminate blocks of data that don’t contain relevant time ranges. It is
184.
by ryanworl 8y ago
Yes, creating an adjacency list graph model would be straight forward. The most important thing is to keep as many operations in flight as possible, as the graph model is essentially a lot of distributed pointer chasing. If you’re intereste
185.
by ryanworl 8y ago
I’m the speaker from the “Solving Everyday Data Problems with FoundationDB” talk! Happy to answer any questions about my talk, the conference, or FoundationDB in general.
186.
Autonomous Testing and the Future of Software Development – Will Wilson(youtube.com)
5 points by ryanworl 8y ago|0 comments
187.
Technical Overview of FoundationDB – Evan Tschannen(youtube.com)
11 points by ryanworl 8y ago|0 comments
188.
Partitioned consensus and its impact on Spanner’s latency(dbmsmusings.blogspot.com)
50 points by ryanworl 8y ago|11 comments
189.
by ryanworl 8y ago
Not dealing with ads and being able to play videos in the background on iOS are the two reasons I pay for YouTube. If I were no longer able to do that my YouTube consumption would drop dramatically.
190.
by ryanworl 8y ago
Yes, the layered approach will always consume more bandwidth unless you just happen to hit the case where your transaction is read-only and the layer process is colocated with the storage server where your data is. The upsides far outweigh
191.
by ryanworl 8y ago
I'm still not sure what you mean in terms of contrasting this with DynamoDB's new features. You could implement the entire DynamoDB API, with even stronger semantics than the new features listed in the article, on top of Foundatio
192.
by ryanworl 8y ago
What do you mean by this? There is only one “database” in FoundationDB terms. You can write transactions over the entire keyspace regardless of which machine the data is stored on.
193.
by ryanworl 8y ago
“DynamoDB is the only non-relational database that supports transactions across multiple partitions and tables.” Uh... this is just not true.
194.
by ryanworl 8y ago
FoundationDB single-core performance is fine. From my testing on the memory engine (and the docs), you can expect 70k+ reads/second/core for small keys and values. But crucially this means you must have concurrency to drive thro
195.
by ryanworl 8y ago
Yes, I think is fairly well known in the optimistic family of concurrency control algorithms you can get into situations where aborts are not necessary. https://db.cs.cmu.edu/papers/2016/yu-sigmod2016.pdf Section
196.
by ryanworl 8y ago
FoundationDB and Spanner both offer external consistency. Spanner does this through synchronized clocks. FoundationDB has a similar clock called TimeKeeper, which is not a clock per se but a counter which advances approximately 1M times per
197.
by ryanworl 8y ago
Those first two are pretty trivial. Keys are already stored in sorted order in a b-tree. Secondary indexing involves putting the indexed value to the left of the primary key in the key you write.
198.
by ryanworl 8y ago
There are two reasons for this I can see: 1) All mutations and key ranges are stored locally and submitted when the transaction commits. Lots of data to transfer. 2) the optimistic conflict checker can process one range (even if it is a lot
199.
by ryanworl 8y ago
Reading a million individual keys would be quite rare I would guess, but that isn’t really the issue for a large range. The keys at the start and the end of the range are what’s counted in that case. So if you read the range A-Z, the size i
200.
by ryanworl 8y ago
Regarding your first comment, the reason I’m listed as a contributor for this release is I made a change to the documentation about large range reads. Basically, value sizes are not included in the 10mb limit for reads.
201.
by ryanworl 8y ago
Could you give an example of what you mean? This is very relevant for my talk.
202.
by ryanworl 8y ago
FoundationDB exposes extremely detailed XML logs, as well as providing a status key you can scrape (\xff\xff/status/json) which exposes high level metrics about the entire cluster, including health, disk space, transaction rate, c
203.
by ryanworl 8y ago
To anyone who is on the fence about putting FoundationDB into production (or at least evaluating it for their use cases), what is the number one thing you think is missing or you're worried about? i.e. - a SQL interface, - pre-packaged
204.
Wrangling FoundationDB: Zero Downtime OS Upgrades(medium.com)
2 points by ryanworl 8y ago|0 comments
205.
by ryanworl 8y ago
https://www.amazon.com/Database-Management-Systems-Raghu-Ram...
206.
by ryanworl 8y ago
How do you manage statistics in the system catalog in CockroachDB?
207.
by ryanworl 8y ago
Did you use the cache-line flush instructions directly or use some higher-level package from the PMDK for adding byte-addressable NVM support to LMDB?
208.
by ryanworl 8y ago
The concept in databases that you’re looking for is called group commit. Transactions running concurrently batch writes together before flushing to disk. This means the minimum latency for committing a transaction is the speed of fsync, but
209.
by ryanworl 8y ago
MemSQL is an "HTAP" (hybrid transactional-analytical processing) database. They have an in-memory row store table engine for the transactional queries and a disk-backed column store table engine for the analytical queries.
210.
by ryanworl 8y ago
Not the person you’re responding to, but you can merge HLLs together, so if your workload was skewed, you could hash the value you’re adding to the HLL and distribute it among more keys in FoundationDB. Additionally, depending on the write

More ›