Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
A framework for semantic querying of distributed data-graphs via information granules
ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
Certain answers and rewritings for local regular path queries on graph-structured data
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 0.01 |
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenient to use, RPQs are notorious for their high computational demand. In this paper, we present a gridaware, fault tolerant distributed algorithm for answering RPQs on spatial networks. We engineer each part of the algorithm to account for the assumed computational-grid setting. We experimentally evaluate our algorithm, and show that for typical user queries, our algorithm satisfies the desiderata for distributed computing in general, and computational-grids in particular.