完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChou, AYHen_US
dc.contributor.authorYang, WPen_US
dc.contributor.authorChang, CCen_US
dc.date.accessioned2014-12-08T15:02:43Z-
dc.date.available2014-12-08T15:02:43Z-
dc.date.issued1996-04-01en_US
dc.identifier.issn0020-0255en_US
dc.identifier.urihttp://hdl.handle.net/11536/1354-
dc.description.abstractCartesian product file (CPF) has bren proposed as a good multi-attribute file structure. Although designing an optimal CPF for partial match queries (PMQs) has been proven to be NP-hard, some useful properties have been studied for PMQs to help the work. However, a good CPF for PMQs may not be beneficial for orthogonal range queries (ORQs). Therefore, in this paper, we intend to study properties that help the design of a good CPF for ORQs. We found that the problem of designing the optimal CPF for ORQs is related to the problem of finding a minimal-f N-tuple. We will also show some theories of minimal-f N-tuples and develop a method for generating a minimal-f N-tuple. Finally, we will present some properties of the optimal CPF for ORQs from the theories of minimal-f N-tuples.en_US
dc.language.isoen_USen_US
dc.titleSome properties of optimal Cartesian product files for orthogonal range queriesen_US
dc.typeArticleen_US
dc.identifier.journalINFORMATION SCIENCESen_US
dc.citation.volume90en_US
dc.citation.issue1-4en_US
dc.citation.spage91en_US
dc.citation.epage107en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
顯示於類別:期刊論文


文件中的檔案:

  1. A1996UE03400006.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。