Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf

Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf

ID:34974051

大小:484.54 KB

页数:12页

时间:2019-03-15

Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf_第1页
Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf_第2页
Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf_第3页
Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf_第4页
Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf_第5页
资源描述:

《Lookup Tables Fine-Grained Partitioning for Distributed Databases.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、LookupTables:Fine-GrainedPartitioningforDistributedDatabasesAubreyL.Tatarowicz#1,CarloCurino#2,EvanP.C.Jones#3,SamMadden#4#MassachusettsInstituteofTechnology,USA1altat@alum.mit.edu2krl@yahoo-inc.com3evanj@csail.mit.edu4madden@csail.mit.eduAbstract—ThestandardwaytoscaleadistributedO

2、LTPe.g.,orderprocessingapplicationswhereordersareissuedtoDBMSistohorizontallypartitiondataacrossseveralnodes.suppliersorbrokersthatservicemanycustomers(asmodeledIdeally,thisresultsineachquery/transactionbeingexecutedatbyTPC-E)ormessageboardswhereuserspostonmultiplejustonenode,toavo

3、idtheoverheadofdistributionandallowforums(withqueriestosearchforpostsbyforumoruser).thesystemtoscalebyaddingnodes.Forsomeapplications,simplestrategiessuchashashingonprimarykeyprovidethisOnesolutiontothisproblemistouseafine-grainedproperty.Unfortunately,formanyapplications,includings

4、ocialpartitioningstrategy,wheretuplesareallocatedtopartitionsnetworkingandorder-fulfillment,simplepartitioningschemesinawaythatexploitsrelationshipsbetweenrecords.Inourappliedtomany-to-manyrelationshipscreatealargefractionsocialnetworkingexample,auserandhisorherfriendscanofdistribut

5、edqueries/transactions.Whatisneededisafine-beco-locatedsuchthatsomequeriesgotojustonepartition.grainedpartitioning,whererelatedindividualtuples(e.g.,cliquesoffriends)areco-locatedtogetherinthesamepartition.Thus,acarefulassignmentoftuplestopartitionscanreduceMaintainingafine-grainedpa

6、rtitioningrequiresstoringtheoreliminatedistributedtransactions,allowingaworkloadtolocationofeachtuple.Wecallthismetadataalookuptable.Webeefficientlyscaledacrossmultiplemachines.presentadesignthatefficientlystoresverylargetablesandmain-Asecondproblemwithtraditionalpartitioningisthatwh

7、iletainsthemasthedatabaseismodified.Weshowtheyimprovequeriesonthepartitioningattributegotoasinglepartition,scalabilityforseveraldifficulttopartitiondatabaseworkloads,includingWikipedia,Twitter,andTPC-E.Ourimplementationqueriesonotherattributesmustbebroadcasttoallpartitions.provides40

8、%to300%betterthroughputont

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

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

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