Partition-based similarity join in high dimensional data spaces

DOI10.1007/3-540-46146-9_73MaRDI QIDQ4410709zbMATH OpenFDO

Authors Hyoseop Shin, Bongki Moon, Sukho Lee

Publication date 3 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2453/24530741.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. (Optimal dimension election in case of the similarity join.)
• scientific article; zbMATH DE number 2114144
• Similarity join in metric spaces
• Optimal dimension order: A generic technique for the similarity join
• Subspace projection: A unified framework for a class of partition-based dimension reduction techniques

Cited in

(7)

• Join strategies using data space partitioning
• Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. (Optimal dimension election in case of the similarity join.)
• A partition-based method for string similarity joins with edit-distance constraints
• A high dimensional data indexing technique based on max gap space mapping
• Optimal dimension order: A generic technique for the similarity join
• Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
• scientific article; zbMATH DE number 2114144 (Why is no real title available?)

This page was built for publication: Partition-based similarity join in high dimensional data spaces

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