ProvGen: generating synthetic PROV graphs with predictable structure
Authors: Hugo Firth, Paolo Missier
AI-generated Key Points
- Hugo Firth and Paolo Missier introduce provGen, a generator for synthetic provenance graphs
- Synthetic provenance graphs serve two primary purposes: testing storage and query capabilities of provenance management systems at scale, and experimenting with graph algorithms for provenance analytics
- provGen generates PROV (PROvenance) graphs and stores them in Neo4J
- Users can control the relationship makeup and topological features of the graph by providing a seed pattern along with constraints expressed using a custom Domain Specific Language (DSL)
- The authors propose a method for evaluating the quality of generated graphs by measuring how realistically they simulate real-world patterns
- Existing approaches to generating synthetic provenance graphs have limitations, but provGen enables users to generate large-scale synthetic provenance graphs with predictable properties while also giving them control over topology.
- Overall, this paper presents an innovative approach to generating synthetic provenance graphs that offers researchers new opportunities for exploring complex relationships within data sets.
Abstract: This paper introduces provGen, a generator aimed at producing large synthetic provenance graphs with predictable properties and of arbitrary size. Synthetic provenance graphs serve two main purposes. Firstly, they provide a variety of controlled workloads that can be used to test storage and query capabilities of provenance management systems at scale. Secondly, they provide challenging testbeds for experimenting with graph algorithms for provenance analytics, an area of increasing research interest. provGen produces PROV graphs and stores them in a graph DBMS (Neo4J). A key feature is to let users control the relationship makeup and topological features of the graph, by providing a seed provenance pattern along with a set of constraints, expressed using a custom Domain Specific Language. We also propose a simple method for evaluating the quality of the generated graphs, by measuring how realistically they simulate the structure of real-world patterns.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.