HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/271
Title: A comparison of indexing methods for data broadcast on the air
Authors: Hu, Qinglong
Lee, Dik Lun
Lee, Wang-Chien
Keywords: Indexing methods
Data broadcast
Power conservation
Issue Date: 1998
Citation: Proceedings of the 12th International Conference on Information Networking (ICOIN-12), Tokyo, Japan, 21-23 Jan 1998, IEEE Computer Society, Los Alamitos, CA, USA, 1998, p. 656-659
Abstract: Several indexing techniques for data broadcast on the air have been proposed for power conservation on mobile computers in the past few years. Indexing techniques for broadcast channels can save battery power (estimated by tune-in time) while incurring only limited overhead on access time. In this paper, we compare indexing techniques based on the index tree and the signature methods and find that both methods prevail under different circumstances.
Rights: © 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
URI: http://hdl.handle.net/1783.1/271
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
icoin12.pdf63KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.