A survey on tree matching and XML retrieval
DOI10.1016/J.COSREV.2013.02.001zbMATH Open1295.68109OpenAlexW2089512297MaRDI QIDQ394973FDOQ394973
Authors: M. A. Tahraoui, Karen Pinel-Sauvagnat, Cyril Laitang, Mohand Boughanem, H. Kheddouci, Lei Ning 
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
Recommendations
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Database theory (68P15)
Cites Work
- Efficient string matching
- Title not available (Why is that?)
- The Tree-to-Tree Correction Problem
- Title not available (Why is that?)
- The String-to-String Correction Problem
- A survey on tree edit distance and related problems
- Encyclopedia of Database Systems
- Tree Pattern Matching to Subset Matching in Linear Time
- Pattern Matching in Trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Automata, Languages and Programming
- Alignment of trees -- an alternative to tree edit
- Ordered and Unordered Tree Inclusion
- More Efficient Algorithm for Ordered Tree Inclusion
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of tree edit distance algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The embeddings of a graph—A survey
- Title not available (Why is that?)
- Faster tree pattern matching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An overview on XML similarity: background, current trends and future directions
- Fuzzy XML queries via context-based choice of aggregations
- Theoretical Computer Science
- An Optimal Decomposition Algorithm for Tree Edit Distance
- Automata, Languages and Programming
- SOFSEM 2004: Theory and Practice of Computer Science
- A new tree inclusion algorithm
Cited In (10)
- Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
- Title not available (Why is that?)
- On the asymptotic normality in the problem on the tuples repetitions in a marked complete tree
- Title not available (Why is that?)
- Satisfaction-based selection of XML documents
- Forward linearised tree pattern matching using tree pattern border array
- Matching twigs in fuzzy XML
- Title not available (Why is that?)
- Querying techniques for XML data
- Logical tree matching with complete answer aggregates for retrieving structured documents
Uses Software
This page was built for publication: A survey on tree matching and XML retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394973)
