Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Rewriting of regular expressions and regular path queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-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
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
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
Enhanced regular path queries on semistructured databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
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 |
Nowadays, we are required to deal with more complex data, prime examples of which are data on the Web, XML data, biological data, etc. There are already proposed abstractions to handle these kinds of data, in particular in terms of semistructured data models. A semistructured model conceives a database essentially as a finite directed labeled graph whose nodes represent objects, and whose edges represent relationships between objects. In this paper, we focus on path queries, which are considered the basic querying mechanism for semistructured data. In essence, such queries are used to navigate, or discover paths that conform to specifications captured by regular expressions. In order to make the navigation more useful, we consider generalized path queries, in which the symbols could optionally be weighted by numbers. Such numbers can express a variety of information about the data that the query could possibly match or navigate.Motivated by the plethora of today's applications utilizing Web services and peer-to-peer architectures, we present a distributed algorithm for evaluating generalized path queries. We follow a realistic model with distributed (non-shared) memory and message-passing between processors. An optimal solution to the problem lies in the intersection of ideas related to distributed query evaluation, distributed shortest path computation, and queueing systems.