Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Regular path queries with constraints
Journal of Computer and System Sciences
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
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
Distributed evaluation of generalized path queries
Proceedings of the 2005 ACM symposium on Applied computing
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Preferential Regular Path Queries
Fundamenta Informaticae
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
Preferentially annotated regular path queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
Preferential Regular Path Queries
Fundamenta Informaticae
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.00 |
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, Web and communication networks, biological data management etc. We start by proposing weight-enhanced regular path queries with semantics that allow user-assigned preference (query) weights to be naturally combined with quantitative database link-information for driving the navigation. Motivated by the fact that the main applications of semistructured data involve distributed data sources, we focus next on the distributed evaluation of the weight-enhanced path queries. We present a distributed algorithm for evaluating our proposed queries in a multi-source setting. Our algorithm is general in the sense that it does not assume a known topology of the network and it can work using asynchronous communication. This algorithm can also be used to solve multi-source shortest path problems for which the full graph is not known in advance. To the best of our knowledge our algorithm is the first to address this problem in such a setting.