Skip to main content
SpringerLink
Log in

Effective Data Placement for Wireless Broadcast

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast disks: Data management for asymmetric communication environments,” in Proceedings of ACM SIGMOD Conference, 1995, pp. 199–210.

  2. S. Acharya, M. Franklin, and S. Zdonik, “Disseminating updates on broadcast disks,” in Proceedings of Very Large Data Bases Conference, 1996, pp. 354–365.

  3. Y.D. Chung and M.H. Kim, “On scheduling wireless broadcast data,” Technical Report CS-TR-98-134, KAIST, Department of Computer Science, 1998.

    Google Scholar 

  4. Y.D. Chung and M.H. Kim, “An index replication scheme for wireless data broadcasting,” Journal of Systems and Software, vol.51, no.3, 2000, pp. 191–199.

    Google Scholar 

  5. J.L. Devore, Probability and Statistics for Engineering and the Sciences, 3 edition, Brooks/Cole Publishing Company, 1990.

  6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman Publishing Company, 1976.

  7. T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on air: Organization and access,” IEEE Transactions on Knowledge and Data Engineering, vol. 9, no.3, 1997, pp. 353–372.

    Google Scholar 

  8. T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Energy efficient indexing on air,” in Proceedings of ACM SIGMOD Conference, 1994, pp. 25–36.

  9. C. Su, L. Tassiulas, and V.J. Tsotras, “Broadcast scheduling for information distribution,” Wireless Networks, vol.5, no.2, 1998, pp. 137–147.

    Google Scholar 

  10. K. Tan and J.X. Yu. “Generating broadcast programs that support range queries,” IEEE Transactions on Knowledge and Data Engineering, vol. 10, no.4, 1998, pp. 668–672.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusung-dong, Yusung-gu, Taejon, 305-701, Korea

    Yon Dohn Chung

  2. Division of Computer Science, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusung-dong, Yusung-gu, Taejon, 305-701, Korea

    Myoung Ho Kim

Authors
  1. Yon Dohn Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myoung Ho Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chung, Y.D., Kim, M.H. Effective Data Placement for Wireless Broadcast. Distributed and Parallel Databases 9, 133–150 (2001). https://doi.org/10.1023/A:1018992406195

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018992406195

Search

Navigation