Saved in:
| Main Authors: | Imamura, Yasunobu, Shinohara, Takeshi, Higuchi, Naoya, Hirata, Kouichi, Kuboyama, Tetsuji |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.21682 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)
by: Bernardini, Giulia, et al.
Published: (2025)
Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026)
by: Men, Ziyang, et al.
Published: (2026)
Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)
by: Croquevielle, Luis, et al.
Published: (2024)
Text Indexing for Long Patterns using Locally Consistent Anchors
by: Ayad, Lorraine A. K., et al.
Published: (2024)
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)
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)
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)
by: Ramos, David Torres, et al.
Published: (2026)
Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
by: Liu, Junfeng, et al.
Published: (2025)
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)
by: Tekin, Selim Furkan, et al.
Published: (2025)
GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)
by: Shi, Jifan, et al.
Published: (2026)
Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)
by: Carmeli, Nofar, et al.
Published: (2025)
Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)
by: Luo, Zheng, et al.
Published: (2025)
Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)
by: Song, Siwoo, et al.
Published: (2025)
Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)
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)
by: Farhan, Muhammad, et al.
Published: (2025)
Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)
by: Yin, Haozhe, et al.
Published: (2025)
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)
by: Im, Sungjin, et al.
Published: (2025)
Smaller and More Flexible Cuckoo Filters
by: Schmitz, Johanna Elena, et al.
Published: (2025)
by: Schmitz, Johanna Elena, et al.
Published: (2025)
Clustering with Set Outliers and Applications in Relational Clustering
by: Surianarayanan, Vaishali, et al.
Published: (2025)
by: Surianarayanan, Vaishali, et al.
Published: (2025)
Towards Lazy B-Trees
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)
A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
by: Li, Zheng, et al.
Published: (2025)
by: Li, Zheng, et al.
Published: (2025)
Accelerating Graph Similarity Search through Integer Linear Programming
by: D'Ascenzo, Andrea, et al.
Published: (2025)
by: D'Ascenzo, Andrea, et al.
Published: (2025)
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)
by: Jang, Jihoon, et al.
Published: (2025)
Contextual Pattern Mining and Counting
by: Li, Ling, et al.
Published: (2025)
by: Li, Ling, et al.
Published: (2025)
Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
by: Lu, Shangqi, et al.
Published: (2025)
by: Lu, Shangqi, et al.
Published: (2025)
Multi-product Influence Maximization in Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2025)
by: Ali, Dildar, et al.
Published: (2025)
Blocked Bloom Filters with Choices
by: Schmitz, Johanna Elena, et al.
Published: (2025)
by: Schmitz, Johanna Elena, et al.
Published: (2025)
A Theoretical Framework for Distribution-Aware Dataset Search
by: Esmailpour, Aryan, et al.
Published: (2025)
by: Esmailpour, Aryan, et al.
Published: (2025)
Subtree Mode and Applications
by: Zhou, Jialong, et al.
Published: (2025)
by: Zhou, Jialong, et al.
Published: (2025)
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)
by: Yu, Kaiqiang, et al.
Published: (2025)
Improved Approximation Algorithms for Relational Clustering
by: Esmailpour, Aryan, et al.
Published: (2024)
by: Esmailpour, Aryan, et al.
Published: (2024)
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)
by: De Man, Quinten, et al.
Published: (2026)
A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
by: Zhong, Ming, et al.
Published: (2023)
by: Zhong, Ming, et al.
Published: (2023)
Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
by: Arenas, Marcelo, et al.
Published: (2024)
by: Arenas, Marcelo, et al.
Published: (2024)
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)
by: Hamada, Kou, et al.
Published: (2024)
Sampling Methods for Inner Product Sketching
by: Daliri, Majid, et al.
Published: (2023)
by: Daliri, Majid, et al.
Published: (2023)
Approaching 100% Confidence in Stream Summary through ReliableSketch
by: Wu, Yuhan, et al.
Published: (2024)
by: Wu, Yuhan, et al.
Published: (2024)
Range (Rényi) Entropy Queries and Partitioning
by: Esmailpour, Aryan, et al.
Published: (2023)
by: Esmailpour, Aryan, et al.
Published: (2023)
Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)
by: Agarwal, Pankaj K., et al.
Published: (2024)
Similar Items
-
Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025) -
Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026) -
Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024) -
Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024) -
Text Indexing for Long Patterns using Locally Consistent Anchors
by: Ayad, Lorraine A. K., et al.
Published: (2024)