Paper Info
Title
An algorithm for generating model-sensitive search plans for EMF models
Abstract
In this paper, we propose a new model-sensitive search plan generation algorithm to speed up the process of graph pattern matching. This dynamic programming based algorithm, which is able to handle general n-ary constraints in an integrated manner, collects statistical data from the underlying EMF model, and uses this information for optimization purposes. Additionally, runtime performance measurements have been carried out to quantitatively evaluate the effects of the search plan generation algorithm on the pattern matching engine.
Year
DOI
Venue
2012
10.1007/978-3-642-30476-7_15
ICMT
Keywords
Field
DocType
integrated manner,statistical data,general n-ary constraint,new model-sensitive search plan,search plan generation algorithm,runtime performance measurement,generation algorithm,emf model,dynamic programming,graph pattern matching,optimization purpose
Dynamic programming,Data mining,Graph pattern matching,Search algorithm,Computer science,Beam search,Algorithm,Binary search algorithm,Pattern matching,Best-first search,Speedup
Conference
Citations 
PageRank 
References 
10
0.67
11
Authors
4
Name
Order
Citations
PageRank
Gergely Varró140336.67
Frederik Deckwerth2423.70
Martin Wieber3211.84
Andy Schürr42195230.25