Abstract
Mobile databases are becoming more available and thus are drawing more attention from both research and industrial communities. They are currently being widely used in devices such as cell phones, hand-held devices, and notebook computers, among others. Broadcasting is a scalable way to send data from a server to multiple clients. Broadcasting algorithms must be constructed in a way that minimizes the average waiting time for clients. XML is a new standard for representing data in a hierarchical structure, and has many advantages over relational representations due to its portability, flexibility, readability, and customizability. XML has recently been deployed onto many mobile devices; thus a new kind of broadcasting algorithm should be constructed to address the unique characteristics of the way XML databases are queried and accessed. In this paper, we presented a new kind of broadcasting algorithm (BA) by utilizing association-rules in clients’ request trends. We implemented three BAs: namely, Exhaustive, Recursive, and Greedy. We tested and compared our BAs with the conventional BAs: namely Sequential and Popularity. The experimental results show that our BAs utilizing association rules perform better than the conventional BAs in both skewed-request situations and requests with association-rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Acharya, S., Alonso, R., Franklin, M.J., Zdonik, S.B.: Broadcast disks: Data management for asymmetric communications environments. In: SIGMOD Conference, pp. 199–210 (1995)
Braga, D., Campi, A., Ceri, S., Klemettinen, M., Lanzi, P.L.: A tool for extracting xml association rules. In: ICTAI, p. 57 (2002)
Ganesh, A., Kermarrec, A., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols (2003)
Lin, M.-J., Marzullo, K., Masini, S.: Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small networks. Technical Report CS1999-0637, 18 (1999)
Saygin, Y., Ulusoy, Ö.: Exploiting data mining techniques for broadcasting data in mobile computing environments. IEEE Transactions on Knowledge and Data Engineering 14(6), 1387–1399 (2002)
Xuan, P., Sen, S., González, O., Fernandez, J., Ramamritham, K.: Broadcast on demand: Efficient and timely dissemination of data in mobile environments. In: IEEE Real Time Technology and Applications Symposium, pp. 38–48 (1997)
Yang, X.: Adaptive data access in broadcast-based wireless environments. IEEE Transactions on Knowledge and Data Engineering 17(3), 326–338 (2005)
Yee, W.G., Navathe, S.B., Omiecinski, E., Jermaine, C.: Bridging the gap between response time and energy-efficiency in broadcast schedule design. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 572–589. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chenier, C., Jun, J.J., Zhang, J., Özyer, T., Alhajj, R. (2006). Association-Rules Mining Based Broadcasting Approach for XML Data. In: Yakhno, T., Neuhold, E.J. (eds) Advances in Information Systems. ADVIS 2006. Lecture Notes in Computer Science, vol 4243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890393_22
Download citation
DOI: https://doi.org/10.1007/11890393_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46291-0
Online ISBN: 978-3-540-46292-7
eBook Packages: Computer ScienceComputer Science (R0)