|
|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/279
|
| Title: | Indexing techniques for wireless data broadcast under data clustering and scheduling |
| Authors: | Hu, Qinglong
Lee, Wang-Chien
Lee, Dik Lun |
| Keywords: | Indexing techniques
Hybrid indexing
Index tree
Data clustering |
| Issue Date: | 1999 |
| Citation: | Proceedings of the Eighth International Conference on Information and Knowledge Management (CIKM '99) , Kansas City, Missouri, USA, 2-6 Nov. 1999, ACM, New York, USA, 1999, p. 351-358 |
| Abstract: | This paper investigates power conserving indexing techniques for data disseminated on a broadcast channel. A hybrid indexing method combining strengths of the signature and the index tree techniques is presented. Different from previous studies, our research takes into consideration two important data organization factors, namely, clustering and scheduling. Cost models for index, signature and hybrid methods are derived by taking into account various data organizations accommodating these two factors. Based on our analytical comparisions, the signature and the hybrid indexing techniques are the best choices for power conserving indexing of various data organizations on wireless broadcast channels. |
| Rights: | © ACM, 1999. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the Eighth International Conference on Information and Knowledge Management (CIKM '99) , Kansas City, Missouri, USA, 2-6 Nov. 1999, ACM, New York, USA, 1999, p. 351-358 |
| URI: | http://hdl.handle.net/1783.1/279 |
| Appears in Collections: | CSE Journal/Magazine Articles
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| cikm99clus2Bsch.pdf | | 229Kb | Adobe PDF | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
