Y. Chi, Y. Yang, and R. R. Muntz, Indexing and mining free trees, International Conference on Data Mining 2003 (ICDM2003), 2003.

Y. Chi, Y. Yang, and R. R. Muntz, Cmtreeminer : Mining both closed and maximal frequent subtrees, The Eighth Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2004.

M. Kuramochi and G. Karypis, Frequent subgraph discovery, IEEE International Conference on Data Mining (ICDM), 2001.

A. Termier, M. Rousset, and M. Sebag, Treefinder, a first step towards XML data mining, IEEE Conference on Data Mining (ICDM), pp.450-457, 2002.

J. Tranier, R. Baraer, Z. Bellahsene, and M. Teisseire, , pp.7-9, 2004.

;. Where's-charlie, . Coimbra, C. Wang, Q. Yuan, H. Zhou et al., Family based heuristics for peer-to-peer schema integration, Proceedings of the 8th International Database Engineering and Applications Symposium (IDEAS '04), vol.19, pp.309-319, 2004.

M. A. Weiss, Data Structures And Algorithm Analysis In C, 1998.

L. Xyleme, A dynamic warehouse for xml data of the web, IEEE Data Engineering Bulletin, 2001.

X. Yan and J. Han, gspan : Graph-based substructure pattern mining, IEEE Conference on Data Mining (ICDM), 2002.

M. Zaki, Summary Mining frequent subtrees from tree databases is currently a very active research topic. This research has many interests, including for instance mediator schema building from XML schemas. In this framework, many works have been proposed. However, the way the data are represented is often very memory-consuming. In this paper, we propose a new method to represent such data. We show that this representation has many properties, which can be used in order to enhance subtree mining algorithms, ACM-SIGKDD'02, 2002.