Towards an efficient static scheduling scheme for delivering queries to heterogeneous clusters in the similarity search problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Towards an efficient static scheduling scheme for delivering queries to heterogeneous clusters in the similarity search problem

Published:2013-12-31 Issue:2 Volume:70 Page:527-540
ISSN:0920-8542
Container-title:The Journal of Supercomputing
language:en
Short-container-title:J Supercomput

Author:

Uribe-Paredes Roberto,Cazorla Diego,Arias Enrique,Sánchez José L.

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11227-013-1079-4.pdf

Reference28 articles.

1. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL (2001) Searching in metric spaces. ACM Comput Surv 33(3):273–321

2. Kalantari I, McDonald G (1983) A data structure and an algorithm for the nearest point problem. IEEE Trans Softw Eng 9(5):631–634

3. Uhlmann JK (1991) Satisfying general proximity/similarity queries with metric trees. Inf Process Lett 40:175–179

4. Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd international conference on VLDB, pp 426–435

5. Brin S (1995) Near neighbor search in large metric spaces. In: Proceedings of the 21st VLDB conference, pp 574–584

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

1. An efficiency study of a pivot-based algorithm for similarity search on a heterogeneous platform;The Journal of Supercomputing;2016-09-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP