Approximate joins for XML at label level

DOI10.1016/J.INS.2014.06.007zbMath1355.68074OpenAlexW2038370312MaRDI QIDQ507755

Hong Gao, Liang Hao, Fei Li, Hongzhi Wang, Jian-Zhong Li

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.06.007

zbMATH Keywords

databasedata structuretree edit distanceapproximate XML join

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Quantum secure two-party Euclidean distance computation based on mutually unbiased bases

Cites Work

• A relation between edit distance for ordered trees and edit distance for Euler strings
• Approximate string-matching with \(q\)-grams and maximal matches
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• A non-classical logic for information retrieval
• The Tree-to-Tree Correction Problem
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Approximating Tree Edit Distance Through String Edit Distance
• Unnamed Item

This page was built for publication: Approximate joins for XML at label level