We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
gbase: an efficient analysis platform for large graphs.
- Authors
Kang, U; Tong, Hanghang; Sun, Jimeng; Lin, Ching-Yung; Faloutsos, Christos
- Abstract
Graphs appear in numerous applications including cyber security, the Internet, social networks, protein networks, recommendation systems, citation networks, and many more. Graphs with millions or even billions of nodes and edges are common-place. How to store such large graphs efficiently? What are the core operations/queries on those graph? How to answer the graph queries quickly? We propose G base, an efficient analysis platform for large graphs. The key novelties lie in (1) our storage and compression scheme for a parallel, distributed settings and (2) the carefully chosen graph operations and their efficient implementations. We designed and implemented an instance of G base using M apreduce/H adoop. G base provides a parallel indexing mechanism for graph operations that both saves storage space, as well as accelerates query responses. We run numerous experiments on real and synthetic graphs, spanning billions of nodes and edges, and we show that our proposed G base is indeed fast, scalable, and nimble, with significant savings in space and time.
- Subjects
COMPUTING platforms; GRAPHIC methods; COMPUTER network security; SOCIAL networks; SPACETIME; QUERYING (Computer science)
- Publication
VLDB Journal International Journal on Very Large Data Bases, 2012, Vol 21, Issue 5, p637
- ISSN
1066-8888
- Publication type
Article
- DOI
10.1007/s00778-012-0283-9