Efficiently Answering Reachability Queries for Tree-Structured Data in Repetitive Prime Number Labeling Schemes

Abstract

Reachability queries plays a crucial role in accessing relationships between nodes in tree-structured data. Previous studies have proposed prime number labeling schemes that answer reachability queries using arithmetic operations. However, the prime numbers in these schemes can become very large when a tree contains a considerable number of nodes; thus, it is not scalable. Recently, a repetitive prime number labeling scheme that reduces space requirements was proposed. Unfortunately, it suffers from slow query processing, owing to the complexity of its reachability test. In this paper, we propose a more efficient method for answering reachability queries in a repetitive prime number labeling scheme. The results of experiments using real-world XML datasets show that our approach reduces reachability query processing times.

Efficient Access Control of Large Scale RDF Data Using Prefix-Based Labeling

“…In the future work, larger RDF datasets will be incorporated, and an approach that encodes the prefixbased labels into more efficient IDs, such as hexadecimal representations, will be considered. We will adopt another labeling scheme to address the problem of RDF data access control, such as prime number labeling [24]- [27], intervalbased labeling [28], [29], and 2-hop labeling [30], [31]. Furthermore, RDF data changes over time.…”

Optimization of Shortest-Path Search on RDBMS-Based Graphs

“…In future research, the search space will be reduced using trees and graph reachability [24,25]. When calculating the shortest path, if we know in advance whether a path exists between two points, then the number of candidate nodes used can be reduced for the shortest path search.…”