Fast_Set_Intersection_in_Memory

Fast_Set_Intersection_in_Memory

ID:39754095

大?。?.31 MB

頁(yè)數(shù):12頁(yè)

時(shí)間:2019-07-10

Fast_Set_Intersection_in_Memory_第1頁(yè)
Fast_Set_Intersection_in_Memory_第2頁(yè)
Fast_Set_Intersection_in_Memory_第3頁(yè)
Fast_Set_Intersection_in_Memory_第4頁(yè)
Fast_Set_Intersection_in_Memory_第5頁(yè)
資源描述:

《Fast_Set_Intersection_in_Memory》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫(kù)。

1、FastSetIntersectioninMemoryBolinDingArndChristianKonig¨UniversityofIllinoisatUrbana-ChampaignMicrosoftResearch201N.GoodwinAvenueOneMicrosoftWayUrbana,IL61801,USARedmond,WA98052,USAbding3@uiuc.educhrisko@microsoft.comABSTRACTrithmsbecomepossible,whichoftenoutperforminvertedindexes;e.g.,usinghash-ba

2、seddictionaries,intersectingtwosetsL1,L2SetintersectionisafundamentaloperationininformationretrievalrequiresexpectedtimeO(min(jL1j;jL2j)),whichisafactorofanddatabasesystems.Thispaperintroduceslinearspacedatastruc-(log(1+max(jL1j=jL2j;jL1j=jL2j)))betterthanthebestpos-turestorepresentsetssuchthatth

3、eirintersectioncanbecomputedsibleworst-caseperformanceofcomparison-basedalgorithms[6].inaworst-caseef?cientway.Ingeneral,givenk(preprocessed)Inthiswork,weproposenewsetintersectionalgorithmsaimedatsets,withtotallynelements,wewillshowhowtocomputetheirpfastperformance.Theseoutperformthecompetingtechn

4、iquesforintersectioninexpectedtimeO(n=w+kr),whereristhein-mostinputsandarealsorobustinthat–forinputswheretheyaretersectionsizeandwisthenumberofbitsinamachine-word.Innotoptimal–theyareclosetothebest-performingalgorithm.Theaddition,weintroduceaverysimpleversionofthisalgorithmthattradeoffforthisgaini

5、saslightincreaseinthesizeofthedatastruc-hasweakerasymptoticguaranteesbutperformsevenbetterinprac-tures,whencomparedtoaninvertedindex;however,inuser-facingtice;bothalgorithmsoutperformthestateofthearttechniquesforscenarioswherelatencyiscrucial,thistradeoffisoftenacceptable.bothsyntheticandrealdatas

6、etsandworkloads.1.1Contributions1.INTRODUCTIONOurapproachleveragestwokeyobservations:(a)IfwisthesizeFastprocessingofsetintersectionsisakeyoperationinmany(inbits)ofamachine-word,wecanencodeasetfromauniversequeryprocessingtasksinthecontextofdatabasesandinformationofwelementsinasinglemachineword,allo

7、wingforveryfastin-retrieval.Forexample,inthecontextofdatabases,setintersectionstersections.(b)Forthedatadistributionsseeninmanyreal-lifeex-areusedinthecontextofvariousformsofdatamining,textanalyt-amples(inparticu

當(dāng)前文檔最多預(yù)覽五頁(yè),下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁(yè),下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動(dòng)畫(huà)的文件,查看預(yù)覽時(shí)可能會(huì)顯示錯(cuò)亂或異常,文件下載后無(wú)此問(wèn)題,請(qǐng)放心下載。
2. 本文檔由用戶(hù)上傳,版權(quán)歸屬用戶(hù),天天文庫(kù)負(fù)責(zé)整理代發(fā)布。如果您對(duì)本文檔版權(quán)有爭(zhēng)議請(qǐng)及時(shí)聯(lián)系客服。
3. 下載前請(qǐng)仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動(dòng)等原因無(wú)法下載或下載錯(cuò)誤,付費(fèi)完成后未能成功下載的用戶(hù)請(qǐng)聯(lián)系客服處理。
相關(guān)文章
更多
相關(guān)標(biāo)簽