天津大学《数据库管理系统》课件Ch8_Storage_Indexing_Overview-95.pptVIP

OverviewofStorageandIndexingChapter8“Howindex-learningturnsnostudentpaleYetholdstheeelofsciencebythetail.”--AlexanderPope(1688-1744)

DataonExternalStorageDisks:CanretrieverandompageatfixedcostButreadingseveralconsecutivepagesismuchcheaperthanreadingtheminrandomorderTapes:CanonlyreadpagesinsequenceCheaperthandisks;usedforarchivalstorageFileorganization:Methodofarrangingafileofrecordsonexternalstorage.Recordid(rid)issufficienttophysicallylocaterecordIndexesaredatastructuresthatallowustofindtherecordidsofrecordswithgivenvaluesinindexsearchkeyfieldsArchitecture:Buffermanagerstagespagesfromexternalstoragetomainmemorybufferpool.Fileandindexlayersmakecallstothebuffermanager.

AlternativeFileOrganizationsManyalternativesexist,eachidealforsomesituations,andnotsogoodinothers:Heap(randomorder)files:Suitablewhentypicalaccessisafilescanretrievingallrecords.SortedFiles:Bestifrecordsmustberetrievedinsomeorder,oronlya`range’ofrecordsisneeded.Indexes:Datastructurestoorganizerecordsviatreesorhashing.Likesortedfiles,theyspeedupsearchesforasubsetofrecords,basedonvaluesincertain(“searchkey”)fieldsUpdatesaremuchfasterthaninsortedfiles.

IndexesAnindexonafilespeedsupselectionsonthesearchkeyfieldsfortheindex.Anysubsetofthefieldsofarelationcanbethesearchkeyforanindexontherelation.Searchkeyisnotthesameaskey(minimalsetoffieldsthatuniquelyidentifyarecordinarelation).Anindexcontainsacollectionofdataentries,andsupportsefficientretrievalofalldataentriesk*withagivenkeyvaluek.Givendataentryk*,wecanfindrecordwithkeykinatmostonediskI/O.(Detailssoon…)

B+TreeIndexesLeafpagescontaindataentries,andarechained(prevnext)Non-leafpageshaveindexentries;onlyusedtodirectsearches:P0K1P1K2P2KmPmindex