Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Practical prefetching via data compression
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Using speculation to reduce server load and service time on the WWW
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Using predictive prefetching to improve World Wide Web latency
ACM SIGCOMM Computer Communication Review
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Web prefetching between low-bandwidth clients and proxies: potential and performance
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient Data Mining for Path Traversal Patterns
IEEE Transactions on Knowledge and Data Engineering
Fido: A Cache That Learns to Fetch
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Determining WWW User's Next Access and Its Application to Pre-fetching
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Web Mining: Information and Pattern Discovery on the World Wide Web
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Exploiting Web Log Mining for Web Cache Enhancement
WEBKDD '01 Revised Papers from the Third International Workshop on Mining Web Log Data Across All Customers Touch Points
Guest editorial: special issue on a decade of mining the Web
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
The success of the World Wide Web measured in terms of the number of its users and of the resulting traffic increase is only commensurate to the patience required when sitting in front of one's computer, waiting for a document to be down-loaded. If one could identify the typical access patterns for a set of documents on a Web server, the server could use or extend the existing protocols to accordingly pre-fetch or push documents to the browsers and proxy servers. In this paper, we present and evaluate a strategy for making Web servers "pushier". Which document is to be pushed is determined by a set of association rules mined from a sample of the access log of the Web server. Once a rule of the form "Document A → Document B" has been identified and selected, the Web server decides to push "Document2" if "Document1" is requested. The strategy is individual user oriented while not ignoring the aggregate perspective. We evaluate the effectiveness and the cost of such a strategy for two architectures: a two tier "Web server / Web browser" architecture, and a three tier "Web server / proxy server / Web browser" architecture. We consider different settings in the architectures as well as refinements of the strategy taking into account the size of the documents.