A cross-technology benchmark for incremental graph queries
To cope with the increased complexity of systems, models are used to capture what is considered the essence of a system. Such models are typically represented as a graph, which is queried to gain insight into the modelled system. Often, the results of these queries need to be adjusted according to u...
Gespeichert in:
Veröffentlicht in: | Software and systems modeling 2022-04, Vol.21 (2), p.755-804 |
---|---|
Hauptverfasser: | , , , , , , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 804 |
---|---|
container_issue | 2 |
container_start_page | 755 |
container_title | Software and systems modeling |
container_volume | 21 |
creator | Hinkel, Georg Garcia-Dominguez, Antonio Schöne, René Boronat, Artur Tisi, Massimo Le Calvar, Théo Jouault, Frederic Marton, József Nyíri, Tamás Antal, János Benjamin Elekes, Márton Szárnyas, Gábor |
description | To cope with the increased complexity of systems, models are used to capture what is considered the essence of a system. Such models are typically represented as a graph, which is queried to gain insight into the modelled system. Often, the results of these queries need to be adjusted according to updated requirements and are therefore a subject of maintenance activities. It is thus necessary to support writing model queries with adequate languages. However, in order to stay meaningful, the analysis results need to be refreshed as soon as the underlying models change. Therefore, a good execution speed is mandatory in order to cope with frequent model changes. In this paper, we propose a benchmark to assess model query technologies in the presence of model change sequences in the domain of social media. We present solutions to this benchmark in a variety of 11 different tools and compare them with respect to explicitness of incrementalization, asymptotic complexity and performance. |
doi_str_mv | 10.1007/s10270-021-00927-5 |
format | Article |
fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_03594453v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2647959201</sourcerecordid><originalsourceid>FETCH-LOGICAL-c348t-50284a46045c6bc04f9f1c55d8f79206167f1a3992d1da2e98f2de8e803e97ec3</originalsourceid><addsrcrecordid>eNp9kM1KAzEUhYMoWGpfwNWAKxfRm_-Ju1LUCgU3ug5pJumMtjM1mQp9e9OO1J2rXMJ3zj33IHRN4I4AqPtEgCrAQAkG0FRhcYZGRBKNCVP8_DRLeYkmKTVLAE615lKO0MO0cLFLCffe1W237lb7YulbV29s_CxCF4umddFvfNvbdbGKdlsXXzsfG5-u0EWw6-Qnv-8YvT89vs3mePH6_DKbLrBjvOyxAFpyyyVw4eTSAQ86ECdEVQalKUgiVSCWaU0rUlnqdRlo5UtfAvNaecfG6Hbwre3abGOTk-1NZxszny7M4Q-Y0JwL9k0yezOw29jlmKk3H90utjmeoZIrLfLGA0UH6nh69OFkS8AcKjVDpSZXao6VGpFFbBClDLcrH_-s_1H9AJXndxk</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2647959201</pqid></control><display><type>article</type><title>A cross-technology benchmark for incremental graph queries</title><source>Springer Nature - Complete Springer Journals</source><creator>Hinkel, Georg ; Garcia-Dominguez, Antonio ; Schöne, René ; Boronat, Artur ; Tisi, Massimo ; Le Calvar, Théo ; Jouault, Frederic ; Marton, József ; Nyíri, Tamás ; Antal, János Benjamin ; Elekes, Márton ; Szárnyas, Gábor</creator><creatorcontrib>Hinkel, Georg ; Garcia-Dominguez, Antonio ; Schöne, René ; Boronat, Artur ; Tisi, Massimo ; Le Calvar, Théo ; Jouault, Frederic ; Marton, József ; Nyíri, Tamás ; Antal, János Benjamin ; Elekes, Márton ; Szárnyas, Gábor</creatorcontrib><description>To cope with the increased complexity of systems, models are used to capture what is considered the essence of a system. Such models are typically represented as a graph, which is queried to gain insight into the modelled system. Often, the results of these queries need to be adjusted according to updated requirements and are therefore a subject of maintenance activities. It is thus necessary to support writing model queries with adequate languages. However, in order to stay meaningful, the analysis results need to be refreshed as soon as the underlying models change. Therefore, a good execution speed is mandatory in order to cope with frequent model changes. In this paper, we propose a benchmark to assess model query technologies in the presence of model change sequences in the domain of social media. We present solutions to this benchmark in a variety of 11 different tools and compare them with respect to explicitness of incrementalization, asymptotic complexity and performance.</description><identifier>ISSN: 1619-1366</identifier><identifier>EISSN: 1619-1374</identifier><identifier>DOI: 10.1007/s10270-021-00927-5</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Benchmarks ; Compilers ; Complexity ; Computer Science ; Graphical representations ; Informatics ; Information Systems Applications (incl.Internet) ; Interpreters ; IT in Business ; Programming Languages ; Programming Techniques ; Propagation ; Queries ; Regular Paper ; Social networks ; Software Engineering ; Software Engineering/Programming and Operating Systems</subject><ispartof>Software and systems modeling, 2022-04, Vol.21 (2), p.755-804</ispartof><rights>The Author(s) 2021</rights><rights>The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c348t-50284a46045c6bc04f9f1c55d8f79206167f1a3992d1da2e98f2de8e803e97ec3</cites><orcidid>0000-0003-2273-2053 ; 0000-0001-7891-9138</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10270-021-00927-5$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10270-021-00927-5$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>230,314,776,780,881,27903,27904,41467,42536,51298</link.rule.ids><backlink>$$Uhttps://hal.science/hal-03594453$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Hinkel, Georg</creatorcontrib><creatorcontrib>Garcia-Dominguez, Antonio</creatorcontrib><creatorcontrib>Schöne, René</creatorcontrib><creatorcontrib>Boronat, Artur</creatorcontrib><creatorcontrib>Tisi, Massimo</creatorcontrib><creatorcontrib>Le Calvar, Théo</creatorcontrib><creatorcontrib>Jouault, Frederic</creatorcontrib><creatorcontrib>Marton, József</creatorcontrib><creatorcontrib>Nyíri, Tamás</creatorcontrib><creatorcontrib>Antal, János Benjamin</creatorcontrib><creatorcontrib>Elekes, Márton</creatorcontrib><creatorcontrib>Szárnyas, Gábor</creatorcontrib><title>A cross-technology benchmark for incremental graph queries</title><title>Software and systems modeling</title><addtitle>Softw Syst Model</addtitle><description>To cope with the increased complexity of systems, models are used to capture what is considered the essence of a system. Such models are typically represented as a graph, which is queried to gain insight into the modelled system. Often, the results of these queries need to be adjusted according to updated requirements and are therefore a subject of maintenance activities. It is thus necessary to support writing model queries with adequate languages. However, in order to stay meaningful, the analysis results need to be refreshed as soon as the underlying models change. Therefore, a good execution speed is mandatory in order to cope with frequent model changes. In this paper, we propose a benchmark to assess model query technologies in the presence of model change sequences in the domain of social media. We present solutions to this benchmark in a variety of 11 different tools and compare them with respect to explicitness of incrementalization, asymptotic complexity and performance.</description><subject>Algorithms</subject><subject>Benchmarks</subject><subject>Compilers</subject><subject>Complexity</subject><subject>Computer Science</subject><subject>Graphical representations</subject><subject>Informatics</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Interpreters</subject><subject>IT in Business</subject><subject>Programming Languages</subject><subject>Programming Techniques</subject><subject>Propagation</subject><subject>Queries</subject><subject>Regular Paper</subject><subject>Social networks</subject><subject>Software Engineering</subject><subject>Software Engineering/Programming and Operating Systems</subject><issn>1619-1366</issn><issn>1619-1374</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kM1KAzEUhYMoWGpfwNWAKxfRm_-Ju1LUCgU3ug5pJumMtjM1mQp9e9OO1J2rXMJ3zj33IHRN4I4AqPtEgCrAQAkG0FRhcYZGRBKNCVP8_DRLeYkmKTVLAE615lKO0MO0cLFLCffe1W237lb7YulbV29s_CxCF4umddFvfNvbdbGKdlsXXzsfG5-u0EWw6-Qnv-8YvT89vs3mePH6_DKbLrBjvOyxAFpyyyVw4eTSAQ86ECdEVQalKUgiVSCWaU0rUlnqdRlo5UtfAvNaecfG6Hbwre3abGOTk-1NZxszny7M4Q-Y0JwL9k0yezOw29jlmKk3H90utjmeoZIrLfLGA0UH6nh69OFkS8AcKjVDpSZXao6VGpFFbBClDLcrH_-s_1H9AJXndxk</recordid><startdate>20220401</startdate><enddate>20220401</enddate><creator>Hinkel, Georg</creator><creator>Garcia-Dominguez, Antonio</creator><creator>Schöne, René</creator><creator>Boronat, Artur</creator><creator>Tisi, Massimo</creator><creator>Le Calvar, Théo</creator><creator>Jouault, Frederic</creator><creator>Marton, József</creator><creator>Nyíri, Tamás</creator><creator>Antal, János Benjamin</creator><creator>Elekes, Márton</creator><creator>Szárnyas, Gábor</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><general>Springer Verlag</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-2273-2053</orcidid><orcidid>https://orcid.org/0000-0001-7891-9138</orcidid></search><sort><creationdate>20220401</creationdate><title>A cross-technology benchmark for incremental graph queries</title><author>Hinkel, Georg ; Garcia-Dominguez, Antonio ; Schöne, René ; Boronat, Artur ; Tisi, Massimo ; Le Calvar, Théo ; Jouault, Frederic ; Marton, József ; Nyíri, Tamás ; Antal, János Benjamin ; Elekes, Márton ; Szárnyas, Gábor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c348t-50284a46045c6bc04f9f1c55d8f79206167f1a3992d1da2e98f2de8e803e97ec3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Benchmarks</topic><topic>Compilers</topic><topic>Complexity</topic><topic>Computer Science</topic><topic>Graphical representations</topic><topic>Informatics</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Interpreters</topic><topic>IT in Business</topic><topic>Programming Languages</topic><topic>Programming Techniques</topic><topic>Propagation</topic><topic>Queries</topic><topic>Regular Paper</topic><topic>Social networks</topic><topic>Software Engineering</topic><topic>Software Engineering/Programming and Operating Systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hinkel, Georg</creatorcontrib><creatorcontrib>Garcia-Dominguez, Antonio</creatorcontrib><creatorcontrib>Schöne, René</creatorcontrib><creatorcontrib>Boronat, Artur</creatorcontrib><creatorcontrib>Tisi, Massimo</creatorcontrib><creatorcontrib>Le Calvar, Théo</creatorcontrib><creatorcontrib>Jouault, Frederic</creatorcontrib><creatorcontrib>Marton, József</creatorcontrib><creatorcontrib>Nyíri, Tamás</creatorcontrib><creatorcontrib>Antal, János Benjamin</creatorcontrib><creatorcontrib>Elekes, Márton</creatorcontrib><creatorcontrib>Szárnyas, Gábor</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Software and systems modeling</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hinkel, Georg</au><au>Garcia-Dominguez, Antonio</au><au>Schöne, René</au><au>Boronat, Artur</au><au>Tisi, Massimo</au><au>Le Calvar, Théo</au><au>Jouault, Frederic</au><au>Marton, József</au><au>Nyíri, Tamás</au><au>Antal, János Benjamin</au><au>Elekes, Márton</au><au>Szárnyas, Gábor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A cross-technology benchmark for incremental graph queries</atitle><jtitle>Software and systems modeling</jtitle><stitle>Softw Syst Model</stitle><date>2022-04-01</date><risdate>2022</risdate><volume>21</volume><issue>2</issue><spage>755</spage><epage>804</epage><pages>755-804</pages><issn>1619-1366</issn><eissn>1619-1374</eissn><abstract>To cope with the increased complexity of systems, models are used to capture what is considered the essence of a system. Such models are typically represented as a graph, which is queried to gain insight into the modelled system. Often, the results of these queries need to be adjusted according to updated requirements and are therefore a subject of maintenance activities. It is thus necessary to support writing model queries with adequate languages. However, in order to stay meaningful, the analysis results need to be refreshed as soon as the underlying models change. Therefore, a good execution speed is mandatory in order to cope with frequent model changes. In this paper, we propose a benchmark to assess model query technologies in the presence of model change sequences in the domain of social media. We present solutions to this benchmark in a variety of 11 different tools and compare them with respect to explicitness of incrementalization, asymptotic complexity and performance.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s10270-021-00927-5</doi><tpages>50</tpages><orcidid>https://orcid.org/0000-0003-2273-2053</orcidid><orcidid>https://orcid.org/0000-0001-7891-9138</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1619-1366 |
ispartof | Software and systems modeling, 2022-04, Vol.21 (2), p.755-804 |
issn | 1619-1366 1619-1374 |
language | eng |
recordid | cdi_hal_primary_oai_HAL_hal_03594453v1 |
source | Springer Nature - Complete Springer Journals |
subjects | Algorithms Benchmarks Compilers Complexity Computer Science Graphical representations Informatics Information Systems Applications (incl.Internet) Interpreters IT in Business Programming Languages Programming Techniques Propagation Queries Regular Paper Social networks Software Engineering Software Engineering/Programming and Operating Systems |
title | A cross-technology benchmark for incremental graph queries |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T14%3A09%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20cross-technology%20benchmark%20for%20incremental%20graph%20queries&rft.jtitle=Software%20and%20systems%20modeling&rft.au=Hinkel,%20Georg&rft.date=2022-04-01&rft.volume=21&rft.issue=2&rft.spage=755&rft.epage=804&rft.pages=755-804&rft.issn=1619-1366&rft.eissn=1619-1374&rft_id=info:doi/10.1007/s10270-021-00927-5&rft_dat=%3Cproquest_hal_p%3E2647959201%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2647959201&rft_id=info:pmid/&rfr_iscdi=true |