A novel hash-based streaming scheme for energy efficient full-text search in wireless data broadcast

  • Authors:

  • Kai Yang;Yan Shi;Weili Wu;Xiaofeng Gao;Jiaofei Zhong

  • Affiliations:

  • The University of Texas at Dallas, Richardson TX;The University of Texas at Dallas, Richardson TX;The University of Texas at Dallas, Richardson TX;Georgia Gwinnett College, Lawrenceville, GA;The University of Texas at Dallas, Richardson TX

  • Venue:
  • DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Full-Text Search is one of the most important and popular query types in document retrieval systems. With the development of The Fourth Generation Wireless Network (4G), wireless data broadcast has gained a lot of interest because of its scalability, flexibility, and energy efficiencies for wireless mobile computing. How to apply full-text search to documents transmitted through wireless communications is thus a research topic of interest. In this paper, we propose a novel data streaming scheme (named Basic-Hash) with hash-based indexing and inverted list techniques to facilitate energy and latency efficient full-text search in wireless data broadcast. We are the first work utilizing hash technology for this problem, which takes much less access latency and tuning time comparing to the previous literature. We further extend the proposed scheme by merging the hashed word indices in order to reduce the total access latency (named Merged-Hash). An information retrieval protocol is developed to cope with these two schemes. The performances of Basic-Hash and Merged-Hash are examined both theoretically and empirically. Simulation results prove their efficiencies with respect to both energy consumption and access latency