A near-optimal similarity join algorithm and performance evaluation

DOI10.1016/J.INS.2003.11.005zbMATH Open1094.68561OpenAlexW1963817532MaRDI QIDQ558029FDOQ558029

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

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

zbMATH Keywords

\(R\)-treeCache contentOrdering strategySequencing strategySimilarity join

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• A partition-based method for string similarity joins with edit-distance constraints
• Optimizing top-\(k\) similarity join algorithm
• Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
• I/O-efficient similarity join
• I/O-efficient similarity join
• Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. (Optimal dimension election in case of the 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)