Skip to main content
SpringerLink
Log in

What Do Hyperlink-Proposals and Request-Prediction Have in Common?

  • Conference paper
  • First Online:
Advances in Information Systems (ADVIS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1909))

Included in the following conference series:

  • 314 Accesses

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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Allan. Automatic hypertext link typing. In Proceedings of the Seventh ACM Conference on Hypertext (Hypertext’ 96), 1996

    Google Scholar 

  2. 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

    Google Scholar 

  3. P. Cao, S. Irani, Cost-Aware Proxy Caching Algorithms, 1998

    Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Google Scholar 

  6. C. Cleary, R. Bareiss. Practical methods for automatically generating typed links. In Proceedings of the Seventh ACM Conference on Hypertext (Hypertext’ 96), ACM, 1996

    Google Scholar 

  7. 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

    Google Scholar 

  8. E. Cohen, B. Krishnamurthy, J. Rexford, Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters, 1998

    Google Scholar 

  9. M. Crovella, P. Barford, The Network Effects of Prefetching, IEEE Infocom 1998

    Google Scholar 

  10. S. Erickson, D. Yi, Modelling the performance of a Large Multi-Tiered Application, American Management Systems, AMS Center For Advanced Technology, 1999

    Google Scholar 

  11. J. Griffioen, R. Appleton, The design, Implementation, and Evaluation of a Predictive Caching File System, CS-Department University of Kentucky, CS-264-96, 1996

    Google Scholar 

  12. W. Hall, H. Davis, G. Hutchings. Rethinking Hypermedia: The Microcoms Approach. Kluwer Academic Publishers, 1996

    Google Scholar 

  13. 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/

  14. 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

    Google Scholar 

  15. 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

    Google Scholar 

  16. E.-G. Haffner, U. Roth, T. Engel, Ch. Meinel. Optimizing Requests for the Smart Data Server. Applied Informatics, IASTED AI2000, Innsbruck, Austria, 2000

    Google Scholar 

  17. 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

    Google Scholar 

  18. Z. Jiang, L. Kleinrock, An Adaptive Network Prefetch Scheme, IEEE J Sel Areas Commun, 1998

    Google Scholar 

  19. 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

    Google Scholar 

  20. J. Kolodner, D. Leake. A tutorial introduction to Case-Based Reasoning. In Case-Based Reasoning. AAAI Press, the MIT Press, 1995

    Google Scholar 

  21. 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

    Google Scholar 

  22. A. Kraiss, G. Weikum, Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions, The VLDB Journal, Springer-Verlag, 1998

    Google Scholar 

  23. V.N. Padmanabhan, J.C. Mogul, Using Predictive Prefetching to Improve World Wide Web Latency, Computer Communication Review, 1996

    Google Scholar 

  24. 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

    Google Scholar 

  25. J.H. Rety. Structure analysis for hypertext with conditional linkage. In Proceedings of the Tenth ACM Conference on Hypertext (Hypertext’ 99), ACM, 1999

    Google Scholar 

  26. Schechter, Krishnan, Smith, Using path profiles to predict HTTP requests. In Proceedings of the World Wide Web Conference, 1998

    Google Scholar 

  27. J. Tebbutt. Finding links. In Proceedings of the Ninth ACM Conference on Hypertext (Hypertext’ 98), ACM, 1998

    Google Scholar 

  28. 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telematics, Bahnhofsstr. 30-32, D-54292, Trier, Germany

    Ernst-Georg Haffner, Uwe Roth, Andreas Heuer, Thomas Engel & Christoph Meinel

Authors
  1. Ernst-Georg Haffner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Roth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Heuer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas Engel
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Engineering Department, Dokuz Eylul University, Bornova, 35100, Izmir, Turkey

    Tatyana Yakhno

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation