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.
Work partially supported by a MURST grant under the project “Interdata”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul S. Querying Semi-Structured Data. Proc. International Conference on Database Theory, pages 1–18, 1997.
Abiteboul S., R. Hull, V. Vianu. Foundations of Databases. Addison-Wesley, 1994.
Abiteboul S., V. Vianu. Queries and Computation on the Web. Proc. International Conference on Database Theory, pages 262–275, 1997.
Altavista Help, http://www.altavista.com/av/content/help.htm.
Beeri C, Y. Kornatzky, A Logical Query Language for Hypertext Systems. Proc. European Conference on Hypertexts, pages 67–80, 1990.
Consens M, Mendelzon A., GraphLog: a Visual Formalism for Real Life Recursion. Proc. Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 404–416, 1990.
Cruz I., Mendelzon A., P. Wood. G+: Recursive Queries Without Recursion. Proc. 2nd Int. Conf. on Expert Database Systems, pages 355–368, 1988.
Hopcroft J., J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 1980.
Kifer, M., W. Kim, Y. Sagiv, Querying Object-Oriented Databases, Proc. ACM-SIGMOD International Conference on Management of Data, pages 393–402, 1992.
Kifer, M., G. Lausen, J. Wu, Logical Foundation of Object-Oriented and Frame Based Languages., Journal of ACM, 42(4), pages 741–843, 1995.
Mendelzon A., P.T. Wood, Finding Regular Simple Path in Graph Databases, SIAM Journal on Computing, 24(6), 1995.
Mendelzon A., G. Mihaila, T. Milo, Querying the World Wide Web, Journal of Digital Libraries, 1997.
Mendelzon A., T. Milo, Formal models of web queries, Proc. Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997.
Minohara T., R. Watanabe. Queries on Structures in Hypertext, Foundations of Data Organization and Algorithms (FODO), pages 394–411, 1993.
Tarjan R., Fast Algorithms for Solving Path Problems, Journal of ACM, 28, pages 594–614, 1981.
Yannakakis M., Graph-theoretic methods in database theory, In Proc. Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 230–242, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flesca, S., Greco, S. (1999). Partially Ordered Regular Languages for Graph Queries. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive