Abstract
This paper focuses on fundamental similarities between proposing links for hypertexts and predicting user-requests. It briefly outlines the theoretical background of both categories of problems and, as an example, explores common implementation strategies for handling them. Even though there are some important differences between link-proposals and prediction of requests, we believe that in regarding these categories as special cases of a more general and abstract mathematical model, improvements on the one side will also result in advantages for the other.
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.
Similar content being viewed by others
References
J. Allan. Automatic hypertext link typing. In Proceedings of the Seventh ACM Conference on Hypertext (Hypertext’ 96), 1996
A. Bestavros, Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time in Distributed Information Systems, Proceedings of ICDE’96, New Orleans, Louisiana, March 1996
P. Cao, S. Irani, Cost-Aware Proxy Caching Algorithms, 1998
R. Cáreres, F. Douglis, A. Feldmann, G. Glass, M. Rabinovich, Web Proxy Caching: The devil is in the details, Workshop on Internet Server Performance, June 1998, Madison, WI
R. J. Chitashvili, R. H. Baayen. Word frequency distributions of texts and corpora as large number of rare event distributions. In Quantitative text analysis, (Quantitative linguistics, Vol. 52), 1993. WVT Trier
C. Cleary, R. Bareiss. Practical methods for automatically generating typed links. In Proceedings of the Seventh ACM Conference on Hypertext (Hypertext’ 96), ACM, 1996
D. T. Chang. HieNet: A user-centered approach for automatic link generation. In Proceedings of the Fifth ACM Conference on Hypertext (Hypertext’93), ACM, 1993
E. Cohen, B. Krishnamurthy, J. Rexford, Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters, 1998
M. Crovella, P. Barford, The Network Effects of Prefetching, IEEE Infocom 1998
S. Erickson, D. Yi, Modelling the performance of a Large Multi-Tiered Application, American Management Systems, AMS Center For Advanced Technology, 1999
J. Griffioen, R. Appleton, The design, Implementation, and Evaluation of a Predictive Caching File System, CS-Department University of Kentucky, CS-264-96, 1996
W. Hall, H. Davis, G. Hutchings. Rethinking Hypermedia: The Microcoms Approach. Kluwer Academic Publishers, 1996
A. Heuer, E.-G. Haffner, U. Roth, Z. Zhang, T. Engel, C. Meinel. Hyperlink management system for multilingual websites. In Proceedings of the Asia Pacific Web Conference (APWeb’ 99), 1999. http://www2.comp.polyu.edu.hk/~apweb99/
E.-G. Haffner, U. Roth, T. Engel, Ch. Meinel, A Semi-Random Prediction Scenario for User Requests, Proceedings of the Asia Pacific Web Conference, APWEB99, 1999
E.-G. Haffner, U. Roth, T. Engel, Ch. Meinel. Modeling Time and Document Aging for Request Prediction-One Step further. Symposium on Applied Computing, SAC2000, Como, Italy, 2000
E.-G. Haffner, U. Roth, T. Engel, Ch. Meinel. Optimizing Requests for the Smart Data Server. Applied Informatics, IASTED AI2000, Innsbruck, Austria, 2000
E.-G. Haffner, A. Heuer, U. Roth, T. Engel, Ch. Meinel. Advanced Studies on Link-Proposals and Knowledge-Retrieval of Hypertexts with CBR. Proceedings of the International EC-Web Conference, ECWeb2000, Greenwich, United Kingdom, LNCS, Springer-Verlag, 2000
Z. Jiang, L. Kleinrock, An Adaptive Network Prefetch Scheme, IEEE J Sel Areas Commun, 1998
H. Kaindl, S. Kramer. Semiautomatic generation of glossary links: A Practical Solution. In Proceedings of the Tenth ACM Conference on Hypertext (Hypertext’ 99), ACM, 1999
J. Kolodner, D. Leake. A tutorial introduction to Case-Based Reasoning. In Case-Based Reasoning. AAAI Press, the MIT Press, 1995
Achim Kraiss, Gerhard Weikum, Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions, Proceedings of the 23rd VLDB Conference, 1997
A. Kraiss, G. Weikum, Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions, The VLDB Journal, Springer-Verlag, 1998
V.N. Padmanabhan, J.C. Mogul, Using Predictive Prefetching to Improve World Wide Web Latency, Computer Communication Review, 1996
F. J. Ricardo. Stalking the paratext: speculations on hypertext links as second order text. In Proceedings of the Ninth ACM Conference on Hypertext (Hypertext’ 98), ACM, 1998
J.H. Rety. Structure analysis for hypertext with conditional linkage. In Proceedings of the Tenth ACM Conference on Hypertext (Hypertext’ 99), ACM, 1999
Schechter, Krishnan, Smith, Using path profiles to predict HTTP requests. In Proceedings of the World Wide Web Conference, 1998
J. Tebbutt. Finding links. In Proceedings of the Ninth ACM Conference on Hypertext (Hypertext’ 98), ACM, 1998
Z. Zhang, E.-G. Haffner, A. Heuer, T. Engel and C. Meinel. Role-based Access Control in Online Authoring and Publishing Systems vs. Documentation Hierarchy. In Proceedings of the SIGDOC’ 99, ACM, 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haffner, EG., Roth, U., Heuer, A., Engel, T., Meinel, C. (2000). What Do Hyperlink-Proposals and Request-Prediction Have in Common?. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2000. Lecture Notes in Computer Science, vol 1909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40888-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-40888-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41184-0
Online ISBN: 978-3-540-40888-8
eBook Packages: Springer Book Archive