Thursday, June 6, 2024

B-trees Require Fewer Comparisons Than Balanced Binary Search Trees

›
Due to better access locality, B-trees are faster than binary search trees in practice -- but are they also better in theory ? To answer th...
Monday, February 19, 2024

SSDs Have Become Ridiculously Fast, Except in the Cloud

›
In recent years, flash-based SSDs have largely replaced disks for most storage use cases. Internally, each SSD consists of many independent ...
21 comments:
Sunday, April 9, 2023

The Great CPU Stagnation

›
For at least five decades, Moore's law consistently delivered increasing numbers of transistors. Equally significant, Dennard scaling ...
7 comments:
Tuesday, February 7, 2023

Five Decades of Database Research

›
Since 1975, over 24 thousand articles have have been published in major database venues (SIGMOD, VLDB/PVLDB, ICDE, EDBT, CIDR, TODS, VLDB Jo...
Monday, January 23, 2023

For systems, research is development and development is research

›
The Conference on Innovative Data Systems Research (CIDR) 2023 is over, and as usual both the official program and the informal discussion...
1 comment:
Sunday, June 26, 2022

Making unwinding through JIT-ed code scalable - b-tree operations

›
This article is part of the series about scalable unwinding that starts here . Now that we have all infrastructure in place, we look at the ...

Making unwinding through JIT-ed code scalable - The b-tree

›
This article is part of the series about scalable unwinding that starts here . We use a  b-tree because it offers fast lookup, good data lo...