Abstract
Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. Knowledge representations for tree structured data are quite important to discover interesting features which such tree structured data have. In order to represent tree structured patterns with rich structural features, we introduce a new type of structured variables, called height-constrained variables. An (i,j)-height-constrained variable can be replaced with any tree such that the trunk length of the tree is at least i and the height of the tree is at most j. Then, we define a term tree as a rooted tree structured pattern with ordered children and height-constrained variables. In this paper, given a term tree t and an ordered tree T, we present an \(O(N\max\{nD_{\max},{\cal S}\})\) time algorithm of deciding whether or not t matches T, where D max is the maximum number of the children of an internal vertex in T, \({\cal S}\) is the sum of all trunk length constraints i of all (i,j)-height-constrained variables in t, and n and N are the numbers of vertices of t and T, respectively.
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., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)
Aikou, K., Suzuki, Y., Shoudai, T., Miyahara, T.: Automatic Wrapper Generation for Metasearch using Ordered Tree Structured Patterns. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 1030–1035. Springer, Heidelberg (2004)
Amoth, T.R., Cull, P., Tadepalli, P.: On exact learning of unordered tree patterns. Machine Learning 44, 211–243 (2001)
Arimura, H., Sakamoto, H., Arikawa, S.: Efficient learning of semi-structured data from queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 315–331. Springer, Heidelberg (2001)
Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovery of frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 47–61. Springer, Heidelberg (2003)
Fernandez, M., Suciu, D.: Optimizing regular path expressions using graph schemas. In: Proceedings of the 14th International Conference on Data Engineering (ICDE 1998), pp. 14–23. IEEE Computer Society, Los Alamitos (1998)
Matsumoto, S., Hayashi, Y., Shoudai, T.: Polynomial time inductive inference of regular term tree languages from positive data. In: Li, M. (ed.) ALT 1997. LNCS, vol. 1316, pp. 212–227. Springer, Heidelberg (1997)
Matsumoto, S., Shoudai, T.: Learning of Ordered Tree Languages with Height- Bounded Variables Using Queries. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 425–439. Springer, Heidelberg (2004)
Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 133–144. Springer, Heidelberg (2004)
Shoudai, T., Uchida, T., Miyahara, T.: Polynomial time algorithms for finding unordered term tree patterns with internal variables. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 335–346. Springer, Heidelberg (2001)
Suzuki, Y., Akanuma, R., Shoudai, T., Miyahara, T., Uchida, T.: Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol. 2375, pp. 169–184. Springer, Heidelberg (2002)
Suzuki, Y., Shoudai, T., Miyahara, T., Uchida, T.: Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 188–202. Springer, Heidelberg (2002)
Suzuki, Y., Inomae, K., Shoudai, T., Miyahara, T., Uchida, T.: A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 270–284. Springer, Heidelberg (2003)
Wang, K., Liu, H.: Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering 12, 353–371 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aikou, K., Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T. (2005). A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. In: Apostolico, A., Crochemore, M., Park, K. (eds) Combinatorial Pattern Matching. CPM 2005. Lecture Notes in Computer Science, vol 3537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496656_30
Download citation
DOI: https://doi.org/10.1007/11496656_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26201-5
Online ISBN: 978-3-540-31562-9
eBook Packages: Computer ScienceComputer Science (R0)