Accepted Papers
GRADES 2013 received many submissions of good quality, but there is a limit to the amount of papers
one can present in a single-day, single-track workshop. Hence, the Program Committee and Chairs
faced a tough selection task.
These are the accepted papers:
-
Converting Relational to Graph Databases
- Roberto De Virgilio, Antonio Maccioni, Riccardo Torlone (Universita' Roma Tre).
-
GraphX: A Resilient Distributed Graph System on Spark
- Reynold Xin, Joseph Gonzalez, Michael Franklin (UC Berkeley).
-
Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research
- Cliff Joslyn, Sutanay Choudhury, David Haglin, Bill Howe, Bill Nickless, Bryan Olsen (Pacific Northwest National Lab).
-
GraphBuilder: Scalable Graph ETL Framework
- Nilesh Jain, Guangdeng Liao, Theodore Willke (Intel Corp).
-
Early Experiences in Using a Domain-Specific Language for Large-Scale Graph Analysis
- Sungpack Hong, Jan Van Der Lugt, Adam Welc, Raghavan Raman, Hassan Chafi (Oracle Labs).
-
Using Substructure Mining to Identify Misbehavior in Network Provenance Graphs
- David DeBoer, Wenchao Zhou, Lisa Singh (Georgetown University).
-
Graph Analysis – Do We Have to Reinvent the Wheel?
- Adam Welc, Raghavan Raman, Zhe Wu, Sungpack Hong, Hassan Chafi, Jay Banerjee (Oracle Labs).
-
Scale-up Graph Processing: A Storage-centric View
- Eiko Yoneki (University of Cambridge); Amitabha Roy (EPFL).
-
Partial View Selection for Evolving Social Graphs
- Georgia Koloniari (University of Macedonia); Evaggelia Pitoura (University of Ioannina).
-
On Benchmarking Online Social Media Analytical Queries
- Ma Haixin, Qian Weining, Xia Fan, Wei Jinxian, Yu Chengcheng, Aoying Zhou (East China Normal University).
-
Time-varying Social Networks in a Graph Database - A Neo4j Use Case
- Alex Averbuch (Neo Technology); Marco Quaggiotto, Ciro Cattuto, André Panisson (ISI Foundation).
-
Leveraging Flexible Data Management with Graph Databases
- Elena Vasilyeva (SAP AG); Maik Thiele (Technische Universität Dresden); Christof Bornhövd (SAP Labs, LLC); Wolfgang Lehner (Technische Universität Dresden).
-
Regularities and dynamics in bisimulation reductions of big graphs
- Yongming Luo, George H.L. Fletcher (TU Eindhoven); Jan Hidders (TU Delft); Paul De Bra (TU Eindhoven); Yuqing Wu (Indiana University, Bloomington).
-
Sparqling Kleene - Fast Regex Paths in RDF-3X
- Andrey Gubichev (TU Munich); Srikanta Bedathur (IIIT-D); Stephan Seufert (Max Planck Institute for Informatics).
-
Benchmarking database systems for social network applications
- Renzo Angles (Universidad de Talca); Arnau Prat (UPC Barcelona); David Dominguez (Sparsity Technologies); Josep Lluis Larriba Pey (UPC Barcelona).
-
SynopSys: Large Graph Analytics in the SAP HANA Database Through Summarization
- Michael Rudolf, Marcus Paradies (SAP AG); Christof Bornhövd (SAP Labs, LLC); Wolfgang Lehner (Technische Universität Dresden).
GRADES 2013 will run an non-standard program format to allow many papers to be presented interactively.
More information on the program will follow by the end of May.