Abstract
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, Web and communication networks, biological data management etc. We start by proposing weight-enhanced regular path queries with semantics that allow user-assigned preference (query) weights to be naturally combined with quantitative database link-information for driving the navigation.
Motivated by the fact that the main applications of semistructured data involve distributed data sources, we focus next on the distributed evaluation of the weight-enhanced path queries. We present a distributed algorithm for evaluating our proposed queries in a multi-source setting. Our algorithm is general in the sense that it does not assume a known topology of the network and it can work using asynchronous communication. This algorithm can also be used to solve multi-source shortest path problems for which the full graph is not known in advance. To the best of our knowledge our algorithm is the first to address this problem in such a setting.
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., Vianu, V.: Regular Path Queries with Constraints. Journal of Computing and System Sciences 58(3), 428–452 (1999)
Flesca, S., Furfaro, F., Greco, S.: Weighted path queries on web data. In: Proceedings of the 4th International Workshop on the Web and Databases (WebDB 2001) Informal Proceedings, pp. 7–12 (2001)
Grabs, T., Schek, H.-J.: ETH Zürich at INEX: Flexible Information Retrieval from XML with PowerDB-XML. In: Proc. INEX Workshop 2002, pp. 141–148 (2002)
Grahne, G., Thomo, A.: Approximate reasoning in semistructured data. In: Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001) (2001), Online Proceedings, http://ceur-ws.org/Vol-45/03-thomo.ps
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, pp. 98–115. Springer, Heidelberg (2004)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Mendelzon, A.O., Mihaila, G.A., Milo, T.: Querying the World Wide Web. International Journal on Digital Libraries 1(1), 57–67 (1997)
Mendelzon, A.O., Wood, P.T.: Finding Regular Simple Paths in Graph Databases. SIAM J. Comp. 24(6), 1235–1258 (1995)
Meyer, H., Bruder, I., Heuer, A., Weber, G.: The Xircus Search Engine. In: INEX Workshop 2002, pp. 119–124 (2002)
Stefanescu, D.C., Thomo, A., Thomo, L.: Distributed evaluation of generalized path queries. In: Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 610–616 (2005)
Suciu, D.: Distributed query evaluation on semistructured data. ACM Transactions on Database Systems 27(1), 1–62 (2002)
Vardi, M.Y.: A Call to Regularity. In: Proc. PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop 2003, p. 11 (2003)
Lacroix, Z., Raschid, L., Naumann, F., Vidal, M.E.: Exploring Life Sciences Data Sources Technical report (2003)
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
Stefanescu, D., Thomo, A. (2006). Enhanced Regular Path Queries on Semistructured Databases. In: Grust, T., et al. Current Trends in Database Technology – EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 4254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11896548_53
Download citation
DOI: https://doi.org/10.1007/11896548_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46788-5
Online ISBN: 978-3-540-46790-8
eBook Packages: Computer ScienceComputer Science (R0)