A survey on tree matching and XML retrieval - Archive ouverte HAL Access content directly
Journal Articles Computer Science Review Year : 2013

A survey on tree matching and XML retrieval


With the increasing number of available XML documents, numerous approaches for retrieval have been proposed in the literature. They usually use the tree representation of documents and queries to process them, whether in an implicit or explicit way. Although retrieving XML documents can be considered as a tree matching problem between the query tree and the document trees, only a few approaches take advantage of the algorithms and methods proposed by the graph theory. In this paper, we aim at studying the theoretical approaches proposed in the literature for tree matching and at seeing how these approaches have been adapted to XML querying and retrieval, from both an exact and an approximate matching perspective. This study will allow us to highlight theoretical aspects of graph theory that have not been yet explored in XML retrieval.
Fichier principal
Vignette du fichier
Tahraoui_12411.pdf (1.29 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01131158 , version 1 (13-03-2015)



Mohammed Amin Tahraoui, Karen Pinel-Sauvagnat, Cyril Laitang, Mohand Boughanem, Hamamache Kheddouci, et al.. A survey on tree matching and XML retrieval. Computer Science Review, 2013, vol. 8, pp. 1-23. ⟨10.1016/j.cosrev.2013.02.001⟩. ⟨hal-01131158⟩
290 View
571 Download



Gmail Facebook X LinkedIn More