A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Single versus multiple inheritance in object oriented programming
ACM SIGPLAN OOPS Messenger
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Object-Oriented Design Heuristics
Object-Oriented Design Heuristics
Efficient Relational Calculation for Software Analysis
IEEE Transactions on Software Engineering
The Definitive ANTLR Reference: Building Domain-Specific Languages
The Definitive ANTLR Reference: Building Domain-Specific Languages
Classics in software engineering
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Design Pattern Formalization Techniques
Design Pattern Formalization Techniques
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
The Qualitas Corpus: A Curated Collection of Java Code for Empirical Studies
APSEC '10 Proceedings of the 2010 Asia Pacific Software Engineering Conference
QoSA'10 Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps
Hi-index | 0.00 |
Motif search in graphs has become a popular field of research in recent years, mainly motivated by applications in bioinformatics. Existing work has focused on simple motifs: small sets of vertices directly connected by edges. However, there are applications that require a more general concept of motif, where vertices are only indirectly connected by paths. The size of the solution space is a major limiting factor when dealing with this kind of motif. We try to address this challenge through motif instance aggregation. It turns out that effective, parallel algorithms can be found to compute instances of generalised motifs in large graphs. To expedite the process, we have developed GUERY, a tool that can be used to define motifs and find motif instances, in graphs represented using the popular JUNG graph library [10]. GUERY consists of two parts - a simple domain specific language that can be used to define motifs, and a solver. The main strengths of GUERY are 1. support for motif instance aggregation, 2. generation of query result streams, as opposed to (very large) static sets of matching instances, 3. support for effective parallelisation in the evaluation of queries. The examples used for validation originate from problems encountered when analysing the dependency graphs of object-oriented programs for instances of architectural antipatterns.