Acolyte: an in-memory social network query system

Authors:
Ze Tang;Heng Lin;Kaiwei Li;Wentao Han;Wenguang Chen
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China
Venue:
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Year:
2012

Citing 4
Cited 1

Pthreads programming

Pthreads programming
The webgraph framework I: compression techniques

Proceedings of the 13th international conference on World Wide Web
Pregel: a system for large-scale graph processing

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Managing large graphs on multi-cores with graph awareness

USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference

On benchmarking online social media analytical queries

First International Workshop on Graph Data Management Experiences and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

WISE 2012 Challenge provides a data set crawled from Sina Weibo, which consists of hundreds of millions of anonymized following relationships and microblogs. In the performance track, 19 typical queries on the data set are given. Most of the queries are to get the top n users or microblogs which have the largest statistical numbers of some features during a specific period. The solution should focus on both throughput and latency in the execution of these queries. In this report, we present Acolyte, which is an in-memory query system that can solve the performance track efficiently.