Takashi's Notes
Search
Search
Dark mode
Light mode
Explorer
Home
❯
papers
❯
data structures
Folder: papers/data-structures
43 items under this folder.
Nov 15, 2025
The Ubiquitous B Tree
Nov 15, 2025
Vlist
Nov 15, 2025
Roaring Bitmaps
Nov 15, 2025
Rrb Trees Efficient Immutable Vectors
Nov 15, 2025
Scalable Bloom Filters
Nov 15, 2025
Skip Lists A Probabilistic Alternative To Balanced Trees
Nov 15, 2025
Making Data Structures Persistent
Nov 15, 2025
Mergeable Persistent Data Structures
Nov 15, 2025
Persistent B Plus Trees In Non Volatile Main Memory
Nov 15, 2025
Purely Functional Worst Case Constant Time Catenable Sorted Lists
Nov 15, 2025
Making B Plus Trees Cache Conscious In Main Memory
Nov 15, 2025
Inverted Files For Text Search Engines
Nov 15, 2025
Lca Revisited
Nov 15, 2025
Less Hashing Same Performance Building A Better Bloom Filter
Nov 15, 2025
Level Ancestor Simplified
Nov 15, 2025
Lsm Tree
Nov 15, 2025
Hyperloglog In Practice Algorithmic Engineering Of A State Of The Art Cardinality Estimation Algorithm
Nov 15, 2025
Hyperloglog The Analysis Of A Near Optimal Cardinality Estimation Algorithm
Nov 15, 2025
Ideal Hash Trees
Nov 15, 2025
Fully Persistent B Plus Trees
Nov 15, 2025
Hopscotch Hashing
Nov 15, 2025
Efficient Synchronization Of State Based Crdts
Nov 15, 2025
Epidemic Broadcast Trees
Nov 15, 2025
Fast And Space Efficient Trie Searches
Nov 15, 2025
Fast Set Operations Using Treaps
Nov 15, 2025
Fenwick Trees
Nov 15, 2025
Dynamic Hash Tables
Nov 15, 2025
Ctries Snapshot
Nov 15, 2025
Cuckoo Filter Practically Better Than Bloom
Nov 15, 2025
Cuckoo Hashing
Nov 15, 2025
Dont Persist All Efficient Persistent Data Structures
Nov 15, 2025
Dont Thrash How To Cache Your Hash On Flash
Nov 15, 2025
An Improved Data Stream Summary The Count Min Sketch And Its Applications
Nov 15, 2025
Blsm A General Purpose Lsm Tree
Nov 15, 2025
Boot Strapping One Sided Flexible Arrays
Nov 15, 2025
Confluently Persistent Tries For Efficient Version Control
Nov 15, 2025
A Simple Implementation Technique For Priority Search Queues
Nov 15, 2025
A Skip List Cookbook
Nov 15, 2025
Advanced Bloom Filter Based Algorithms For Efficient Approximate Data De Duplication In Streams
Nov 15, 2025
Alternatives To Two Classic Data Structures
Nov 15, 2025
A General Purpose Counting Filter Making Every Bit Count
Nov 15, 2025
A Methodology For Implementing Highly Cocurrent Data Structures
Nov 15, 2025
A Comprehensive Study Of Convergent And Commutative Replicated Data Types