Towards a property graph generator for benchmarking

April 03, 2017 Β· Declared Dead Β· πŸ› GRADES@SIGMOD/PODS

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Arnau Prat-PΓ©rez, Joan Guisado-GΓ‘mez, Xavier FernΓ‘ndez Salas, Petr Koupy, Siegfried Depner, Davide Basilio Bartolini arXiv ID 1704.00630 Category cs.DB: Databases Cross-listed cs.PF Citations 15 Venue GRADES@SIGMOD/PODS Last Checked 3 months ago
Abstract
The use of synthetic graph generators is a common practice among graph-oriented benchmark designers, as it allows obtaining graphs with the required scale and characteristics. However, finding a graph generator that accurately fits the needs of a given benchmark is very difficult, thus practitioners end up creating ad-hoc ones. Such a task is usually time-consuming, and often leads to reinventing the wheel. In this paper, we introduce the conceptual design of DataSynth, a framework for property graphs generation with customizable schemas and characteristics. The goal of DataSynth is to assist benchmark designers in generating graphs efficiently and at scale, saving from implementing their own generators. Additionally, DataSynth introduces novel features barely explored so far, such as modeling the correlation between properties and the structure of the graph. This is achieved by a novel property-to-node matching algorithm for which we present preliminary promising results.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Databases

R.I.P. πŸ‘» Ghosted

Datasheets for Datasets

Timnit Gebru, Jamie Morgenstern, ... (+5 more)

cs.DB πŸ› CACM πŸ“š 2.6K cites 8 years ago

Died the same way β€” πŸ‘» Ghosted