Distributed multi-source regular path queries

Authors:
Maryam Shoaran;Alex Thomo
Affiliations:
University of Victoria, Canada;University of Victoria, Canada
Venue:
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Year:
2007

Citing 18
Cited 1

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
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)
A call to regularity

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
Answering Regular Path Queries Using Views

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
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
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks

AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Weighted path queries on semistructured databases

Information and Computation
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

Fault-tolerant computation of distributed regular path queries

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular path queries are the building block 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 (as well) semistructured databases.