:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Ould-Khessal, Nadir, Fazackerley, Scott, Lawrence, Ramon
Formato:	Preprint
Publicado:	2026
Materias:	Databases Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2603.05632
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
por: Chen, Yuan, et al.
Publicado: (2025)

A Fair and Memory/Time-efficient Hashmap
por: Asudeh, Abolfazl, et al.
Publicado: (2023)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
por: Yang, Huihui, et al.
Publicado: (2025)

Space-Efficient Indexes for Uncertain Strings
por: Gabory, Esteban, et al.
Publicado: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
por: Hamada, Kou, et al.
Publicado: (2024)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
por: Zhao, Fuheng, et al.
Publicado: (2023)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
por: Jang, Jihoon, et al.
Publicado: (2025)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
por: Ertl, Otmar
Publicado: (2024)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
por: Fan, Zhuochen, et al.
Publicado: (2024)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
por: Ertl, Otmar
Publicado: (2023)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
por: Ramos, David Torres, et al.
Publicado: (2026)

Towards Lazy B-Trees
por: Rysgaard, Casper Moldrup, et al.
Publicado: (2025)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
por: Bender, Michael A., et al.
Publicado: (2026)

Memory Hierarchy Design for Caching Middleware in the Age of NVM
por: Ghandeharizadeh, Shahram, et al.
Publicado: (2025)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
por: Liu, Junfeng, et al.
Publicado: (2025)

Sampling Space-Saving Set Sketches
por: Lee, Homin K., et al.
Publicado: (2024)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
por: Zhao, Fuheng, et al.
Publicado: (2023)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
por: Wang, Kaixin, et al.
Publicado: (2026)

Parallel Dynamic Spatial Indexes
por: Men, Ziyang, et al.
Publicado: (2026)

Faster Relational Algorithms Using Geometric Data Structures
por: Esmailpour, Aryan, et al.
Publicado: (2026)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
por: Bringmann, Karl, et al.
Publicado: (2026)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
por: Yin, Ziqi, et al.
Publicado: (2026)

Listing Even Cycles Faster than the Submodular-Width Barrier
por: Nakos, Vasileios, et al.
Publicado: (2026)

The Importance of Parameters in Ranking Functions
por: Standke, Christoph, et al.
Publicado: (2026)

Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
por: Liu, Kaiwen, et al.
Publicado: (2026)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
por: Ali, Dildar, et al.
Publicado: (2026)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
por: Shahbazi, Nima, et al.
Publicado: (2026)

Approximate Butterfly Counting in Sublinear Time
por: Luo, Chi, et al.
Publicado: (2026)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
por: Wang, Huayi, et al.
Publicado: (2026)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)

Improved Approximation Algorithms for Relational Clustering
por: Esmailpour, Aryan, et al.
Publicado: (2024)

Algorithms for Optimizing Acyclic Queries
por: Luo, Zheng, et al.
Publicado: (2025)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
por: Zhong, Ming, et al.
Publicado: (2023)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
por: Arenas, Marcelo, et al.
Publicado: (2024)

Sampling Methods for Inner Product Sketching
por: Daliri, Majid, et al.
Publicado: (2023)

Approaching 100% Confidence in Stream Summary through ReliableSketch
por: Wu, Yuhan, et al.
Publicado: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

Range (Rényi) Entropy Queries and Partitioning
por: Esmailpour, Aryan, et al.
Publicado: (2023)