DocumentCode
394073
Title
Linear time algorithms for finding maximal forward references
Author
Chen, Zhixiang ; Fowler, Richard H. ; Fu, Ada Wai-Chee
Author_Institution
Dept. of Comput. Sci., Univ. of Texas, Pan American, TX, USA
fYear
2003
fDate
28-30 April 2003
Firstpage
160
Lastpage
164
Abstract
In this paper, two algorithms are designed for finding maximal forward references from very large Web logs, longest sequences of Web pages visited by a user without revisiting some previously visited page in the sequence, and their performance is comparatively analyzed. It is shown that the two algorithms have linear (hence optimal) time complexity.
Keywords
computational complexity; information resources; information retrieval; linear time algorithms; linear time complexity; maximal forward reference finding; very large Web logs; Algorithm design and analysis; Computer science; Delay; Navigation; Performance analysis; Personnel; Prefetching; Web mining; Web pages; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: Coding and Computing [Computers and Communications], 2003. Proceedings. ITCC 2003. International Conference on
Print_ISBN
0-7695-1916-4
Type
conf
DOI
10.1109/ITCC.2003.1197519
Filename
1197519
Link To Document