Cache-conscious performance optimization for similarity search-Reference-Cited by-同舟云学术

Cache-conscious performance optimization for similarity search

Published:2013-07-28 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
language:
Short-container-title:

Author:

Alabduljalil Maha¹,Tang Xun¹,Yang Tao¹

Affiliation:

1. University of California at Santa Barbara, Santa Barbara, California, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2484028.2484077

Reference30 articles.

1. Optimizing parallel algorithms for all pairs similarity search

2. Arvind Arasu Venkatesh Ganti and Raghav Kaushik. Efficient exact set-similarity joins. In VLDB'06. Arvind Arasu Venkatesh Ganti and Raghav Kaushik. Efficient exact set-similarity joins. In VLDB'06.

3. Language Technologies Institute at Carnegie Mellon University. The clueweb09 dataset http://boston.lti.cs.cmu.edu/data/clueweb09. Language Technologies Institute at Carnegie Mellon University. The clueweb09 dataset http://boston.lti.cs.cmu.edu/data/clueweb09.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CuAPSS: A Hybrid CUDA Solution for AllPairs Similarity Search;Algorithms and Architectures for Parallel Processing;2018

2. Partitioned Similarity Search with Cache-Conscious Data Traversal;ACM Transactions on Knowledge Discovery from Data;2017-04-14

3. PL2AP;Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms;2015-11-15

4. Load balancing for partition-based similarity search;Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval;2014-07-03