:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Men, Ziyang, Huang, Bo, Gu, Yan, Sun, Yihan
Format:	Preprint
Published:	2026
Subjects:	Databases Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2601.05347
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

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

Socio-Spatial Group Queries for Impromptu Activity Planning
by: Shen, Chih-Ya, et al.
Published: (2015)

Provably Fast and Space-Efficient Parallel Biconnectivity
by: Dong, Xiaojun, et al.
Published: (2023)

Hilbert Forest in the SISAP 2025 Indexing Challenge
by: Imamura, Yasunobu, et al.
Published: (2025)

Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)

Text Indexing for Long Patterns using Locally Consistent Anchors
by: Ayad, Lorraine A. K., et al.
Published: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
by: Liang, Anqi, et al.
Published: (2024)

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

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

Optimal Dynamic Parameterized Subset Sampling
by: Gan, Junhao, et al.
Published: (2024)

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

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

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

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
by: Li, Xuan, et al.
Published: (2024)

Dynamic data summarization for hierarchical spatial clustering
by: Abduaziz, Kayumov, et al.
Published: (2024)

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

B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
by: Tekin, Selim Furkan, et al.
Published: (2025)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
by: Ding, Xiangyun, et al.
Published: (2025)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Parallel $k$-Core Decomposition: Theory and Practice
by: Liu, Youzhe, et al.
Published: (2025)

PASGAL: Parallel And Scalable Graph Algorithm Library
by: Dong, Xiaojun, et al.
Published: (2024)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)

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

Parallel Point-to-Point Shortest Paths and Batch Queries
by: Dong, Xiaojun, et al.
Published: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
by: Huang, Qiang, et al.
Published: (2024)

Parallel Joinable B-Trees in the Fork-Join I/O Model
by: Goodrich, Michael, et al.
Published: (2025)

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

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

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
by: Ould-Khessal, Nadir, et al.
Published: (2026)

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

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

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

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