Towards scalable architectures for clickstream data warehousing

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Click-stream data warehousing has emerged as a monumental information management and processing challenge for commercial enterprises. Traditional solutions based on commercial DBMS technology often suffer from poor scalability and large processing latencies. One of the main problems is that click-stream data is inherently collected in a distributed manner, but in general these distributed click-stream logs are collated and pushed upstream in a centralized database storage repository, creating storage bottlenecks. In this paper, we propose a design of an ad-hoc retrieval system suitable for click-stream data warehouses, in which the data remains distributed and database queries are rewritten to be executed against the distributed data. The query rewrite does not involve any centralized control and is therefore highly scalable. The elimination of centralized control is achieved by supporting a restricted subset of SQL, which is sufficient for most click-stream data analysis. Evaluations conducted using both synthetic and real data establish the viability of this approach. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Alvaro, P., Ryaboy, D. V., & Agrawal, D. (2007). Towards scalable architectures for clickstream data warehousing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4777 LNCS, pp. 154–177). Springer Verlag. https://doi.org/10.1007/978-3-540-75512-8_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free