This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Exploiting Data Mining Techniques for Broadcasting Data in Mobile Computing Environments
November/December 2002 (vol. 14 no. 6)
pp. 1387-1399

Abstract—Mobile computers can be equipped with wireless communication devices that enable users to access data services from any location. In wireless communication, the server-to-client (downlink) communication bandwidth is much higher than the client-to-server (uplink) communication bandwidth. This asymmetry makes the dissemination of data to client machines a desirable approach. However, dissemination of data by broadcasting may induce high access latency in case the number of broadcast data items is large. In this paper, we propose two methods aiming to reduce client access latency of broadcast data. Our methods are based on analyzing the broadcast history (i.e., the chronological sequence of items that have been requested by clients) using data mining techniques. With the first method, the data items in the broadcast disk are organized in such a way that the items requested subsequently are placed close to each other. The second method focuses on improving the cache hit ratio to be able to decrease the access latency. It enables clients to prefetch the data from the broadcast disk based on the rules extracted from previous data request patterns. The proposed methods are implemented on a Web log to estimate their effectiveness. It is shown through performance experiments that the proposed rule-based methods are effective in improving the system performance in terms of the average latency as well as the cache hit ratio of mobile clients.

[1] J. Jing, A. Helal, and A. Elmagarmid, “Client-Server Computing in Mobile Environments,” ACM Computing Surveys, vol. 31, no. 2, pp. 117-157, June 1999.
[2] S. Zdonik, M. Franklin, R. Alonso, and S. Acharya, “Are‘Disks in the Air’Just Pie in the Sky,” Proc. IEEE Workshop Mobile Computing Systems and Applications, Dec. 1994.
[3] S. Acharya, M. Franklin, and S. Zdonik, “Balancing Push and Pull for Data Broadcast,” Proc. ACM SIGMOD Conf., pp. 183-194, May 1997.
[4] K. Stathatos, N. Roussopoulos, and J.S. Baras, “Adaptive Data Broadcast in Hybrid Networks,” Proc. 23rd Int'l Conf. Very Large Data Bases, pp. 326-335, 1997.
[5] 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.
[6] A.P. Sistla, O. Wolfson, and Y. Huang, “Minimization of Communication Cost Through Caching in Mobile Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 4, pp. 378-389, Apr. 1998.
[7] 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.
[8] S. Acharya, M. Franklin, and S. Zdonik, “Prefetching from a Broadcast Disk,” Proc. 12th Int'l Conf. Data Eng., pp. 276-285, Feb. 1996.
[9] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[10] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACM-SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
[11] M. Houtsma and A. Swami, “Set-Oriented Mining of Association Rules,” technical report, IBM Almaden Research Center, San Jose, Calif., Oct. 1993.
[12] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng., pp. 3-14, Mar. 1995.
[13] A. Bouguettaya, “On-Line Clustering,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 2, 1996.
[14] C. Bettini, X.S. Wang, S. Jajodia, and J.-L. Lin, “Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 2, 1998.
[15] H. Mannila, H. Toivonen, and A.I. Verkamo, “Discovery of Frequent Episodes in Event Sequences,” Proc. First Int'l Conf. Knowledge Discovery and Data Mining, Aug. 1995.
[16] B. Mobasher, N. Jain, E.-H. Han, and J. Srivastana, “Web Mining: Pattern Discovery from World Wide Web Transactions,” Technical Report 96-050, Dept. of Computer Science, Univ. of Minnesota, Sept. 1996.
[17] K.P. Joshi, A. Joshi, Y. Yesha, and R. Krishnapuram, “Warehousing and Mining Web Logs,” Proc. ACM CIKM Second Workshop Web Information and Data Management (CIKM '99), 1999.
[18] A. Joshi and R. Krishnapuram, “On Mining Web Access Logs,” Proc. SIGMOD Workshop Research Issues on Data Mining and Knowledge Discovery (DMKD), 2000.
[19] O.R. Zaane, M. Xin, and J. Han, Discovering Web Access Patterns and Trends by Applying OLAP and Data Mining Technology on Web Logs Proc. Advances in Digital Libraries (ADL '98), pp. 19-29, Apr. 1998.
[20] D.W. Cheung, V.T. Ng, W. Fu, and Y. Fu, “Efficient Mining Association Rules in Distributed Databases,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 6, pp. 911-922, Dec. 1996.
[21] D. Cheung, J. Han, V. Ng, and C.Y. Wong, Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique Proc. 1996 Int'l Conf. Data Eng., pp. 106-114, Feb. 1996.
[22] E.-H. Han, G. Karypis, V. Kumar, and B. Mobasher, “Clustering Based on Association Rule Hypergraphs,” Proc. SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD '97), 1997.
[23] B.W. Kerninghan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” Bell System Technical J., vol. 49, no. 2, 1970.
[24] U.V. Catalyurek and C. Aykanat, “Hypergraph-Partitioning Based Decompostion for Parallel Sparse-Matrix Vector Multiplication,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 673-693, 1999.
[25] K. Thulasiraman and M.N.S. Swamy, Graphs: Theory and Algorithms. Wiley and Sons, 1992.
[26] T. Imielinski and B.R. Badrinath, “Wireless Computing: Challenges in Data Management,” Comm. ACM, vol. 37, no. 10, Oct. 1994.
[27] T. Imielinski and B.R. Badrinath, “Querying in Highly Mobile and Distributed Environment,” Proc. 18th Int'l Conf. Vary Large Data Bases, pp. 41-52, Aug. 1992.
[28] University of California at Irvine Machine Learning Repository,http://tim.menzies.com/pdf/95thesis.pdfhttp:/ /tim.menzies.com/pdf/00fastre.pdfhttp:/ /www.ics.uci.edu~mlearn, 2002.

Index Terms:
Broadcast disks, broadcast histories, mobile databases, data mining, prefetching, broadcast organization.
Citation:
Yücel Saygin, Özgür Ulusoy, "Exploiting Data Mining Techniques for Broadcasting Data in Mobile Computing Environments," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 6, pp. 1387-1399, Nov.-Dec. 2002, doi:10.1109/TKDE.2002.1047775
Usage of this product signifies your acceptance of the Terms of Use.