Data Structures for Efficient Tree Mining: From Crisp to Soft Embedding Constraints - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles International Journal of Applied Mathematics and Computer Science Year : 2008

Data Structures for Efficient Tree Mining: From Crisp to Soft Embedding Constraints

Abstract

XML is playing an increasing role in data exchanges and the volume of available resources is thus growing dramatically. As they are heterogeneous, these resources must be translated into a {\em mediator} schema to be queried. For this purpose, automatic tools are required. These tools must allow the extraction of common data structures from the tree-like XML data. In this paper, we present a novel approach based on a low memory-consuming representation which can be improved by considering a binary representation. We show that these representations have many properties to enhance subtree mining algorithms, especially when considering soft tree embedding constraints. Experiments highlight the interest of our proposition.
No file

Dates and versions

lirmm-00272444 , version 1 (11-04-2008)

Identifiers

  • HAL Id : lirmm-00272444 , version 1

Cite

Federico del Razo Lopez, Stephane Sanchez, Anne Laurent, Pascal Poncelet, Maguelonne Teisseire. Data Structures for Efficient Tree Mining: From Crisp to Soft Embedding Constraints. International Journal of Applied Mathematics and Computer Science, 2008, 1, pp.21. ⟨lirmm-00272444⟩
128 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More