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 descendents, 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 accede to a page i from the root of the tree reaches the entropy bound, i.e. is at most \(O({\rm log} \frac{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({\rm log} \frac{W}{w_i})\) per update. The data structure can be made adaptative, i.e. reaches the entropy bound in the amortized sense without knowing the weights w i in advance.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andersson, A., Lai, T.W.: Fast updating of well-balanced trees. In: Proc. of the Second Scandinavian Worshop on Algorithm Theory. LNCS, vol. 447, pp. 111–121 (1990)
Bose, P., Kranakis, E., Krizanc, D., Martin, M.V., Czyzowicz, J., Pelc, A., Gasieniec, L.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 23–34. Springer, Heidelberg (2000)
Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. In: Proc. of the 9th Coll. on Structural Information and Communication Complexity (SIROCCO 2002), pp. 33–40 (2002)
Brönnimann, H., Cazals, F., Durand, M.: Randomized jumplists: A jump-and-walk dictionary data structure. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 283–294. Springer, Heidelberg (2003)
Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Evaluation of hotlink assignment heuristics for improving web access. In: Proc. 2nd Int. Conf. on Internet Computing (IC 2001), pp. 793–799 (2001)
Drott, M.: Using web server logs to improving site design. In: Proc. ACM Conf. on Internet Computer Documentation, pp. 43–50 (1998)
Elmasry, A.: Deterministic jumplists. Technical report, DIMACS (2003)
Fuhrmann, S., Krumke, S.O., Wirth, H.-C.: Multiple hotlink assignment. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 189–200. Springer, Heidelberg (2001)
Galperin, I., Rivest, L.: Scapegoat trees. In: Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 165–174 (1993)
Gerstel, O., Kutten, S., Matichin, R., Peleg, D.: Hotlink enhancement algorithms for web directories. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 68–77. Springer, Heidelberg (2003)
Kranakis, E., Krizanc, D., Martin, M.V.: The hotlink optimizer. In: Proc. 3rd Int. Conf. on Internet Computing (IC 2002), pp. 33–40 (2002)
Kranakis, E., Krizanc, D., Shende, S.: Approximate hotlink assignment. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 756–767. Springer, Heidelberg (2001)
Matichin, R., Peleg, D.: Approximation algorithm for hotlink assignments in web directories. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 271–280. Springer, Heidelberg (2003)
Abramson, N.: Information theory and coding. McGraw Hill, New York (1963)
Perkowitz, M., Etzioni, O.: Towards adaptive Web sites: conceptual framework and case study. Computer Networks 31(11-16), 1245–1258 (1999)
Pessoa, A., Laber, E., de Souza, C.: Efficient algorithms for the hotlink assignment problem: The worst case search. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 778–792. Springer, Heidelberg (2004)
Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol. 382, pp. 437–449. Springer, Heidelberg (1989)
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–381 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Douïeb, K., Langerman, S. (2005). Dynamic Hotlinks. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_17
Download citation
DOI: https://doi.org/10.1007/11534273_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)