Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/17880
DC FieldValueLanguage
dc.contributor.advisor張真誠zh_TW
dc.contributor.advisorZHANG, ZHEN-CHENGen_US
dc.contributor.author呂迪富zh_TW
dc.contributor.authorLU, DI-FUen_US
dc.date1988zh_TW
dc.date.accessioned2014-06-06T07:02:22Z-
dc.date.available2014-06-06T07:02:22Z-
dc.identifier.urihttp://hdl.handle.net/11455/17880-
dc.description.abstract在輔助儲存裝置中把相似的記錄聚集在一起放入同一個區塊(Bucket)中,可以減少 所需擷取的區塊數。因此,對於一個查詢(Qucket)而言,其所參考到的記錄儘可能 地存放在最少的區塊中。Lee 和Tseng 曾提出以多鍵語排序法(multi-key sorting )將相似的記錄叢聚在一起,但是他們所提出的方法只適於處理全等性部份吻合查詢 (Equally likely partial match queries)的檔案組織問題。 本篇論文主要是利用多鍵語排序法建構適於非全等性查詢(Not equally likely que ries)的檔案。實驗結果顯示此法的確可行。例如,對於一組聯合國投票案的資料, 經由我們的檔案組織法安排之後,其平均回應時間減少至75.0%;而對於另一組蛇毒 資料其平均回應時間更減少至64.7%。zh_TW
dc.language.isoen_USzh_TW
dc.publisher應用數學研究所zh_TW
dc.subjectMULTI-KEY-SORTINGen_US
dc.subject多鍵語排序法zh_TW
dc.subjectNOT-EQUALLY-LIKELY-QUERIESen_US
dc.subjectSORTINGen_US
dc.subjectQUERYen_US
dc.subjectFILE-ORGANIZATIONen_US
dc.subject非全等性查詢zh_TW
dc.subject排序法zh_TW
dc.subject查詢zh_TW
dc.subject檔案組織zh_TW
dc.title以多鍵語排序法建構適於非全等性查詢的檔案組織法zh_TW
dc.titleMulti-key sorting as a file organization scheme when queries are not equally likelyen_US
dc.typeThesis and Dissertationzh_TW
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en_US-
item.fulltextno fulltext-
item.grantfulltextnone-
item.openairetypeThesis and Dissertation-
Appears in Collections:應用數學系所
Show simple item record
 
TAIR Related Article

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.