Image de couverture de livre

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Yuan, Li, Ao, Li, Wenhai, Deng, Lingfeng
Format:	Preprint
Publié:	2025
Sujets:	Databases Data Structures and Algorithms Performance
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallel $k$d-tree with Batch Updates
par: Men, Ziyang, et autres
Publié: (2024)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
par: Ghandeharizadeh, Shahram, et autres
Publié: (2024)

PHast -- Perfect Hashing made fast
par: Beling, Piotr, et autres
Publié: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
par: Balasubramanian, Shrinivass Arunachalam
Publié: (2025)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
par: Azizi, Ilias, et autres
Publié: (2025)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
par: Ould-Khessal, Nadir, et autres
Publié: (2026)

Don't Persist All : Efficient Persistent Data Structures
par: Mahapatra, Pratyush, et autres
Publié: (2019)

Count-Min Sketch with Conservative Updates: Worst-Case Analysis
par: Mazziane, Younes Ben, et autres
Publié: (2024)

Virtual-Memory Powersort
par: Moltmann, Finn, et autres
Publié: (2026)

Setchain Algorithms for Blockchain Scalability
par: Karmegam, Arivarasan, et autres
Publié: (2025)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
par: Liu, Junfeng, et autres
Publié: (2025)

Accurate and Fast Approximate Graph Pattern Mining at Scale
par: Arpaci-Dusseau, Anna, et autres
Publié: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
par: Zhao, Fuheng, et autres
Publié: (2023)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
par: Ning, Baoling, et autres
Publié: (2024)

A Fair and Memory/Time-efficient Hashmap
par: Asudeh, Abolfazl, et autres
Publié: (2023)

Less is More: Faster Maximum Clique Search by Work-Avoidance
par: Vandierendonck, Hans
Publié: (2025)

Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
par: Mazziane, Younes Ben, et autres
Publié: (2026)

FRSZ2 for In-Register Block Compression Inside GMRES on GPUs
par: Grützmacher, Thomas, et autres
Publié: (2024)

Toward Greener Matrix Operations by Lossless Compressed Formats
par: Tosoni, Francesco, et autres
Publié: (2024)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
par: Li, Zheng, et autres
Publié: (2025)

Algorithms for Optimizing Acyclic Queries
par: Luo, Zheng, et autres
Publié: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
par: Yang, Huihui, et autres
Publié: (2025)

Towards Lazy B-Trees
par: Rysgaard, Casper Moldrup, et autres
Publié: (2025)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
par: Bender, Michael A., et autres
Publié: (2026)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
par: Qi, Yiyan, et autres
Publié: (2024)

Scalable Order-Preserving Pattern Mining
par: Li, Ling, et autres
Publié: (2024)

Contextual Pattern Mining and Counting
par: Li, Ling, et autres
Publié: (2025)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
par: Fan, Xiaoyu, et autres
Publié: (2024)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
par: Ramos, David Torres, et autres
Publié: (2026)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
par: Liang, Anqi, et autres
Publié: (2024)

On the Fair Comparison of Optimization Algorithms in Different Machines
par: Arza, Etor, et autres
Publié: (2023)

No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
par: Motiwala, Yusuf
Publié: (2025)

Socio-Spatial Group Queries for Impromptu Activity Planning
par: Shen, Chih-Ya, et autres
Publié: (2015)

Indexing Strings with Utilities
par: Bernardini, Giulia, et autres
Publié: (2025)

A Theoretical Framework for Distribution-Aware Dataset Search
par: Esmailpour, Aryan, et autres
Publié: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
par: Zhong, Ming, et autres
Publié: (2023)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
par: Wang, Kaixin, et autres
Publié: (2026)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)