Image de couverture de livre

BS-tree: A gapped data-parallel B-tree

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Tsitsigkos, Dimitrios, Michalopoulos, Achilleas, Mamoulis, Nikos, Terrovitis, Manolis
Format:	Preprint
Publié:	2025
Sujets:	Databases
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

In-memory Multidimensional Indexing Using the skd-tree
par: Michalopoulos, Achilleas, et autres
Publié: (2026)

CRISP: Correlation-Resilient Indexing via Subspace Partitioning
par: Dimitropoulos, Dimitris, et autres
Publié: (2026)

Raster Interval Object Approximations for Spatial Intersection Joins
par: Georgiadis, Thanasis, et autres
Publié: (2023)

Multi-granularity Spatiotemporal Flow Patterns
par: Kosyfaki, Chrysanthi, et autres
Publié: (2025)

Toward Temporal Attribution Analytics in Dataflows
par: Kosyfaki, Chrysanthi, et autres
Publié: (2026)

DistillER: Knowledge Distillation in Entity Resolution with Large Language Models
par: Zeakis, Alexandros, et autres
Publié: (2026)

Towards a B+-tree with Fluctuation-Free Performance
par: Xing, Lu, et autres
Publié: (2026)

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
par: Chen, Yuan, et autres
Publié: (2025)

Evaluating Continuous Basic Graph Patterns over Dynamic Link Data Graphs
par: Gergatsoulis, Manolis, et autres
Publié: (2022)

An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs (Extended Version)
par: Chen, Qing, et autres
Publié: (2025)

Rethinking LSM-tree based Key-Value Stores: A Survey
par: Lv, Yina, et autres
Publié: (2025)

Grain Theory: Type-Level Granularity Correctness in Data Pipelines
par: Karayannidis, Nikos
Publié: (2026)

How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
par: Mo, Dingheng, et autres
Publié: (2025)

Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-trees
par: Zhang, Jianshun, et autres
Publié: (2025)

HotRAP: Hot Record Retention and Promotion for LSM-trees with Tiered Storage
par: Qiu, Jiansheng, et autres
Publié: (2024)

RESYSTANCE: Unleashing Hidden Performance of Compaction in LSM-trees via eBPF
par: Byun, Hongsu, et autres
Publié: (2026)

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

Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees
par: Zhang, Jianshun, et autres
Publié: (2025)

Identifying knowledge gaps in biodiversity data and their determinants at the regional level
par: Alard, Didier, et autres
Publié: (2026)

DLHT: A Non-blocking Resizable Hashtable with Fast Deletes and Memory-awareness
par: Katsarakis, Antonios, et autres
Publié: (2024)

A parallel algorithm for automated labeling of large time series
par: Goglachev, Andrey
Publié: (2023)

Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree
par: Al-Mamun, Abdullah, et autres
Publié: (2025)

CAMAL: Optimizing LSM-trees via Active Learning
par: Yu, Weiping, et autres
Publié: (2024)

GP-Tree: An in-memory spatial index combining adaptive grid cells with a prefix tree for efficient spatial querying
par: Yang, Xiangyang, et autres
Publié: (2026)

Context-Enriched Natural Language Descriptions of Vessel Trajectories
par: Patroumpas, Kostas, et autres
Publié: (2026)

SPER: Accelerating Progressive Entity Resolution via Stochastic Bipartite Maximization
par: Karapiperis, Dimitrios, et autres
Publié: (2025)

Efficiently Processing Joins and Grouped Aggregations on GPUs
par: Wu, Bowen, et autres
Publié: (2023)

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

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

Parallel R-tree-based Spatial Query Processing on a Commercial Processing-in-Memory System
par: Jannat, Tasmia, et autres
Publié: (2026)

DumpKV: Learning based lifetime aware garbage collection for key value separation in LSM-tree
par: Zhuang, Zhutao, et autres
Publié: (2024)

ALER: An Active Learning Hybrid System for Efficient Entity Resolution
par: Karapiperis, Dimitrios, et autres
Publié: (2026)

Data-Driven Trajectory Imputation for Vessel Mobility Analysis
par: Spiliopoulos, Giannis, et autres
Publié: (2026)

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)

Hippasus: Effective and Efficient Automatic Feature Augmentation for Machine Learning Tasks on Relational Data
par: Papadias, Serafeim, et autres
Publié: (2026)

Properties for Paths in Graph Databases
par: Orejas, Fernando, et autres
Publié: (2025)

A survey of open-source data quality tools: shedding light on the materialization of data quality dimensions in practice
par: Papastergios, Vasileios, et autres
Publié: (2024)

A metadata model for profiling multidimensional sources in data ecosystems
par: Diamantini, Claudia, et autres
Publié: (2025)

Cleaning data with Swipe
par: Boeckling, Toon, et autres
Publié: (2024)

ezBIDS: Guided standardization of neuroimaging data interoperable with major data archives and platforms
par: Levitas, Daniel, et autres
Publié: (2023)