A survey on tree matching and XML retrieval

DOI10.1016/j.cosrev.2013.02.001zbMath1295.68109MaRDI QIDQ394973

Lei Ning, Hamamache Kheddouci, Cyril Laitang, Mohammed Amin Tahraoui, Mohand Boughanem, Karen Pinel-Sauvagnat

Publication date: 28 January 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2013.02.001

zbMATH Keywords

XML; tree; information retrieval; query language; approximate tree matching; exact tree matching

Mathematics Subject Classification ID

68P15: Database theory

68R10: Graph theory (including graph drawing) in computer science

68P05: Data structures

68P20: Information storage and retrieval of data

Related Items

Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве, Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах

Uses Software

• XQuery
• XPath
• ViST
• PRIX
• Quilt
• TwigStack+
• XMark

Cites Work

• An overview on XML similarity: background, current trends and future directions
• A survey on tree edit distance and related problems
• Alignment of trees -- an alternative to tree edit
• A new tree inclusion algorithm
• On Chen and Chen's new tree inclusion algorithm
• Decomposition algorithms for the tree edit distance problem
• New Algorithm for Ordered Tree-to-Tree Correction Problem
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Encyclopedia of Database Systems
• Analysis of Tree Edit Distance Algorithms
• Pattern Matching in Trees
• Efficient string matching
• The embeddings of a graph—A survey
• The Tree-to-Tree Correction Problem
• Faster tree pattern matching
• More Efficient Algorithm for Ordered Tree Inclusion
• The String-to-String Correction Problem
• Tree Pattern Matching to Subset Matching in Linear Time
• Ordered and Unordered Tree Inclusion
• Theoretical Computer Science
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Automata, Languages and Programming
• Automata, Languages and Programming
• SOFSEM 2004: Theory and Practice of Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item