This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing
October 2002 (vol. 51 no. 10)
pp. 1237-1252

Abstract—Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach.

[1] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communication Environments,” Proc. ACM SIGMOD, pp. 199-210, May 1995.
[2] D. Aksoy and M.J. Franklin, Scheduling for Large-Scale On-Demand Data Broadcasting Proc. IEEE INFOCOM Conf., pp. 651-659, Mar. 1998.
[3] D. Adolphson and T.C. Hu, “Optimal Linear Ordering,” SIAM J. Applied Math., vol. 25, pp. 403-423, 1973.
[4] A. Bar-Noy, J. Naor, and B. Schieber, “Pushing Dependent Data in Clients-Providers-Servers Systems,” Proc. MOBICOM Conf., pp. 222-230, 2000.
[5] A. Bar-Noy and Y. Shilo, Optimal Broadcasting of Two Files over an Asymmetric Channel Proc. IEEE INFOCOM Conf., pp. 267-274, Mar. 1999.
[6] Y.C. Chehadeh, A.R. Hurson, and M. Kavehrad, “Object Organization on a Single Broadcast Channel in the Mobile Computing Environment,” Multimedia Tools and Applications, vol. 9, no. 1, pp. 69-94, July 1999.
[7] Y.D. Chung and M.-H. Kim, “QEM: A Scheduling Method for Wireless Broadcast Data,” Proc. Sixth Int'l Conf. Database Systems for Advanced Applications (DASFAA), pp. 135-142, Apr. 1999.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability,New York: W.H. Freeman and Co., p. 192, p. 198, 1979, Paperback edition 1991.
[9] V. Gondhalekar, R. Jain, and J. Werth, “Scheduling on Airdisks: Efficient Access to Personalized Information Services via Periodic Wireless Data Broadcast,” Proc. Int'l Conf. Comm. (ICC), pp. 1276-1280, 1997.
[10] J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P.J. Weinberger, “Quickly Generating Billion-Record Synthetic Databases,” Proc. ACM SIGMOD, pp. 243-252, Mar. 1994.
[11] A.R. Hurson, Y.C. Chehadeh, and J. Hannan, Object Organization on Parallel Broadcast Channels in a Global Information Sharing Environment Proc. 19th IEEE Int'l Performance, Computing, and Comm. Conf., pp. 347-353, Feb. 2000.
[12] G. Herman, G. Gopal, K.C. Lee, and A. Weinreb, “The Datacycle Architecture for Very High Throughput Database Systems,” Proc. ACM SIGMOD Conf., pp. 97-103, 1987.
[13] C.-H. Hsu, G. Lee, and A.L.P. Chen, “A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels,” Proc. ACM 10th Int'l Conf. Information and Knowledge Management, pp. 303-309, 2001.
[14] C.-H. Hsu, G. Lee, and A.L.P. Chen, “Index and Data Allocation on Multiple Broadcast Channels Considering Data Access Frequencies,” Proc. Int'l Conf. Mobile Data Management, pp. 87-93, 2002.
[15] K. Hoffman and R. Kunze, LINEAR ALGEBRA. Prentice Hall, 1971.
[16] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Energy Efficient Indexing on Air,” Proc. ACM SIGMOD Conf., pp. 25-36, May 1994.
[17] T. Imielinski, S. Viswanathan, and B.R. Badrinath, Data on Air: Organization and Access IEEE Trans. Knowledge and Data Eng., vol. 9, no. 9, pp. 353-372, June 1997.
[18] S.-C. Lo and A.L.P. Chen, Optimal Index and Data Allocation in Multiple Broadcast Channels Proc. 16th Int'l Conf. Data Eng., pp. 293-702, Mar. 2000.
[19] S.C. Lo and A.L.P. Chen, “An Adaptive Access Method for Broadcast Data under an Error-Prone Mobile Environment,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 4, pp. 609-620, July/Aug. 2000.
[20] G. Lee, S.-C. Lo, and A.L.P. Chen, “Data Allocation on Wireless Broadcast Channels for Efficient Query Processing,” technical report,http://mckm.csie.ndhu.edu.twlee_research.htm , 2002.
[21] G. Lee and S.-C. Lo, “Broadcast Data Allocation for Efficient Access of Multiple Data Items in Mobile Environments,” ACM Mobile Networks and Applications (MONET), to appear.
[22] G. Lee, M.-S. Yeh, S.-C. Lo, and A.L.P. Chen, “A Strategy for Efficient Access of Multiple Data Items in Mobile Environments,” Proc. Int'l Conf. Mobile Data Management, pp. 71-78, 2002.
[23] W.C. Lee and D.L. Lee, “Using Signature Techniques for Information Filtering in Wireless and Mobile Environments,” Distributed and Parallel Databases, vol. 4, no. 3, pp. 205-227, July 1996.
[24] A. Si and H.V. Leong, “Query Optimization for Broadcast Database,” Data and Knowledge Eng. J., vol. 29, no. 3, pp. 351-380, 1999.
[25] K. Thulasiraman and M.N.S. Swamy, Graphs: Theory and Algorithms. Wiley and Sons, 1992.
[26] N.H. Vaidya and S. Hameed, “Scheduling Data Broadcast in Asymmetric Communication Environments,” J. Mobile Networks and Applications, vol. 5, pp. 171-182, 1999.
[27] K.H. Yeung and T.S. Yum, “Selective Broadcast Data Distribution Systems,” IEEE Trans. Computers, vol. 46, no. 1, pp. 100-104, Jan. 1997.

Index Terms:
Database broadcasting, query processing, access time, tuning time, broadcast program.
Citation:
Guanling Lee, Shou-Chih Lo, Arbee L.P. Chen, "Data Allocation on Wireless Broadcast Channels for Efficient Query Processing," IEEE Transactions on Computers, vol. 51, no. 10, pp. 1237-1252, Oct. 2002, doi:10.1109/TC.2002.1039850
Usage of this product signifies your acceptance of the Terms of Use.