Efficiently Estimating Joining Cost of Subqueries in Regular Path Queries.

Nguyen, Van-Quyet; Nguyen, Van-Hau; Nguyen, Minh-Quy; Huynh, Quyet-Thang; Kim, Kyungbaek; Grandi, Fabio; Ursino, Domenico

Evaluating Regular Path Queries (RPQs) have been of interest since they were used as a powerful way to explore paths and patterns in graph databases. Traditional automata-based approaches are restricted in the graph size and/or highly complex queries, which causes a high evaluation cost (e.g., memory space and response time) on large graphs. Recently, although using the approach based on the threshold rare label for large graphs has been achieving some success, they could not often guarantee the minimum searching cost. Alternatively, the Unit-Subquery Cost Matrix (USCM) has been studied and obtained the viability of the usage of subqueries. Nevertheless, this method has an issue, which is, it does not cumulate the cost among subqueries that causes the long response time on a large graph. In order to overcome this issue, this paper proposes a method for estimating joining cost of subqueries to accelerate the USCM based parallel evaluation of RPQs on a large graph, namely USCM-Join. Through real-world datasets, we experimentally show that the USCM-Join outperforms others and estimating the joining cost enhances the USCM based approach up to around 20% in terms of response time.

COST estimates; GRAPH labelings

Electronics (2079-9292), 2021, Vol 10, Issue 9, p990

2079-9292

Academic Journal

10.3390/electronics10090990