GraphScript
Marcus Paradies, Cornelia Kinder, Jan Broß, Thomas Fischer, Romāns Kasperovičs, Hinnerk Gildhoff
Abstract
Marcus Paradies, Cornelia Kinder, Jan Broß, Thomas Fischer, Romāns Kasperovičs, Hinnerk Gildhoff
Abstract
Real-world graph applications are typically domain-specific and model complex business processes in the property graph data model. To implement a domain-specific graph algorithm in the context of such a graph application, simply providing a set of built-in graph algorithms is usually not sufficient nor does it allow algorithm customization to the user's needs. To cope with these issues, graph database vendors provide---in addition to their declarative graph query languages---procedural interfaces to write user-defined graph algorithms.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Real-world graph applications are typically domain-specific and model complex business processes in the property graph data model. To implement a domain-specific graph algorithm in the context of such a graph application, simply providing a set of built-in graph algorithms is usually not sufficient nor does it allow algorithm customization to the user's needs. To cope with these issues, graph database vendors provide---in addition to their declarative graph query languages---procedural interfaces to write user-defined graph algorithms.
Key concepts: Computer science, Graph database, Graph rewriting, Wait-for graph, Graph, Theoretical computer science, Clique-width, Null graph