Approximate joins for XML at label level

DOI10.1016/J.INS.2014.06.007zbMATH Open1355.68074OpenAlexW2038370312MaRDI QIDQ507755FDOQ507755

Authors: Fei Li, Liang Hao, Hong Gao, Hongzhi Wang, Jianzhong 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

Recommendations

• scientific article; zbMATH DE number 2200793
• Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms
• scientific article; zbMATH DE number 2086312
• Approximate answers in databases of labeled objects
• An approximate query algorithm based on eight-neighbor grid clustering for heterogeneous XML documents

zbMATH Keywords

data structuredatabasetree edit distanceapproximate XML join

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

Cited In (2)

• Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507755)