Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
GXL: Toward a Standard Exchange Format
WCRE '00 Proceedings of the Seventh Working Conference on Reverse Engineering (WCRE'00)
GME: the generic modeling environment
OOPSLA '03 Companion of the 18th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Benchmarking for Graph Transformation
VLHCC '05 Proceedings of the 2005 IEEE Symposium on Visual Languages and Human-Centric Computing
Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages
Applications of Graph Transformations with Industrial Relevance
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The DRAGOS database eases the development of graph-based applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing database by a basic Query and Transformation Mechanism, which facilitates the construction of graph transformation systems. Users can therefore access the database by applying structured rules instead of using atomic operations provided before. As result, the development of graph transformation tools is eased by providing a mapping of specific graph languages to the Query and Transformation Language, instead of developing interpreters or code generators. In addition, structured rules offer more optimization potential in the underlying graph storage, which is beneficial for existing graph transformation systems. The presented approach is especially designed for extensibility, so its functionality can be adapted corresponding to the demands of the respective application domain.