Fast_Set_Intersection_in_Memory

Fast_Set_Intersection_in_Memory

ID:39754095

大小:1.31 MB

页数:12页

时间:2019-07-10

Fast_Set_Intersection_in_Memory_第1页
Fast_Set_Intersection_in_Memory_第2页
Fast_Set_Intersection_in_Memory_第3页
Fast_Set_Intersection_in_Memory_第4页
Fast_Set_Intersection_in_Memory_第5页
资源描述:

《Fast_Set_Intersection_in_Memory》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

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-caseefficientway.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

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。
相关文章
更多
相关标签