کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
422836 | 685147 | 2006 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans 1
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for pattern traversal (as an extension to traditional multiplicity and type considerations of existing tools) by estimating the expected performance of search plans on typical instance models that are available at transformation design time. Then, an adaptive approach for graph pattern matching is presented, where the optimal search plan can be selected from previously generated search plans at run-time based on statistical data collected from the current instance model under transformation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 152, 27 March 2006, Pages 191-205
Journal: Electronic Notes in Theoretical Computer Science - Volume 152, 27 March 2006, Pages 191-205