Abstract
There is a need to efficiently identify reachabilities between different types of objects over a large data graph. A reachability join (R-join) serves as a primitive operator for such a purpose. Given two types, A and D, R-join finds all pairs of A and D that D-typed objects are reachable from some A-typed objects. In this paper, we focus on processing multi reachability joins (R-joins). In the literature, the up-to-date approach extended the well-known twig-stack join algorithm, to be applicable on directed acyclic graphs (DAGs). The efficiency of such an approach is affected by the density of large DAGs. In this paper, we present algorithms to optimize R-joins using a dynamic programming based on the estimated costs associated with R-join. Our algorithm is not affected by the density of graphs. We conducted extensive performance studies, and report our findings in our performance studies.
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 Publishers Inc., San Francisco (2000)
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proc. of SIGMOD’89 (1989)
Brickley, D., Guha, R.V.: Resource Description Framework (RDF) Schema Specification 1.0. W3C Candidate Recommendation (2000)
Bruno, N., et al.: Holistic twig joins: optimal xml pattern matching. In: Proc. of SIGMOD’02 (2002)
Chen, L., et al.: Stack-based algorithms for pattern matching on dags. In: Proc. of VLDB’05 (2005)
Cheng, J., Yu, J.X., Tang, N.: Fast Reachability Query Processing. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 674–688. Springer, Heidelberg (2006)
DeRose, S., Maler, E., Orchard, D.: XML linking language (XLink) version 1.0 (2001)
DeRose, S., Maler, E., Orchard, D.: XML pointer language (XPointer) version 1.0 (2001)
Schmidt, A., et al.: XMark: A benchmark for XML data management. In: Proc. of VLDB’02 (2002)
Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: Proc. SIGMOD’79, pp. 23–34 (1979)
Wang, H., Wang, W., Lin, X., Li, J.: Labeling Scheme and Structural Joins for Graph-Structured XML Data. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds.) APWeb 2005. LNCS, vol. 3399, pp. 277–289. Springer, Heidelberg (2005)
Wang, H., Wang, W., Lin, X., Li, J.: Subgraph join: Efficient processing subgraph queries on graph-structured XML document. In: Proc. of WIAM’02 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, J., Yu, J.X., Ding, B. (2007). Cost-Based Query Optimization for Multi Reachability Joins. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)