Abstract
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for “scaling” up or down the intrinsic importance of matching a symbol against a (semistructured) database edge label. Annotated regular path queries are expressed syntactically as annotated regular expressions. We interpret these expressions in a uniform semiring framework, which allows different semantics specializations for the same syntactic annotations. For our preference queries, we study three important aspects: (1) (progressive) query answering (2) (certain) query answering in LAV data-integration systems, and (3) query containment and equivalence. In all of these, we obtain important positive results, which encourage the use of our preference framework for enhanced querying of semistructured databases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (1999)
Calvanese, D., Giacomo, G., Lenzerini, M., Vardi, M.Y.: Answering Regular Path Queries Using Views. In: Proc. of ICDE 2000 (2000)
Calvanese, D., Giacomo, G., Lenzerini, M., Vardi, M.Y.: View-based Query Processing: On the Relationship between Rewriting, Answering and Losslessness. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, Springer, Heidelberg (2004)
Chomicki, J.: Preference formulas in relational queries. ACM Trans. Database Syst. 28(4), 427–466 (2003)
Flesca, S., Furfaro, F., Greco, S.: Weighted Path Queries on Web Data. In: Proc. of WebDB 2001 (2001)
Grahne, G., Thomo, A.: Query Answering and Containment for Regular Path Queries under Distortions. In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol. 2942, Springer, Heidelberg (2004)
Grahne, G., Thomo, A., Wadge, W.: Preferentially Annotated Regular Path Queries, http://www.cs.uvic.ca/~thomo/papers/icdt2007full.pdf
Hashiguchi, K.: Limitedness Theorem on Finite Automata with Distance Functions. Journal of Computer and System Sciences 24(2), 233–244 (1982)
Kiesling, W., Hafenrichter, B., Fischer, S., Holland, S.: Preference XPATH – A query language for E-commerce. In: Proc. of the 5th Int’l Conf. Wirtschaftsinformatik, Augsburg, Germany (2001)
Lenzerini, M.: Data Integration: A Theoretical Perspective. In: Proc. of PODS 2002 (2002)
Ruchi, A.: A Framework for Expressing Prioritized Constraints Using Infinitesimal Logic Master Thesis University of Victoria, BC, Canada (2005)
Stefanescu, D.C., Thomo, A., Thomo, L.: Distributed evaluation of generalized path queries. In: Proc. of SAC 2005 (2005)
Stefanescu, D.C., Thomo, A.: Enhanced Regular Path Queries on Semistructured Databases. In: Proc. of QLQP 2005 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grahne, G., Thomo, A., Wadge, W. (2006). Preferentially Annotated Regular Path Queries. In: Schwentick, T., Suciu, D. (eds) Database Theory – ICDT 2007. ICDT 2007. Lecture Notes in Computer Science, vol 4353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11965893_22
Download citation
DOI: https://doi.org/10.1007/11965893_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69269-0
Online ISBN: 978-3-540-69270-6
eBook Packages: Computer ScienceComputer Science (R0)