1. NCCU Academic Hub
  2. 學術產出
  3. College of Informatics
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Placement of Partitioned Signature Files and Its Performance Analysis
作者 沈錳坤;李素瑛
Shan,Man-kwan;Lee,Suh-Yin
日期 1998-02
上傳時間 16-Dec-2008 16:35:27 (UTC+8)
摘要 Signature file access method is widely used in information retrieval and database. It acts as a search filter for content-based retrieval. One of the efficient organizations of signature file is Quick Filter. Quick Filter partitions the signatures into signature pages using linear hashing. While seek and latency time dominate the performance of disk access, efficient placement of the partitioned signature pages is necessary. In this paper, we investigate the placement of partitioned signature file to minimize the number of clusters pertinent to the query signature in dynamic environment. We present the placement using Gray code to minimize the number of qualified clusters. To accommodate the dynamic feature, linear hashing for partitioning the signatures into Gray code order is modified. The performance measured by the number of clusters accessed is analyzed. The formula of performance for a specific query signature is also derived. It is useful for the access cost estimation of query optimization in information retrieval. Performance analysis shows that placement using Gray code order outperforms that using binary code code.
關聯 Information Science: An International Journal, 104(3/4), 321-344
資料類型 article
DOI http://dx.doi.org/10.1016/S0020-0255(97)00062-5
dc.creator (作者) 沈錳坤;李素瑛zh_TW
dc.creator (作者) Shan,Man-kwan;Lee,Suh-Yin-
dc.date (日期) 1998-02en_US
dc.date.accessioned 16-Dec-2008 16:35:27 (UTC+8)-
dc.date.available 16-Dec-2008 16:35:27 (UTC+8)-
dc.date.issued (上傳時間) 16-Dec-2008 16:35:27 (UTC+8)-
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/14970-
dc.description.abstract (摘要) Signature file access method is widely used in information retrieval and database. It acts as a search filter for content-based retrieval. One of the efficient organizations of signature file is Quick Filter. Quick Filter partitions the signatures into signature pages using linear hashing. While seek and latency time dominate the performance of disk access, efficient placement of the partitioned signature pages is necessary. In this paper, we investigate the placement of partitioned signature file to minimize the number of clusters pertinent to the query signature in dynamic environment. We present the placement using Gray code to minimize the number of qualified clusters. To accommodate the dynamic feature, linear hashing for partitioning the signatures into Gray code order is modified. The performance measured by the number of clusters accessed is analyzed. The formula of performance for a specific query signature is also derived. It is useful for the access cost estimation of query optimization in information retrieval. Performance analysis shows that placement using Gray code order outperforms that using binary code code.-
dc.format application/en_US
dc.language enen_US
dc.language en-USen_US
dc.language.iso en_US-
dc.relation (關聯) Information Science: An International Journal, 104(3/4), 321-344en_US
dc.title (題名) Placement of Partitioned Signature Files and Its Performance Analysisen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1016/S0020-0255(97)00062-5en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1016/S0020-0255(97)00062-5en_US