Category- and selection-enabled nearest neighbor joins.
Information Systems(2017)
摘要
This paper proposes a category- and selection-enabled nearest neighbor join (NNJ) between relation r and relation s, with similarity on T and support for category attributes C and selection predicate θ. Our solution does not suffer from redundant fetches and index false hits, which are the main performance bottlenecks of current nearest neighbor join techniques.
更多查看译文
关键词
Robust nearest neighbor join,Similarity join,Sort merge,Query optimization,Column-store,PostgreSQL
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要