GraphJet
| Autor: | Praveen Bommannavar, Jerry Jiang, Aneesh Sharma, Jimmy Lin, Brian Larson |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Graph database
Theoretical computer science Computer science General Engineering 020206 networking & telecommunications 02 engineering and technology computer.software_genre Random walk Graph 020204 information systems 0202 electrical engineering electronic engineering information engineering Bipartite graph Graph (abstract data type) Adjacency list computer MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Proceedings of the VLDB Endowment. 9:1281-1292 |
| ISSN: | 2150-8097 |
| DOI: | 10.14778/3007263.3007267 |
| Popis: | This paper presents GraphJet, a new graph-based system for generating content recommendations at Twitter. As motivation, we trace the evolution of our formulation and approach to the graph recommendation problem, embodied in successive generations of systems. Two trends can be identified: supplementing batch with real-time processing and a broadening of the scope of recommendations from users to content. Both of these trends come together in Graph-Jet, an in-memory graph processing engine that maintains a real-time bipartite interaction graph between users and tweets. The storage engine implements a simple API, but one that is sufficiently expressive to support a range of recommendation algorithms based on random walks that we have refined over the years. Similar to Cassovary, a previous graph recommendation engine developed at Twitter, GraphJet assumes that the entire graph can be held in memory on a single server. The system organizes the interaction graph into temporally-partitioned index segments that hold adjacency lists. GraphJet is able to support rapid ingestion of edges while concurrently serving lookup queries through a combination of compact edge encoding and a dynamic memory allocation scheme that exploits power-law characteristics of the graph. Each GraphJet server ingests up to one million graph edges per second, and in steady state, computes up to 500 recommendations per second, which translates into several million edge read operations per second. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|