Processing Regular Path Queries on Arbitrarily Distributed Data
Distributed, Parallel, and Cluster Computing
2015-10-16 v1 Databases
Abstract
Regular Path Queries (RPQs) are a type of graph query where answers are pairs of nodes connected by a sequence of edges matching a regular expression. We study the techniques to process such queries on a distributed graph of data. While many techniques assume the location of each data element (node or edge) is known, when the components of the distributed system are autonomous, the data will be arbitrarily distributed. As the different query processing strategies are equivalently costly in the worst case, we isolate query-dependent cost factors and present a method to choose between strategies, using new query cost estimation techniques. We evaluate our techniques using meaningful queries on biomedical data.
Cite
@article{arxiv.1510.04347,
title = {Processing Regular Path Queries on Arbitrarily Distributed Data},
author = {Alan Davoust and Babak Esfandiari},
journal= {arXiv preprint arXiv:1510.04347},
year = {2015}
}