Fractal-Tree-Technology-and-the-Art-of-Indexing

Fractal-Tree-Technology-and-the-Art-of-Indexing

ID:40070760

大小:1.38 MB

页数:57页

时间:2019-07-19

Fractal-Tree-Technology-and-the-Art-of-Indexing_第1页
Fractal-Tree-Technology-and-the-Art-of-Indexing_第2页
Fractal-Tree-Technology-and-the-Art-of-Indexing_第3页
Fractal-Tree-Technology-and-the-Art-of-Indexing_第4页
Fractal-Tree-Technology-and-the-Art-of-Indexing_第5页
资源描述:

《Fractal-Tree-Technology-and-the-Art-of-Indexing》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、®FractalTreeTechnologyOverviewTheArtofIndexingMartínFarach-ColtonCo-founder&ChiefTechnologyOfficerNotallindexingisthesameB-treeisthebasisforalmostallDBsystems•Datastructureinventedin1972•Hasnotkeptupwithhardwaretrends‣Workspoorlyonmodernrotationaldisk

2、s‣WorkspoorlyonSSDFractalTreeIndexesisthebasisofTokuDB•Scaleswithhardware•FastIndexing➔MoreIndexing➔FasterQueries•GreatCompression•NoFragmentation•ReducedwearonSSDsTheArtofIndexing®HowdoFractalTreeIndexesoutperformB-trees?HowdoFractalTreeIndexesoutper

3、formB-trees?First,somefactsaboutstoragesystemsStorageisquirkyHarddisksareslowforrandomI/ObutfastforsequentialI/ODifferencecausesproblemslikefragmentation,...TheArtofIndexing®StorageisquirkyHarddisksareslowforrandomI/ObutfastforsequentialI/OSSDsarefast

4、forDifferencecausesproblemsrandomI/Obutexpensiveforlikefragmentation,...sequential.Garbagecollectioncausesartefacts:increasedwear,writecliffs...TheArtofIndexing®Storage♡BigReadsandWritesBigI/OsTheArtofIndexing®Storage♡BigReadsandWritesHardDisks:NoFrag

5、mentationBigI/OsTheArtofIndexing®Storage♡BigReadsandWritesHardDisks:NoFragmentationSSDs:LessGarbageCollection&WearBigI/OsTheArtofIndexing®Storage♡BigReadsandWritesHardDisks:NoFragmentationSSDs:LessGarbageCollection&WearBigI/OsButyouonlygetthegoodiesif

6、eachI/OhaslotsofnewbytesTheArtofIndexing®Storage♡BigReadsandWritesHardDisks:NoFragmentationSSDs:LessGarbageCollection&WearBigI/OsButyouonlygetthegoodiesifeachI/OhaslotsofnewbytesIfyoureadabigblock,changeonebyte,thenwriteit,yougetterriblewearproblemsTh

7、eArtofIndexing®Storage♡BigReadsandWritesHardDisks:NoFragmentationSSDs:LessGarbageCollection&WearBigI/OsBoth:BetterButyouonlygetthegoodiesifCompressioneachI/OhaslotsofnewbytesIfyoureadabigblock,changeonebyte,thenwriteit,yougetterriblewearproblemsTheArt

8、ofIndexing®Dataisbig,RAMisSmallCachingisgreat•Butyoucan’tcacheallyourdata•Forstuffnotinmemory,youhavetogotodiskGoal:DothebestwecanforthestuffondiskRAMDataTheArtofIndexing®Now,What’saB-tree?&aFractalTreeIndexWhat’saB-tree?BSearchTreeBBB......BB

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

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

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