Abstract
Consider a web site containing a collection of web pages with data. Each page is associated with a weight representing the frequency that page is accessed by users. In the tree hierarchy representation, accessing each page requires the user to travel along the path leading to it from the root. By enhancing the index tree with additional edges (hotlinks) one may reduce the access cost of the system. That is, the hotlinks reduce the expected number of steps needed to reach a leaf page from the tree root, assuming that the user knows which hotlinks to take. The hotlink enhancement problem involves finding a set of hotlinks minimizing this cost. The paper proposes a hotlinks structure allowing a user with limited a-priori knowledge to determine which hotlink to use at every given point. Then, a polynomial algorithm is presented for solving the hotlink enhancement problem for such hotlinks on trees of logarithmic depth. The solution is first presented for binary trees and then extended to arbitrary degree trees. It is also shown how to generalize the solution to situations where more than one hotlink per node is allowed. The case in which the distribution on the leaves is unknown is discussed as well, and is given an algorithm guaranteeing (an optimal) logarithmic upper bound on the expected number of steps down the tree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bose, P., Czywizowicz, J., Gasieniec, L., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 23–34. Springer, Heidelberg (2000)
Kranakis, E., Krizanc, D., Shende, S.: Approximating hotlink assignments. In: Proc. 12th Symp. on algorithms and computation (ISSAC 2001), pp. 756–767 (2001)
Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. In: Proc. 9th Colloq. on Structural Information and Communication Complexity, pp. 33–39 (June 2002)
Matichin, R., Peleg, D.: Approximation Algorithm for Hotlink Assignments in Web Directories. In: 8th Workshop on Algorithms and Data Structures, Ottawa, Canada (August 2003)
Attardi, G., Di Marco, S., Salvi, D.: Categorization by Context. Journal of Universal Computer Science 4(9), 719–736 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gerstel, O., Kutten, S., Matichin, R., Peleg, D. (2003). Hotlink Enhancement Algorithms for Web Directories. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive