GBASE: an efficient analysis platform for large graphs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 422
  • Download : 0
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 Gbase, 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 Gbase using Mapreduce/Hadoop. Gbase 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 Gbase is indeed fast, scalable, and nimble, with significant savings in space and time.
Publisher
SPRINGER
Issue Date
2012-10
Language
English
Article Type
Article
Citation

VLDB JOURNAL, v.21, no.5, pp.637 - 650

ISSN
1066-8888
DOI
10.1007/s00778-012-0283-9
URI
http://hdl.handle.net/10203/103549
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0