STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The lower bounds on distributed shortest paths
Information Processing Letters
An (N -1)-Resilient Algorithm for Distributed Termination Detection
IEEE Transactions on Parallel and Distributed Systems
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
An “all pairs shortest paths” distributed algorithm using 2n2 messages
Journal of Algorithms
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A taxonomy of distributed termination detection algorithms
Journal of Systems and Software
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Regular path queries with constraints
Journal of Computer and System Sciences
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Reasoning on regular path queries
ACM SIGMOD Record
Distributed evaluation of generalized path queries
Proceedings of the 2005 ACM symposium on Applied computing
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
Weighted path queries on semistructured databases
Information and Computation
Using partial evaluation in distributed query evaluation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Distributed query evaluation with performance guarantees
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Preferentially annotated regular path queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
View-based query processing: on the relationship between rewriting, answering and losslessness
ICDT'05 Proceedings of the 10th international conference on Database Theory
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Enhanced regular path queries on semistructured databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Performance guarantees for distributed reachability queries
Proceedings of the VLDB Endowment
Efficient query evaluation on distributed graphs with Hadoop environment
Proceedings of the Fourth Symposium on Information and Communication Technology
Minimizing data transfers for regular reachability queries on distributed graphs
Proceedings of the Fourth Symposium on Information and Communication Technology
| Hi-index | 5.23 |
Regular path queries are the building blocks of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this paper we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a multi-source semistructured database setting. Our algorithm is general as it works for the larger class of weighted regular path queries on weighted semistructured databases. Also, we show how to make our algorithm fault-tolerant to smoothly work in environments prone to process (or machine) failures. This is very desirable in a grid setting, which is today's new paradigm of distributed computing, and where one does not have full control over machines that can unexpectedly leave in the middle of computation.