完整後設資料紀錄
DC 欄位語言
dc.contributor.authorShieh, WYen_US
dc.contributor.authorChung, CPen_US
dc.date.accessioned2014-12-08T15:26:14Z-
dc.date.available2014-12-08T15:26:14Z-
dc.date.issued2003en_US
dc.identifier.isbn1-932415-09-2en_US
dc.identifier.urihttp://hdl.handle.net/11536/18624-
dc.description.abstractMany information retrieval systems use the inverted file as indexing structure. The inverted file, however, is not suited to supporting incremental updates when new documents are to be added to an existing collection. Most studies suggest dealing with this problem by sparing free space in an inverted file for future updates. In this paper, we propose a run-time statistics-based approach to allocate the spare space. This approach estimates the space requirements in an inverted file using only a little most recent statistical data on space usage and document update request rate. For best indexing speed and space efficiency, the amount of the spare space to be allocated is determined by adaptively balancing the trade-offs between reorganization count and space utilization. Simulation results show that the proposed space-sparing approach significantly avoids reorganization in updating an inverted-file, and in the meantime, unused free space can be well controlled such that the file access speed is not affected.en_US
dc.language.isoen_USen_US
dc.subjectinformation retrievalen_US
dc.subjectinverted fileen_US
dc.subjectincremental updateen_US
dc.subjectstatistical approachen_US
dc.titleA statistics-based approach to incrementally update inverted filesen_US
dc.typeProceedings Paperen_US
dc.identifier.journalIKE'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2en_US
dc.citation.spage38en_US
dc.citation.epage43en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000187118100008-
顯示於類別:會議論文