Semirings, automata, languages
Semirings, automata, languages
Introduction to algorithms
A logical query language for hypertext systems
Hypertext: concepts, systems and applications
A polynomial-time algorithm for the equivalence of probabilistic automata
SIAM Journal on Computing
Querying object-oriented databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Finite Automata Computing Real Functions
SIAM Journal on Computing
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Evaluating queries with generalized path expressions
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Queries on Structures in Hypertext
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Queries and Computation on the Web
ICDT '97 Proceedings of the 6th International Conference on Database Theory
ICDT '97 Proceedings of the 6th International Conference on Database Theory
On the Determinization of Weighted Finite Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
The equivalence and learning of probabilistic automata
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Regular languages with variables on graphs
Information and Computation
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
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
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.01 |
Path queries have been extensively used to query semistructured data, such as the Web and XML documents. In this paper we introduce weighted path queries, an extension of path queries enabling several classes of optimization problems (such as the computation of shortest paths) to be easily expressed. Weighted path queries are based on the notion of weighted regular expression, i.e., a regular expression whose symbols are associated to a weight. We characterize the problem of answering weighted path queries and provide an algorithm for computing their answer. We also show how weighted path queries can be effectively embedded into query languages for XML data to express in a simple and compact form several meaningful research problems.