Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs |
| |
Authors: | Chen Zhixiang Fu Ada Wai-Chee Tong Frank Chi-Hung |
| |
Affiliation: | (1) Department of Computer Science, University of Texas-Pan American, USA;(2) Department of Computer Science, Chinese University of Hong Kong, Hong Kong;(3) Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong |
| |
Abstract: | Although efficient identification of user access sessions from very large web logs is an unavoidable data preparation task for the success of higher level web log mining, little attention has been paid to algorithmic study of this problem. In this paper we consider two types of user access sessions, interval sessions and gap sessions. We design two efficient algorithms for finding respectively those two types of sessions with the help of some proposed structures. We present theoretical analysis of the algorithms and prove that both algorithms have optimal time complexity and certain error-tolerant properties as well. We conduct empirical performance analysis of the algorithms with web logs ranging from 100 megabytes to 500 megabytes. The empirical analysis shows that the algorithms just take several seconds more than the baseline time, i.e., the time needed for reading the web log once sequentially from disk to RAM, testing whether each user access record is valid or not, and writing each valid user access record back to disk. The empirical analysis also shows that our algorithms are substantially faster than the sorting based session finding algorithms. Finally, optimal algorithms for finding user access sessions from distributed web logs are also presented. |
| |
Keywords: | web log mining data preparation user access sessions data structures time complexity |
本文献已被 SpringerLink 等数据库收录! |
|