Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
“Data in your face”: push technology in perspective
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
DBIS-toolkit: adaptable middleware for large scale data delivery
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Scalable feedback for large groups
IEEE/ACM Transactions on Networking (TON)
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The content and access dynamics of a busy Web site: findings and implications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Dynamic content acceleration: a caching solution to enable scalable dynamic Web page generation
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
High performance data broadcasting systems
Mobile Networks and Applications
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Middle-tier database caching for e-business
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DBCache: database caching for web application servers
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Introduction to Algorithms
A new hybrid broadcast scheduling algorithm for asymmetric communication systems
ACM SIGMOBILE Mobile Computing and Communications Review
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Multicast Bandwidth Advantage in Serving a Web Site
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The dark side of the Web: an open proxy's view
ACM SIGCOMM Computer Communication Review
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Balancing performance and data freshness in web database servers
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Layered multicast scheduling for the L∞ objective
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Hybrid dissemination based scalable and adaptive context delivery for ubiquitous computing
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Adaptive hybrid data broadcast for wireless converged networks
MRCS'06 Proceedings of the 2006 international conference on Multimedia Content Representation, Classification and Security
| Hi-index | 0.00 |
A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses multicast push to scalably deliver the most popular data, and reserves traditional unicast pull for delivery of less popular data. However, such a hybrid scheme introduces a variety of data management problems at the server. In this paper we examine three of these problems: the push popularity problem, the document classification problem, and the bandwidth division problem. The push popularity problem is to estimate the popularity of the documents in the web site. The document classification problem is to determine which documents should be pushed and which documents must be pulled. The band-width division problem is to determine how much of the server bandwidth to devote to pushed documents and how much of the server bandwidth should be reserved for pulled documents. We propose simple and elegant solutions for these problems. We report on experiments with our system that validate our algorithms.