Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
andytwigg
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
andytwigg
11y ago
What is the advantage of an order preserving encryption scheme over choosing an arbitrary mapping for each data column and applying that to the data?
2.
▲
by
andytwigg
15y ago
I've read most of the messages on this list with interest. I've done some benchmarking on LevelDB with billions of entries, and on commodity flash SSDs, and thought that summarising it might be of interest to folks on this list: http://www
3.
▲
Acunu's Storage Core is now open source
(acunu.com)
2 points
by
andytwigg
15y ago
|
0 comments
4.
▲
by
andytwigg
15y ago
Hi all, Acunu ( http://www.acunu.com/jobs ) will be here - if you're interested in algorithms and file systems or just a great hacker, come and find us! Say hello at jobs@acunu.com
5.
▲
by
andytwigg
15y ago
The OCaml implementation is what we use internally to test implementations of complicated new data structures, and as such, it's quite unreadable to anyone else! We will probably talk at CUFP about our experiences of OCaml. It definitely ha
6.
▲
by
andytwigg
15y ago
The core kernel code will be released in the next few weeks, along with a community site, probably code.acunu.com. We hope to post an announcement when that happens.
7.
▲
by
andytwigg
15y ago
Slides from a recent talk http://www.acunu.com/2011/04/algorithms-at-cassandra-meetup/
8.
▲
by
andytwigg
15y ago
SSDs are typically great at random reads, but not so good at random writes, particularly when you start rewriting the device (see http://www.acunu.com/2011/04/log-file-systems-and-ssds-made-... ). The attraction of append-only structures i
9.
▲
by
andytwigg
15y ago
In general, I agree - as you'd expect, practical implementations of this structure will naturally deviate quite far from the paper's presentation, and indeed we do make many optimizations for SSDs and rotating disks. But, in theory, disk vs
10.
▲
by
andytwigg
15y ago
Thanks for that. The second paper you reference contains more details of the data structure. I have submitted an updated version of the second paper - it will probably appear on arxiv in 2 days. We have a much improved version of it, though