Partially Ordered Regular Languages for Graph Queries

Authors:
Sergio Flesca;Sergio Greco
Affiliations:
-;-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 11
Cited 1

Querying object-oriented databases

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
Finding Regular Simple Paths in Graph Databases

SIAM Journal on Computing
Formal models of Web queries

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fast Algorithms for Solving Path Problems

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
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
Querying Semi-Structured Data

ICDT '97 Proceedings of the 6th International Conference on Database Theory

Querying RDF data from a graph database perspective

ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an extension of regular languages to support graph queries. The proposed extension is based on the introduction of a partial order on the strings of the languages. We extend regular expressions, regular grammars and finite state automata by introducing partial orders on strings, production rules and transitions, respectively. The relation among regular expressions, regular grammars and finite state automata is analyzed. We show how partially ordered languages can be used to define path queries to search graph databases and present results on their computational complexity. Finally, we present an application of partially ordered languages for searching the Web.