Abstract
With the rise in adoption of massive graph data, it be- comes increasingly important to design graph processing algorithms which have predictable behavior as the graph scales. This work presents an initial study of stability in the context of a schema-driven synthetic graph generation. Specifically, we study the design of algorithms which gener- ate high-quality sequences of graph instances. Some desir- able features of these sequences include monotonic contain- ment of graph instances as they grow in size and consistency of structural properties across the sequence. Such stabil- ity features are important in understanding and explaining the scalability of many graph algorithms which have cross- instance dependencies (e.g., solutions for role detection in dynamic networks and graph query processing). We imple- ment a preliminary approach in the recently proposed open- source synthetic graph generator gMark and demonstrate its viability in generating stable sequences of graphs.
Original language | English |
---|---|
Title of host publication | Advances in database technology - EDBT 2017 20th International Conference on Extending Database Technology, Venice, Italy, March 21-24, 2017 : proceedings |
Editors | Bernhard Mitschang, Volker Markl, Sebastian Bress, Periklis Andritsos, Kai-Uwe Sattler, Salvatore Orlando |
Place of Publication | Konstanz |
Publisher | University of Konstanz |
Pages | 486-489 |
Number of pages | 4 |
ISBN (Electronic) | 9783893180738 |
ISBN (Print) | 978-3-89318-073-8 |
DOIs | |
Publication status | Published - 25 Mar 2017 |
Event | EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology - Venice, Italy Duration: 21 Mar 2017 → 24 Mar 2017 Conference number: 20 http://edbticdt2017.unive.it/ |
Conference
Conference | EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology |
---|---|
Abbreviated title | EDBT 2017 |
Country/Territory | Italy |
City | Venice |
Period | 21/03/17 → 24/03/17 |
Internet address |