Skip to main content
SpringerLink
Log in

Dynamic Hotlinks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Consider a directed rooted tree T=(V,E) representing a collection V of n web pages connected via a set E of links all reachable from a source home page, represented by the root of T. Each web page i carries a weight w i representative of the frequency with which it is visited. By adding hotlinks, shortcuts from a node to one of its descendants, we are interested in minimizing the expected number of steps needed to visit pages from the home page. We give the first linear time algorithm for assigning hotlinks so that the number of steps to access a page i from the root of the tree reaches the entropy bound, i.e. is at most O(log (W/w i )) where W=∑ i∈T w i . The best previously known algorithm for this task runs in time O(n 2). We also give the first efficient data structure for maintaining hotlinks when nodes are added, deleted or their weights modified, in amortized time O(log (W/w i )) per update. The data structure can be made adaptive, i.e. reaches the entropy bound in the amortized sense without knowing the weights w i in advance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramson, N.: Information Theory and Coding. McGraw-Hill, New York (1963)

    Google Scholar 

  2. Andersson, A., Lai, T.W.: Fast updating of well-balanced trees. In: Proceedings of the Second Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 447, pp. 111–121. Springer, Berlin (1990)

    Google Scholar 

  3. Bose, P., Kranakis, E., Krizanc, D., Martin, M.V., Czyzowicz, J., Pelc, A., Gasieniec, L.: Strategies for hotlink assignments. In: Proceedings of the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000). Lecture Notes in Computer Science, vol. 1969, pp. 23–34. Springer, Berlin (2000)

    Google Scholar 

  4. Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. Theory Comput. Syst. 36(6), 655–661 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Brönnimann, H., Cazals, F., Durand, M.: Randomized jumplists: a jump-and-walk dictionary data structure. In: Proceedings of the Twentieth Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003). Lecture Notes in Computer Science, vol. 2607, pp. 283–294. Springer, Berlin (2003)

    Google Scholar 

  6. Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Evaluation of hotlink assignment heuristics for improving web access. In: Proceedings of the Second International Conference on Internet Computing (IC’2001), pp. 793–799 (2001)

  7. Drott, M.C.: Using web server logs to improving site design. In: Proceedings of ACM Conference on Internet Computer Documentation, pp. 43–50 (1998)

  8. Elmasry, A.: Deterministic jumplists. Nord. J. Comput. 12(1), 27–39 (Spring 2005)

    MATH  MathSciNet  Google Scholar 

  9. Fuhrmann, S., Krumke, S.O., Wirth, H.-C.: Multiple hotlink assignment. In: Proceedings of the Twenty-Seventh International Workshop on Graph-Theoric Concepts in Computer Science. Lecture Notes in Computer Science, vol. 2204, pp. 189–200. Springer, Berlin (2001)

    Chapter  Google Scholar 

  10. Galperin, I., Rivest, L.: Scapegoat trees. In: Proceedings of the Fourth Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 165–174 (1993)

  11. Gerstel, O., Kutten, S., Matichin, R., Peleg, D.: Hotlink enhancement algorithms for web directories. In: Proceedings of the Fourteenth Annual International Symposium on Algorithms and Computation (ISAAC 2003). Lecture Notes in Computer Science, vol. 2906, pp. 68–77. Springer, Berlin (2003)

    Google Scholar 

  12. Kranakis, E., Krizanc, D., Martin, M.V.: The hotlink optimizer. In: Proceedings of the Third International Conference on Internet Computing (IC’2002), pp. 33–40 (2002)

  13. Kranakis, E., Krizanc, D., Shende, S.: Approximate hotlink assignment. Inform. Process. Lett. 90(3), 121–128 (2004)

    Article  MathSciNet  Google Scholar 

  14. Laber, E.S., Holanda, L.G.: Improved bounds for asymmetric communication protocols. Inform. Process. Lett. 83(4), 205–209 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mehlhorn, K.: Nearly optimal binary search trees. Acta Informatica 5, 287–295 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  16. Perkowitz, M., Etzioni, O.: Towards adaptive Web sites: conceptual framework and case study. Artif. Intell. 118(1/2), 245–275 (2000)

    Article  MATH  Google Scholar 

  17. Pessoa, A., Laber, E., de Souza, C.: Efficient algorithms for the hotlink assignment problem: the worst case search. In: Proceedings of the Fifteenth Annual International Symposium on Algorithms and Computation (ISAAC 2004). Lecture Notes in Computer Science, vol. 3341, p. 778. Springer, Berlin (2004)

    Google Scholar 

  18. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668–676 (1990)

    Article  MathSciNet  Google Scholar 

  19. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–381 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles, CP212, Boulevard du Triomphe, 1050, Bruxelles, Belgium

    Karim Douïeb & Stefan Langerman

Authors
  1. Karim Douïeb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Langerman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karim Douïeb.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Douïeb, K., Langerman, S. Dynamic Hotlinks. Algorithmica 50, 208–222 (2008). https://doi.org/10.1007/s00453-007-9060-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9060-3

Keywords

Search

Navigation