ZXzX41ZdbW·Sep 4, 2023
Or Cache Oblivious Lookahead Arrays which considered to be an alternative to MergeTree (LSM), but not used anymore: https://github.com/giannitedesco/cola
In Cola: A text CRDT for real-time collaborative editinggiannitedesco
cola
C2020–2023
giannitedesco / cola
cola
Cache Oblivious Lookahead Arrays
2Distinct people
2Mentions
0Explicit recommenders
27GitHub stars
What to know before exploring
What it is
Cache Oblivious Lookahead Arrays
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by year2 dated mentions
Observed mentions: 2020-04-28 20:49:33 UTC to 2023-09-04 02:44:33 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| 2020 | 2020-01-01 00:00:00 UTC | 2021-01-01 00:00:00 UTC | 1 | 0 | 1 |
| 2021 | 2021-01-01 00:00:00 UTC | 2022-01-01 00:00:00 UTC | 0 | 0 | 0 |
| 2022 | 2022-01-01 00:00:00 UTC | 2023-01-01 00:00:00 UTC | 0 | 0 | 0 |
| 2023 | 2023-01-01 00:00:00 UTC | 2024-01-01 00:00:00 UTC | 1 | 0 | 1 |
What Hacker News says
2 sourcesYou can split a collection of 2^(k-1)<=N<2^k elements into up to k arrays with length 2^i. Insertion into empty array with one element capacity is easy, insertion into array with single element creates an array with two elements. If you already have an array of two elements, you should merge these elements into array of 4 elements.
The merge operation is fast and cache oblivious. Thus, insertion into a set of these arrays is fast.
Query is not so fast - O(log^2N). But I can direct you to Cache-Oblivious Lookahead Arrays (COLA) paper where a technique to get back to O(logN) complexity for lookup is described.
Or you can simple merge these arrays into one at the bulk insertion end.
Source code (not mine): https://github.com/giannitedesco/cola
In Let’s Invent B(+)-Trees