Making B -Trees Cache Conscious in Main Memory.pdf

Making B -Trees Cache Conscious in Main Memory.pdf

ID:34974061

大小:397.22 KB

页数:12页

时间:2019-03-15

Making B -Trees Cache Conscious in Main Memory.pdf_第1页
Making B -Trees Cache Conscious in Main Memory.pdf_第2页
Making B -Trees Cache Conscious in Main Memory.pdf_第3页
Making B -Trees Cache Conscious in Main Memory.pdf_第4页
Making B -Trees Cache Conscious in Main Memory.pdf_第5页
资源描述:

《Making B -Trees Cache Conscious in Main Memory.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、MakingB+-TreesCacheConsciousinMainMemoryJunRaoKennethA.RossColumbiaUniversityColumbiaUniversityjunr@cs.columbia.edukar@cs.columbia.eduAbstract+CSB-Treespreallocatespaceforthefullnodegroupandthusreducethesplitcost.OurperformancestudiesPreviousresearchhasshownthat

2、cachebehaviorisim-+showthatCSB-Treesareusefulforawiderangeofportantformainmemoryindexstructures.Cachecon-applications.sciousindexstructuressuchasCacheSensitiveSearchTrees(CSS-Trees)performlookupsmuchfasterthanbinarysearchandT-Trees.However,CSS-Treesare1Introducti

3、ondesignedfordecisionsupportworkloadswithrelatively10000+CPUPerformance(60%/yr)staticdata.AlthoughB-Treesaremorecachecon-DRAMPerformance(10%/yr)sciousthanbinarysearchandT-Trees,theirutilization1000ofacachelineislowsincehalfofthespaceisused100tostorechildpointers.

4、Nevertheless,forapplications+thatrequireincrementalupdates,traditionalB-Trees10performwell.performanceimprovement+OurgoalistomakeB-Treesascacheconscious119801985199019952000asCSS-TreeswithoutincreasingtheirupdatecosttooFigure1:CPU-memoryPerformanceImbalancemuch.W

5、eproposeanewindexingtechniquecalled++CacheSensitiveB-Trees"(CSB-Trees).ItisaAsrandomaccessmemorygetscheaper,itbe-+variantofB-Treesthatstoresallthechildnodesofanycomesincreasinglya ordabletobuildcomputersgivennodecontiguously,andkeepsonlytheaddressofwithlargemain

6、memories.TherecentAsilomarthe rstchildineachnode.TherestofthechildrencanReport"([BBC+98])predicts:Withintenyears,itbefoundbyaddingano settothataddress.Sinceonlywillbecommontohaveaterabyteofmainmemoryonechildpointerisstoredexplicitly,theutilizationof+servingasab

7、u erpoolforahundred-terabyteacachelineishigh.CSB-Treessupportincremental+database.AllbutthelargestdatabasetableswillupdatesinawaysimilartoB-Trees.+beresidentinmainmemory."ButmainmemoryWealsointroducetwovariantsofCSB-Trees.+dataprocessingisnotassimpleasincreasingt

8、heSegmentedCSB-Treesdividethechildnodesintobu erpoolsize.Animportantissueiscachebe-segments.Nodeswithinthesamesegmentarestoredcontiguouslyandonlypointerstotheb

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

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

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