Skip to Main content Skip to Navigation
Journal articles

A survey on tree matching and XML retrieval

Abstract : 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.
Complete list of metadata

Cited literature [123 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Friday, March 13, 2015 - 9:28:49 AM
Last modification on : Friday, September 30, 2022 - 11:34:16 AM
Long-term archiving on: : Sunday, June 14, 2015 - 10:20:49 AM


Files produced by the author(s)



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, Elsevier, 2013, vol. 8, pp. 1-23. ⟨10.1016/j.cosrev.2013.02.001⟩. ⟨hal-01131158⟩



Record views


Files downloads