Abstract
With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern matching is performed as fast as possible. This challenge has been attacked by the approach of search plan driven, host-graph-sensitive (also known as model-sensitive) graph pattern matching. To our knowledge no experimental evaluation of this approach has been published yet. We performed first experiments regarding the runtime performance using the well-known GT benchmark introduced by Varró et al. as well as an example from compiler construction. Moreover we present an improved cost model and heuristics for search plans and their generation. © 2008 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Veit Batz, G., Kroll, M., & Geiß, R. (2008). A first experimental evaluation of search plan driven graph pattern matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5088 LNCS, pp. 471–486). Springer Verlag. https://doi.org/10.1007/978-3-540-89020-1_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
