Abstract
The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It first computes the maximum F-bisimulation, and then refines this to a maximal B-bisimulation. We prove that the result equals the maximum F&B-bisimulation.
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.
Similar content being viewed by others
References
Bača, R., Krátký, M., Snášel, V.: On the efficient search of an XML twig query in large DataGuide trees. In: Proc. IDEAS (2008)
Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: Proc. SIGMOD (2003)
Dovier, A., Piazza, C., Policriti, A.: A fast bisimulation algorithm. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 79. Springer, Heidelberg (2001)
Fernandez, J.-C.: An implementation of an efficient algorithm for bisimulation equivalence. Sci. Comput. Program. 13(2-3) (1990)
Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: Proc. VLDB (1997)
Gou, G., Chirkova, R.: Efficiently querying large XML data repositories: A survey. Knowl. and Data Eng. (2007)
Grimsmo, N., Bjørklund, T.A., Hetland, M.L.: Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees (extended version). Technical Report IDI-TR-2010-10, NTNU, Trondheim, Norway (2010)
Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. FOCS (1995)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: Proc. SIGMOD (2002)
Kaushik, R., Bohannon, P., Naughton, J.F., Shenoy, P.: Updates for structure indexes. In: Proc. VLDB (2002)
Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: Proc. ICDE (2002)
Liu, X., Li, J., Wang, H.: SAM: An efficient algorithm for F&B-index construction. In: Proc. APWeb/WAIM (2007)
Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Englewood Cliffs (1989)
Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. (1987)
Saha, D.: An incremental bisimulation algorithm. In: Proc. FSTTCS (2007)
Wu, X., Liu, G.: XML twig pattern matching using version tree. Data & Knowl. Eng. (2008)
Yang, B., Fontoura, M., Shekita, E., Rajagopalan, S., Beyer, K.: Virtual cursors for XML joins. In: Proc. CIKM (2004)
Yi, K., He, H., Stanoi, I., Yang, J.: Incremental maintenance of XML structural indexes. In: Proc. SIGMOD (2004)
Yu, J.X., Cheng, J.: Graph reachability queries: A survey. In: Managing and Mining Graph Data (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grimsmo, N., Bjørklund, T.A., Hetland, M.L. (2010). Linear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees. In: Lee, M.L., Yu, J.X., Bellahsène, Z., Unland, R. (eds) Database and XML Technologies. XSym 2010. Lecture Notes in Computer Science, vol 6309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15684-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15684-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15683-0
Online ISBN: 978-3-642-15684-7
eBook Packages: Computer ScienceComputer Science (R0)