Skip to content
Conference

PTIL: Partitioned Tree-Cover Interval Labeling for Restricted-Domain Reachability Queries

· International Conference on Extending Database Technology · pp. 34-46 · 1 citation · 44 references
Computer Science

TL;DR

This work proposes Partitioned Tree-Cover Interval Labeling (PTIL), a restricted-domain reachability indexing framework that extends classical Tree-Cover Labeling, and develops two instantiations: PTIL-g , a grouped scheme for scalable domain-aligned indexing, and PTIL-p, which additionally leverages query distributions for further prioritization when available.

View source

Similar papers

Open access Nov 2026

Graph reachability queries: A unified multi-metric framework with dynamic evaluation and practical guidelines

Reachability queries are a fundamental operation in large graph analysis, with applications in domains such as social networks, finance, program analysis, and XML query processing. Although many reachability indexes have been proposed, existing empirical studies remain limited in benchmark diversity, evaluation dimensi...

Huangleshuai He, Zheng-Yi Yang, Dong Wen et al. · 0 citations
Book Open access Nov 2026

Cimos: Cost-Effective Multi-Query Oriented Continuous Subgraph Matching

This work designs a data-centric index called DCL that serves multiple query graphs and prunes more non-candidate vertices by jointly considering the matching constraints of ancestor and descendant vertices in query DAGs, and proposes Cimos, a novel index-based framework for cost-effective MCSM.

Zi-Qi Zou, Kang-Fei Zhao, Qiyan Li et al. · 0 citations
Preprint Nov 2026

H-BRICK: Hierarchical Boundary Reachability Index with Compressed Kleene Closure for Directed Grid Graphs

Repeated directed reachability queries arise in online path planning, task-agent allocation, and swarm control on static grid maps, where reachability is asymmetric and full transitive closure is storage-prohibitive. We introduce H-BRICK, a Hierarchical Boundary Reachability Index with Compressed Kleene closure for exa...

Tolga Özaslan, Elif A. Özaslan · 0 citations
Preprint Oct 2026

Scaling Graph Query Processing: Focused Exploration on Partitions Using Load Balancing

The focus of this paper is on query processing and not search (approximate or exact). The goal is to find all or k answers and the expressiveness of a query (as opposed to a search expression which is typically simpler) is considered important. Although SQL query processing has matured over the last several decades, qu...

Harshit Modi, Abhishek Santra, Sharma Chakravarthy · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.