Search Trees for Distributed Graph Transformation Systems

Graph transformation systems, like PROGRES and Fujaba, can be used for modeling software systems of various domains, and support the automatic generation of executable code. A graph transformation rule is executed only if the pattern of the transformation's left-hand side is found in the graph. The search for the pattern has an exponential worst-case complexity. In many cases, the average complexity can be reduced using search tree algorithms in the code generation phase. When modeling distributed graph transformations, the communication overhead between the coupled applications largely affects the pattern matching performance. Therefore, we present an approach for adapting existing search tree algorithms for the efficient search of distributed graph patterns. Our algorithm divides the distributed graph pattern into several sub-patterns such that every sub-pattern affects solely the graph of exactly one coupled application. The results of these sub-patterns are used to determine the match for the entire graph pattern

Search Trees for Distributed Graph Transformation Systems

Graph transformation systems, like PROGRES and Fujaba, can be used for modeling software systems of various domains, and support the automatic generation of executable code. A graph transformation rule is executed only if the pattern of the transformation's left-hand side is found in the graph. The search for the pattern has an exponential worst-case complexity. In many cases, the average complexity can be reduced using search tree algorithms in the code generation phase. When modeling distributed graph transformations, the communication overhead between the coupled applications largely affects the pattern matching performance. Therefore, we present an approach for adapting existing search tree algorithms for the efficient search of distributed graph patterns. Our algorithm divides the distributed graph pattern into several sub-patterns such that every sub-pattern affects solely the graph of exactly one coupled application. The results of these sub-patterns are used to determine the match for the entire graph pattern

Specifying Distributed Graph Transformation Systems

Graph transformation systems simplify software development by modeling the system in a visual and declarative language. Despite their expressiveness, they fail to support specifiers in modeling distributed systems. As software projects increasingly demand support for distribution, we aim to fill this gap for graph transformation systems. With our concepts, specifiers can visually specify graph transformations affecting multiple applications simultoniously. Based on this visual specification, the corresponding distribution to the different a pplications is automatically derived. We introduce our concepts in general and demonstrate their applicability by means of an example

ELECTRONIC COMMUNICATIONS OF THE EASST Search Trees for Distributed Graph Transformation Systems

Abstract. Graph transformation systems, like PROGRES and Fujaba, can be used for modeling software systems of various domains, and support the automatic generation of executable code. A graph transformation rule is executed only if the pattern of the transformation’s left-hand side is found in the graph. The search for the pattern has an exponential worst-case complexity. In many cases, the average complexity can be reduced using search tree algorithms in the code generation phase. When modeling distributed graph transformations, the communication overhead between the coupled applications largely affects the pattern matching performance. Therefore, we present an approach for adapting existing search tree algorithms for the efficient search of distributed graph patterns. Our algorithm divides the distributed graph pattern into several sub-patterns such that every sub-pattern affects solely the graph of exactly one coupled application. The results of these sub-patterns are used to determine the match of the entire graph pattern

The Jury is still out: A Comparison of AGG, Fujaba, and PROGRES

Graph transformation languages offer a declarative and visual programming method for software systems with complex data structures. Some of these languages have reached a level of maturity that allows not only conceptual but also practical use. This paper compares the three widespread graph transformation languages AGG, Fujaba, and PROGRES, considering their latest developments. The comparison is three-fold and regards conceptual aspects, language properties, and infrastructure features. Because of the different relevance of these aspects, we do not determine a clear winner but leave it to the reader

Evening Telegram, 1918-01-21

The Evening Telegram began publication in St. John's on 3 April 1879 and remains in print today under the title The Telegram. It was published daily except Sunday through to 1958, the frequency changing thereafter. -- The total collection has been split into several parts; this portion contains from 1900-1918