A near-optimal similarity join algorithm and performance evaluation

DOI10.1016/J.INS.2003.11.005MaRDI QIDQ558029zbMATH OpenOpenAlexFDO

Authors Zhengwu Yang, Guoqiang Yang

Publication date 30 June 2005

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

\(R\)-treeCache contentOrdering strategySequencing strategySimilarity join

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Database theory (68P15)

Recommendations

• Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. (Optimal dimension election in case of the similarity join.)
• scientific article; zbMATH DE number 1945796
• scientific article; zbMATH DE number 1975047
• I/O-efficient similarity join
• I/O-efficient similarity join

Cited in

(7)

• Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
• A partition-based method for string similarity joins with edit-distance constraints
• Optimizing top-\(k\) similarity join algorithm
• Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. (Optimal dimension election in case of the similarity join.)
• scientific article; zbMATH DE number 1945796 (Why is no real title available?)
• I/O-efficient similarity join
• I/O-efficient similarity join

This page was built for publication: A near-optimal similarity join algorithm and performance evaluation

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