Art
J-GLOBAL ID:201702218766714593   Reference number:17A0066168

Algorithm for k-Closest Pair Query Based on Two Sets on MapReduce Framework

MAPREDUCEフレームワークにおける2つの集合間のK最近傍探索アルゴリズム【JST・京大機械翻訳】
Author (2):
Material:
Volume: 37  Issue:Page: 483-487  Publication year: 2016 
JST Material Number: C2136A  ISSN: 1000-1220  CODEN: XWJXEH  Document type: Article
Article type: 原著論文  Country of issue: China (CHN)  Language: CHINESE (ZH)
Abstract/Point:
Abstract/Point
Japanese summary of the article(about several hundred characters).
All summary is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
For k-CPQ( Close Pair Query) b...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=17A0066168&from=J-GLOBAL&jstjournalNo=C2136A") }}
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
, 【Automatic Indexing@JST】
Author keywords (4):
JST classification (2):
JST classification
Category name(code) classified by JST.
Computer system development  ,  Graphic and image processing in general 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page