Graph analysis: do we have to reinvent the wheel?

Authors:
Adam Welc;Raghavan Raman;Zhe Wu;Sungpack Hong;Hassan Chafi;Jay Banerjee
Affiliations:
Oracle Labs;Oracle Labs;Oracle;Oracle Labs;Oracle Labs;Oracle
Venue:
First International Workshop on Graph Data Management Experiences and Systems
Year:
2013

Citing 6
Cited 0

Transaction Processing: Concepts and Techniques

Transaction Processing: Concepts and Techniques
Speed-up techniques for shortest-path computations

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
What is Twitter, a social network or a news media?

Proceedings of the 19th international conference on World wide web
Relational approach for shortest path discovery over large graphs

Proceedings of the VLDB Endowment
Green-Marl: a DSL for easy and efficient graph analysis

ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
G-SPARQL: a hybrid engine for querying large attributed graphs

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of efficiently analyzing graphs of various shapes and sizes has been recently enjoying an increased level of attention both in the academia and in the industry. This trend prompted creation of specialized graph databases that have been rapidly gaining popularity of late. In this paper we argue that there exist alternatives to graph databases, providing competitive or superior performance, that do not require replacement of the entire existing storage infrastructure by the companies wishing to deploy them.