Quality of service and electronic newspaper: The etel solution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1752, Issue , 2000, Pages 472-496

  Issarny, Valérie ^a   Banâtre, Michel ^a   Charpiot, Boris ^a   Menaud, Jean Marc ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT-SERVER DISTRIBUTED SYSTEMS; COMMERCIAL SETTINGS; CONTENT QUALITIES; DESIGN AND IMPLEMENTATIONS; DESIGN OBJECTIVES; DISTRIBUTED SYSTEMS; ELECTRONIC EDITIONS; LOAD BALANCING STRATEGY;

DESIGN; QUALITY OF SERVICE;

NEWSPRINT;

EID: 22844455177     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46475-1_20     Document Type: Article

References (29)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. ACM SIGMOD, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th International Conference on Very Large DataBases, 1994.
3. A. Bestavros. Speculative data dissemination and service to reduce server load, network traffic and service time for distributed information systems. In Proc. of the 1996 International Conference on Data Engineering, 1996.
4. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD, 1997.
5. P. Cao, E. W. Felten, A. Karlin, and K. Li. A study of integrated prefetching and caching strategies. In Proc. of the 1995 ACM SIGMETRICS Conference, 1995.
6. B. Charpiot. Rpartition thmatique des accs un systme d'informations distribues. PhD thesis, Universit de Rennes I, 1998.
7. S. Crowder. A simple method for studying run-length distributions exponentially weighted moving average charts. Journal of Quality Technology, 1987.
8. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In ACM SIGMOD, 1994.
9. E.W. Forgy. Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. Biometric Society Meetings Riverside, 1965.
10. J. Griffioen and R. Appleton. Reducing file system latency using a predictive approach. In Proc. of the 1994 Summer Usenix Technical Conference, 1994.
11. J. Griffioen and R. Appleton. The Design, Implementation and Evaluation of a Predictive Caching File System. Technical report, Department of Computer Science, University of Kentucky, Lexington, KY, 1996.
12. A. Guttman. R-trees: a dynamic index structure for spatial searching. In ACM SIGMOD, 1984.
13. M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A perspective on databases and data mining. In Proc. of the 1st International Conference on Knowledge Discovery and Data Mining, 1995.
14. L. Hubert. Monotone invariant clustering. Psychometrika, 38(1), 1973.
15. T. Kamba, K. Bharat, and M. C. Albers. The krakatoa chronicle: An interactive, personalized, newspaper on the web. In Proc. of the 4th International World Wide Web Conference, 1995.
16. T. Kimbrel, A. Tomkins, R. H. Patterson, B. Bershad, P. Cao, E. W. Felten, G. A. Gibson, A. R. Karlin, and K. Li. A trace-driven comparison of algorithms for parallel prefetching and caching. In Proc. of the 2nd Conference on Operating System Design and Implementation (OSDI), 1996.
17. T. M. Kroeger and D. E. Long. Predicting file system actions from prior events. In Proc. of the 1996 Winter Usenix Technical Conference, 1996.
18. L. Lebart, A. Morineau, and K. M. Warwick. Multivariate descriptive statistical analysis. Willey Series in probability and mathematical statistics, 1984.
19. H. Lei and D. Duchamp. An analytical approach to file prefetching. In Proceedings of the 1997 Winter Usenix Technical Conference, 1997.
20. F. Leleu. Techniques d'anticipation des accs un service d'informations distribues. Application un service de presse crite lectronique. PhD thesis, Universit de Rennes I, 1997.
21. M. Mehta, R. Agrawal, and J. Rissanen. Sliq: A fast scalable classifier for data mining. In 5th International Conference on Extending Database Technology, 1996.
22. ère Conférence française sur les systèmes d'exploitationn (CFSE'1), 1999.
23. J-M. Menaud, V. Issarny, and M. Banâtre. A new protocol for efficient transversal web caching. In Proc. of DISC'98 (Formerly WDAG-) 12th International Symposium on Distributed Computing, 1998.
24. V. N. Padmanabhan and J. C. Mogul. Using predictive prefetching to improve World-Wide Web latency. SIGCOMM Newsletter, 1996.
25. R. H. Patterson, G. H. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka. Informed prefetching and caching. In Proc. of the 15th ACM Symposium on Operating System Principles (SOSP), 1995.
26. J. Mac Queen. Some methods for classification and analysis of multivariate observations. In 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967.
27. R. Srikant and R. Agrawal. Mining quantitative association rules in large relation-nal tables. In ACM SIGMOD, 1996.
28. D. Steere and M. Satyanarayanan. Using dynamic sets to overcome high I/O latencies during search. In Proc. of the 5th Workshop on Hot Operating System Topics, 1995.
29. E. Yashchin. Some aspects of the theory of statistical control schemes. IBM Journal of Research and Development, 31, 1987.