GrGen: A Fast SPO-Based Graph Rewriting Tool

GrGen: A Fast SPO-Based Graph Rewriting Tool

Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster tha...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Geiß, Rubino, Batz, Gernot Veit, Grund, Daniel, Hack, Sebastian, Szalkowski, Adam
Format: Buchkapitel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 397
container_issue
container_start_page 383
container_title
container_volume
creator Geiß, Rubino
Batz, Gernot Veit
Grund, Daniel
Hack, Sebastian
Szalkowski, Adam
description Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us. Our graph rewriting tool implements the well-founded single-pushout approach. We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. The task of selecting a good search plan is then viewed as an optimization problem. For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface.
doi_str_mv 10.1007/11841883_27
format Book Chapter
fullrecord <record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_11841883_27</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_11841883_27</sourcerecordid><originalsourceid>FETCH-LOGICAL-c767-61a4d3d9a346123dcf3e25829dad94cd3026bbe001dbbe4e4bc9cc77ae0daf63</originalsourceid><addsrcrecordid>eNpVkEtLAzEUheMLHGtX_oFsBaP35qZ5uGuLnQqFiu1-yCQZrZZOmRT8-47owq6-xYFzDh9jNwj3CGAeEK1Ca6mS5oQNnbE0UkDWGilPWYEaURApd3aUgT1nBRBI4YyiS3aV8wcASONkwe7Krky7Rz7mM58PfPWyFBOfU-Rl5_fv_DV9dZvDZvfG1227vWYXjd_mNPzjgK1mT-vpXCyW5fN0vBDBaCM0ehUpOk9Ko6QYGkpyZKWLPjoVYv9E13UCwNhDJVUHF4IxPkH0jaYBu_1tzfuuX05dVbftZ64Qqh8J1T8J9A0LLEe-</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>GrGen: A Fast SPO-Based Graph Rewriting Tool</title><source>Springer Books</source><creator>Geiß, Rubino ; Batz, Gernot Veit ; Grund, Daniel ; Hack, Sebastian ; Szalkowski, Adam</creator><contributor>Corradini, Andrea ; Ehrig, Hartmut ; Ribeiro, Leila ; Montanari, Ugo ; Rozenberg, Grzegorz</contributor><creatorcontrib>Geiß, Rubino ; Batz, Gernot Veit ; Grund, Daniel ; Hack, Sebastian ; Szalkowski, Adam ; Corradini, Andrea ; Ehrig, Hartmut ; Ribeiro, Leila ; Montanari, Ugo ; Rozenberg, Grzegorz</creatorcontrib><description>Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us. Our graph rewriting tool implements the well-founded single-pushout approach. We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. The task of selecting a good search plan is then viewed as an optimization problem. For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540388708</identifier><identifier>ISBN: 3540388702</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540388722</identifier><identifier>EISBN: 3540388729</identifier><identifier>DOI: 10.1007/11841883_27</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><ispartof>Graph Transformations, 2006, p.383-397</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c767-61a4d3d9a346123dcf3e25829dad94cd3026bbe001dbbe4e4bc9cc77ae0daf63</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11841883_27$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11841883_27$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>775,776,780,789,27904,38234,41421,42490</link.rule.ids></links><search><contributor>Corradini, Andrea</contributor><contributor>Ehrig, Hartmut</contributor><contributor>Ribeiro, Leila</contributor><contributor>Montanari, Ugo</contributor><contributor>Rozenberg, Grzegorz</contributor><creatorcontrib>Geiß, Rubino</creatorcontrib><creatorcontrib>Batz, Gernot Veit</creatorcontrib><creatorcontrib>Grund, Daniel</creatorcontrib><creatorcontrib>Hack, Sebastian</creatorcontrib><creatorcontrib>Szalkowski, Adam</creatorcontrib><title>GrGen: A Fast SPO-Based Graph Rewriting Tool</title><title>Graph Transformations</title><description>Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us. Our graph rewriting tool implements the well-founded single-pushout approach. We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. The task of selecting a good search plan is then viewed as an optimization problem. For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface.</description><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540388708</isbn><isbn>3540388702</isbn><isbn>9783540388722</isbn><isbn>3540388729</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2006</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpVkEtLAzEUheMLHGtX_oFsBaP35qZ5uGuLnQqFiu1-yCQZrZZOmRT8-47owq6-xYFzDh9jNwj3CGAeEK1Ca6mS5oQNnbE0UkDWGilPWYEaURApd3aUgT1nBRBI4YyiS3aV8wcASONkwe7Krky7Rz7mM58PfPWyFBOfU-Rl5_fv_DV9dZvDZvfG1227vWYXjd_mNPzjgK1mT-vpXCyW5fN0vBDBaCM0ehUpOk9Ko6QYGkpyZKWLPjoVYv9E13UCwNhDJVUHF4IxPkH0jaYBu_1tzfuuX05dVbftZ64Qqh8J1T8J9A0LLEe-</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Geiß, Rubino</creator><creator>Batz, Gernot Veit</creator><creator>Grund, Daniel</creator><creator>Hack, Sebastian</creator><creator>Szalkowski, Adam</creator><general>Springer Berlin Heidelberg</general><scope/></search><sort><creationdate>2006</creationdate><title>GrGen: A Fast SPO-Based Graph Rewriting Tool</title><author>Geiß, Rubino ; Batz, Gernot Veit ; Grund, Daniel ; Hack, Sebastian ; Szalkowski, Adam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c767-61a4d3d9a346123dcf3e25829dad94cd3026bbe001dbbe4e4bc9cc77ae0daf63</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2006</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Geiß, Rubino</creatorcontrib><creatorcontrib>Batz, Gernot Veit</creatorcontrib><creatorcontrib>Grund, Daniel</creatorcontrib><creatorcontrib>Hack, Sebastian</creatorcontrib><creatorcontrib>Szalkowski, Adam</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Geiß, Rubino</au><au>Batz, Gernot Veit</au><au>Grund, Daniel</au><au>Hack, Sebastian</au><au>Szalkowski, Adam</au><au>Corradini, Andrea</au><au>Ehrig, Hartmut</au><au>Ribeiro, Leila</au><au>Montanari, Ugo</au><au>Rozenberg, Grzegorz</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>GrGen: A Fast SPO-Based Graph Rewriting Tool</atitle><btitle>Graph Transformations</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2006</date><risdate>2006</risdate><spage>383</spage><epage>397</epage><pages>383-397</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540388708</isbn><isbn>3540388702</isbn><eisbn>9783540388722</eisbn><eisbn>3540388729</eisbn><abstract>Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us. Our graph rewriting tool implements the well-founded single-pushout approach. We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. The task of selecting a good search plan is then viewed as an optimization problem. For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11841883_27</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Graph Transformations, 2006, p.383-397
issn 0302-9743
1611-3349
language eng
recordid cdi_springer_books_10_1007_11841883_27
source Springer Books
title GrGen: A Fast SPO-Based Graph Rewriting Tool
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T02%3A37%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=GrGen:%20A%20Fast%20SPO-Based%20Graph%20Rewriting%20Tool&rft.btitle=Graph%20Transformations&rft.au=Gei%C3%9F,%20Rubino&rft.date=2006&rft.spage=383&rft.epage=397&rft.pages=383-397&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540388708&rft.isbn_list=3540388702&rft_id=info:doi/10.1007/11841883_27&rft_dat=%3Cspringer%3Espringer_books_10_1007_11841883_27%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540388722&rft.eisbn_list=3540388729&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true