Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Exploiting Data Mining Techniques for Broadcasting Data in Mobile Computing Environments
IEEE Transactions on Knowledge and Data Engineering
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
Bridging the Gap between Response Time and Energy-Efficiency in Broadcast Schedule Design
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
A Tool for Extracting XML Association Rules
ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
Adaptive Data Access in Broadcast-Based Wireless Environments
IEEE Transactions on Knowledge and Data Engineering
Bottom-up discovery of frequent rooted unordered subtrees
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.