Cover Image

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Huihui, Yuan, Pingpeng
Format:	Preprint
Published:	2025
Subjects:	Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)

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

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Approximating Queries on Probabilistic Graphs
by: Amarilli, Antoine, et al.
Published: (2023)

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

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

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

Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026)

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

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

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

Grafite: Taming Adversarial Queries with Optimal Range Filters
by: Costa, Marco, et al.
Published: (2023)

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

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

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
by: Bringmann, Karl, et al.
Published: (2022)

Improved Online Reachability Preservers
by: Bodwin, Greg, et al.
Published: (2024)

The Price of Universal Temporal Reachability
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

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

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

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

Contextual Pattern Mining and Counting
by: Li, Ling, et al.
Published: (2025)

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

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
by: Fan, Xiaoyu, et al.
Published: (2024)

Scalable Order-Preserving Pattern Mining
by: Li, Ling, et al.
Published: (2024)

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

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

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

Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
by: Lu, Shangqi, et al.
Published: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, 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)

Maximizing Reachability via Shifting of Temporal Paths
by: Deligkas, Argyrios, et al.
Published: (2026)

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

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
by: Huang, Chien-Chung, et al.
Published: (2026)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)

Correlation Sketches for Approximate Join-Correlation Queries
by: Santos, Aécio, et al.
Published: (2021)

Group Trip Planning Query Problem with Multimodal Journey
by: Ali, Dildar, et al.
Published: (2025)

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