{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T11:26:32Z","timestamp":1751109992096,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["P18-FR-2895","PGC2018-094905-B-I00"],"award-info":[{"award-number":["P18-FR-2895","PGC2018-094905-B-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["RTI2018-101204-B-C21","US-1264651"],"award-info":[{"award-number":["RTI2018-101204-B-C21","US-1264651"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10270-020-00832-3","type":"journal-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:02:56Z","timestamp":1604275376000},"page":"1011-1041","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improving query performance on dynamic graphs"],"prefix":"10.1007","volume":"20","author":[{"given":"Gala","family":"Barquero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1314-9694","authenticated-orcid":false,"given":"Javier","family":"Troya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Vallecillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Acharya, S., Gibbons, P.B., Poosala, V.: Congressional samples for approximate answering of group-by queries. In: Proc. of SIGMOD\u201900, pp. 487\u2013498. ACM (2000). https:\/\/doi.org\/10.1145\/342009.335450","key":"832_CR1","DOI":"10.1145\/342009.335450"},{"issue":"12","key":"832_CR2","doi-asserted-by":"publisher","first-page":"1902","DOI":"10.14778\/2367502.2367533","volume":"5","author":"S Agarwal","year":"2012","unstructured":"Agarwal, S., Panda, A., Mozafari, B., Iyer, A.P., Madden, S., Stoica, I.: Blink and it\u2019s done: interactive queries on very large data. PVLDB 5(12), 1902\u20131905 (2012). https:\/\/doi.org\/10.14778\/2367502.2367533","journal-title":"PVLDB"},{"issue":"5","key":"832_CR3","doi-asserted-by":"publisher","first-page":"68:1","DOI":"10.1145\/3104031","volume":"50","author":"R Angles","year":"2017","unstructured":"Angles, R., Arenas, M., Barcel\u00f3, P., Hogan, A., Reutter, J.L., Vrgoc, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50(5), 68:1\u201368:40 (2017). https:\/\/doi.org\/10.1145\/3104031","journal-title":"ACM Comput. Surv."},{"unstructured":"Apache Spark: Spark streaming programming. https:\/\/spark.apache.org\/docs\/latest\/streaming-programming-guide.html. Accessed May 2019","key":"832_CR4"},{"unstructured":"Apache Spark: GraphFrames. https:\/\/graphframes.github.io\/graphframes\/docs\/_site\/index.html. Accessed Nov 2019","key":"832_CR5"},{"unstructured":"Apache TinkerPop: The Gremlin graph traversal machine and language. https:\/\/tinkerpop.apache.org\/gremlin.html. Accessed Jan 2020","key":"832_CR6"},{"doi-asserted-by":"publisher","unstructured":"Babcock, B., Chaudhuri, S., Das, G.: Dynamic sample selection for approximate query processing. In: Proc. of SIGMOD\u201903, pp. 539\u2013550. ACM (2003). https:\/\/doi.org\/10.1145\/872757.872822","key":"832_CR7","DOI":"10.1145\/872757.872822"},{"doi-asserted-by":"publisher","unstructured":"Barcel\u00f3, P.: Querying graph databases. In: Proc. of PODS\u201913, pp. 175\u2013188. ACM (2013). https:\/\/doi.org\/10.1145\/2463664.2465216","key":"832_CR8","DOI":"10.1145\/2463664.2465216"},{"doi-asserted-by":"publisher","unstructured":"Barquero, G., Burgue\u00f1o, L., Troya, J., Vallecillo, A.: Extending complex event processing to graph-structured information. In: Proc. of MODELS\u201918, pp. 166\u2013175. ACM (2018). https:\/\/doi.org\/10.1145\/3239372.3239402","key":"832_CR9","DOI":"10.1145\/3239372.3239402"},{"issue":"2","key":"832_CR10","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.5381\/jot.2019.18.2.a9","volume":"18","author":"G Barquero","year":"2019","unstructured":"Barquero, G., Troya, J., Vallecillo, A.: Trading accuracy for performance in data processing applications. J. Object Technol. 18(2), 9:1\u20139:24 (2019). https:\/\/doi.org\/10.5381\/jot.2019.18.2.a9","journal-title":"J. Object Technol."},{"unstructured":"Barquero, G., Troya, J., Vallecillo, A.: SDR algorithm git repository. https:\/\/github.com\/atenearesearchgroup\/SDRalgorithm. Accessed Jan 2020","key":"832_CR11"},{"unstructured":"Barquero, G., Troya, J., Vallecillo, A.: SDR algorithm website. http:\/\/atenea.lcc.uma.es\/projects\/SDRAlg.html. Accessed Jan 2020","key":"832_CR12"},{"unstructured":"BBVA: The impact of the Mobile World Congress in a dynamic visualization by BBVA and CartoDB (2013). https:\/\/www.bbva.com\/en\/impact-mobile-world-congress-dynamic-visualization-bbva-cartodb\/. Accessed Jan 2020","key":"832_CR13"},{"doi-asserted-by":"publisher","unstructured":"Bergmann, G., Horv\u00e1th, \u00c1., R\u00e1th, I., Varr\u00f3, D., Balogh, A., Balogh, Z., \u00d6kr\u00f6s, A.: Incremental evaluation of model queries over EMF models. In: Proc. of MODELS\u201910, pp. 76\u201390 (2010). https:\/\/doi.org\/10.1007\/978-3-642-16145-2_6","key":"832_CR14","DOI":"10.1007\/978-3-642-16145-2_6"},{"doi-asserted-by":"crossref","unstructured":"Bergmann, G., \u00d6kr\u00f6s, A., R\u00e1th, I., Varr\u00f3, D., Varr\u00f3, G.: Incremental pattern matching in the VIATRA model transformation system. In: Proc. of GRAMOT\u201908, pp. 25\u201332. ACM (2008)","key":"832_CR15","DOI":"10.1145\/1402947.1402953"},{"unstructured":"Besta, M., Fischer, M., Kalavri, V., Kapralov, M., Hoefler, T.: Practice of streaming and dynamic graphs: concepts, models, systems, and parallelism. CoRR arXiv:1912.12740 (2019)","key":"832_CR16"},{"unstructured":"Besta, M., Peter, E., Gerstenberger, R., Fischer, M., Podstawski, M., Barthels, C., Alonso, G., Hoefler, T.: Demystifying graph databases: analysis and taxonomy of data organization, system designs, and graph queries. CoRR arXiv:1910.09017 (2019)","key":"832_CR17"},{"unstructured":"Callidus Software Inc.: OrientDB. The database designed for the modern world. https:\/\/orientdb.com\/. Accessed June 2020","key":"832_CR18"},{"doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Das, G., Datar, M., Motwani, R., Narasayya, V.R.: Overcoming limitations of sampling for aggregation queries. In: Proc. of ICDE\u201901, pp. 534\u2013542. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/ICDE.2001.914867","key":"832_CR19","DOI":"10.1109\/ICDE.2001.914867"},{"doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Das, G., Narasayya, V.R.: A robust, optimization-based approach for approximate answering of aggregate queries. In: Proc. of SIGMOD\u201901, pp. 295\u2013306. ACM (2001). https:\/\/doi.org\/10.1145\/375663.375694","key":"832_CR20","DOI":"10.1145\/375663.375694"},{"doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Ding, B., Kandula, S.: Approximate query processing: no silver bullet. In: Proc. of SIGMOD\u201917, pp. 511\u2013519. ACM (2017). https:\/\/doi.org\/10.1145\/3035918.3056097","key":"832_CR21","DOI":"10.1145\/3035918.3056097"},{"issue":"3","key":"832_CR22","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2187671.2187677","volume":"44","author":"G Cugola","year":"2012","unstructured":"Cugola, G., Margara, A.: Processing flows of information: from data stream to complex event processing. ACM Comput. Surv. 44(3), 15:1\u201315:62 (2012). https:\/\/doi.org\/10.1145\/2187671.2187677","journal-title":"ACM Comput. Surv."},{"key":"832_CR23","volume-title":"Event Processing in Action","author":"O Etzion","year":"2010","unstructured":"Etzion, O., Niblett, P.: Event Processing in Action. Manning Publications, New York (2010)"},{"doi-asserted-by":"publisher","unstructured":"Fan, W., Geerts, F., Cao, Y., Deng, T., Lu, P.: Querying big data by accessing small data. In: Proc. of PODS\u201915, pp. 173\u2013184. ACM (2015). https:\/\/doi.org\/10.1145\/2745754.2745771","key":"832_CR24","DOI":"10.1145\/2745754.2745771"},{"issue":"1","key":"832_CR25","doi-asserted-by":"publisher","first-page":"264","DOI":"10.14778\/1920841.1920878","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010). https:\/\/doi.org\/10.14778\/1920841.1920878","journal-title":"PVLDB"},{"doi-asserted-by":"publisher","unstructured":"Fan, W., Wang, X., Wu, Y.: Querying big graphs within bounded resources. In: Proc. of SIGMOD\u201914, pp. 301\u2013312. ACM (2014). https:\/\/doi.org\/10.1145\/2588555.2610513","key":"832_CR26","DOI":"10.1145\/2588555.2610513"},{"unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: Proc. of OSDI\u201914, pp. 599\u2013613 (2014)","key":"832_CR27"},{"unstructured":"Group, C.M.D.: BerkeleyDB. https:\/\/dbdb.io\/db\/berkeley-db. Accessed July 2020","key":"832_CR28"},{"doi-asserted-by":"publisher","unstructured":"Holzschuher, F., Peinl, P.D.R.: Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j. In: Proc. of GraphQ@EDBT\/ICDT\u201913, pp. 195\u2013204 (2013). https:\/\/doi.org\/10.1145\/2457317.2457351","key":"832_CR29","DOI":"10.1145\/2457317.2457351"},{"unstructured":"JanusGraph: Distributed, open source, massively scalable graph database . https:\/\/janusgraph.org\/. Accessed June 2020","key":"832_CR30"},{"doi-asserted-by":"publisher","unstructured":"Johann, S., Egyed, A.: Instant and incremental transformation of models. In: Proc. of ASE\u201904, pp. 362\u2013365. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/ASE.2004.10047","key":"832_CR31","DOI":"10.1109\/ASE.2004.10047"},{"doi-asserted-by":"publisher","unstructured":"Jouault, F., Tisi, M.: Towards incremental execution of ATL transformations. In: Proc. of ICMT\u201910, LNCS, vol. 6142, pp. 123\u2013137. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13688-7_9","key":"832_CR32","DOI":"10.1007\/978-3-642-13688-7_9"},{"unstructured":"Kafka, A.: Apache Kafka. A distributed streaming platform. https:\/\/kafka.apache.org\/intro. Accessed May 2019","key":"832_CR33"},{"issue":"2","key":"832_CR34","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TKDE.2017.2762294","volume":"30","author":"V Kalavri","year":"2018","unstructured":"Kalavri, V., Vlassov, V., Haridi, S.: High-level programming abstractions for distributed graph processing. IEEE Trans. Knowl. Data Eng. 30(2), 305\u2013324 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2762294","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"14","key":"832_CR35","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.14778\/2556549.2556571","volume":"6","author":"K Lee","year":"2013","unstructured":"Lee, K., Liu, L.: Scaling queries over big RDF graphs with semantic hash partitioning. PVLDB 6(14), 1894\u20131905 (2013). https:\/\/doi.org\/10.14778\/2556549.2556571","journal-title":"PVLDB"},{"issue":"4","key":"832_CR36","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s41019-018-0074-4","volume":"3","author":"K Li","year":"2018","unstructured":"Li, K., Li, G.: Approximate query processing: What is new and where to go?\u2014a survey on approximate query processing. Data Sci. Eng. 3(4), 379\u2013397 (2018). https:\/\/doi.org\/10.1007\/s41019-018-0074-4","journal-title":"Data Sci. Eng."},{"unstructured":"Ltd, M.: Memgraph. Difference from Neo4j\u2019s cypher implementation. https:\/\/docs.memgraph.com\/memgraph\/reference-overview\/differences. Accessed Sept 2020","key":"832_CR37"},{"key":"832_CR38","volume-title":"The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems","author":"DC Luckham","year":"2002","unstructured":"Luckham, D.C.: The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems. Addison-Wesley, Boston (2002)"},{"key":"832_CR39","doi-asserted-by":"publisher","DOI":"10.1002\/9781119198697","volume-title":"Event Processing for Business: Organizing the Real-Time Enterprise","author":"DC Luckham","year":"2012","unstructured":"Luckham, D.C.: Event Processing for Business: Organizing the Real-Time Enterprise. Wiley, New York (2012)"},{"doi-asserted-by":"publisher","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, June 6\u201310, 2010, pp. 135\u2013146 (2010). https:\/\/doi.org\/10.1145\/1807167.1807184","key":"832_CR40","DOI":"10.1145\/1807167.1807184"},{"unstructured":"Memgraph Ltd: Memgraph graph database. https:\/\/memgraph.com\/. Accessed Nov 2019","key":"832_CR41"},{"unstructured":"Memgraph Ltd: Memgraph indexing. https:\/\/docs.memgraph.com\/memgraph\/concepts-overview\/indexing. Accessed Sept 2020","key":"832_CR42"},{"doi-asserted-by":"crossref","unstructured":"Mhedhbi, A., Gupta, P., Khaliq, S., Salihoglu, S.: A+ indexes: lightweight and highly flexible adjacency lists for graph database management systems. CoRR arXiv:2004.00130 (2020)","key":"832_CR43","DOI":"10.1109\/ICDE51399.2021.00130"},{"unstructured":"Neo4j: Neo4j graph platform. https:\/\/neo4j.com\/. Accessed Jan 2020","key":"832_CR44"},{"unstructured":"Neo4j: Cypher query language. https:\/\/neo4j.com\/developer\/cypher-query-language\/. Accessed Nov 2019","key":"832_CR45"},{"unstructured":"Neo4j: Neo4j\u2014indexes for search performance. https:\/\/neo4j.com\/docs\/cypher-manual\/current\/administration\/indexes-for-search-performance\/index.html. Accessed Sept 2020","key":"832_CR46"},{"unstructured":"OrientDB: LiveQuery. https:\/\/orientdb.com\/nosql\/livequery\/. Accessed July 2020","key":"832_CR47"},{"unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Tech. rep, Stanford Digital Library Technologies Project (1998)","key":"832_CR48"},{"issue":"4","key":"832_CR49","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1109\/TKDE.2018.2841389","volume":"31","author":"P Peng","year":"2019","unstructured":"Peng, P., Zou, L., Chen, L., Zhao, D.: Adaptive distributed RDF graph fragmentation and allocation based on query workload. IEEE Trans. Knowl. Data Eng. 31(4), 670\u2013685 (2019). https:\/\/doi.org\/10.1109\/TKDE.2018.2841389","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"832_CR50","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S1049096510001848","volume":"44","author":"A Perliger","year":"2011","unstructured":"Perliger, A., Pedahzur, A.: Social network analysis in the study of terrorism and political violence. PS Polit. Sci. Polit. 44(1), 45\u201350 (2011). https:\/\/doi.org\/10.1017\/S1049096510001848","journal-title":"PS Polit. Sci. Polit."},{"doi-asserted-by":"publisher","unstructured":"Razavi, A., Kontogiannis, K.: Partial evaluation of model transformations. In: Proc. of ICSE\u201912, pp. 562\u2013572. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/ICSE.2012.6227160","key":"832_CR51","DOI":"10.1109\/ICSE.2012.6227160"},{"unstructured":"Real, E., Shlens, J., , Pan, S.M.X., Vanhoucke, V.: YouTube-BoundingBoxes dataset. https:\/\/research.google.com\/youtube-bb\/. Accessed Oct 2019","key":"832_CR52"},{"unstructured":"Richardson, M., Domingos, P.M.: The intelligent surfer: probabilistic combination of link and content information in PageRank. In: proc. of NIPS\u201901, pp. 1441\u20131448. MIT Press (2001)","key":"832_CR53"},{"doi-asserted-by":"publisher","unstructured":"Sz\u00e1rnyas, G., Izs\u00f3, B., R\u00e1th, I., Harmath, D., Bergmann, G., Varr\u00f3, D.: IncQuery-D: a distributed incremental model query framework in the cloud. In: Proc. of MODELS\u201914, pp. 653\u2013669 (2014). https:\/\/doi.org\/10.1007\/978-3-319-11653-2_40","key":"832_CR54","DOI":"10.1007\/978-3-319-11653-2_40"},{"issue":"4","key":"832_CR55","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s10270-016-0571-8","volume":"17","author":"G Sz\u00e1rnyas","year":"2018","unstructured":"Sz\u00e1rnyas, G., Izs\u00f3, B., R\u00e1th, I., Varr\u00f3, D.: The Train Benchmark: cross-technology performance evaluation of continuous model queries. Softw. Syst. Model. 17(4), 1365\u20131393 (2018). https:\/\/doi.org\/10.1007\/s10270-016-0571-8","journal-title":"Softw. Syst. Model."},{"unstructured":"Sz\u00e1rnyas, G., Marton, J., Maginecz, J., Varr\u00f3, D.: Reducing property graph queries to relational algebra for incremental view maintenance. CoRR arXiv:1806.07344 (2018)","key":"832_CR56"},{"unstructured":"The New Yorker: Data from the New Yorker caption contest. https:\/\/github.com\/nextml\/caption-contest-data. Accessed Oct 2019","key":"832_CR57"},{"unstructured":"TinkerPop: Apache TinkerGraph. http:\/\/tinkerpop.apache.org\/docs\/current\/reference\/#tinkergraph-gremlin. Accessed Oct 2019","key":"832_CR58"},{"unstructured":"TinkerPop: TinkerGraph indices. https:\/\/tinkerpop.apache.org\/javadocs\/3.2.2\/full\/org\/apache\/tinkerpop\/gremlin\/tinkergraph\/structure\/TinkerGraph.html#vertexIndex. Accessed Sept 2020","key":"832_CR59"},{"unstructured":"Tinkerpop, A.: Interface vertex program. http:\/\/tinkerpop.apache.org\/javadocs\/3.1.4\/core\/org\/apache\/tinkerpop\/gremlin\/process\/computer\/VertexProgram.html. Accessed Jan 2020","key":"832_CR60"},{"unstructured":"Troya, J., Wimmer, M., Burgue\u00f1o, L., Vallecillo, A.: Towards approximate model transformations. In: Proc. of AMT@MoDELS\u201914, pp. 44\u201353. CEUR-WS (2014)","key":"832_CR61"},{"doi-asserted-by":"publisher","unstructured":"Trushkowsky, B., Kraska, T., Franklin, M.J., Sarkar, P.: Crowdsourced enumeration queries. In: Proc. of ICDE\u201913, pp. 673\u2013684 (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544865","key":"832_CR62","DOI":"10.1109\/ICDE.2013.6544865"},{"issue":"1","key":"832_CR63","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/2845644","volume":"59","author":"B Trushkowsky","year":"2016","unstructured":"Trushkowsky, B., Kraska, T., Franklin, M.J., Sarkar, P.: Answering enumeration queries with the crowd. Commun. ACM 59(1), 118\u2013127 (2016)","journal-title":"Commun. ACM"},{"key":"832_CR64","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.scico.2014.01.004","volume":"98","author":"Z Ujhelyi","year":"2015","unstructured":"Ujhelyi, Z., Bergmann, G., Heged\u00fcs, \u00c1., Horv\u00e1th, \u00c1., Izs\u00f3, B., R\u00e1th, I., Szatm\u00e1ri, Z., Varr\u00f3, D.: EMF-IncQuery: an integrated development environment for live model queries. Sci. Comput. Program. 98, 80\u201399 (2015). https:\/\/doi.org\/10.1016\/j.scico.2014.01.004","journal-title":"Sci. Comput. Program."},{"doi-asserted-by":"publisher","unstructured":"Uta, A., Ghit, B., Dave, A., Boncz, P.A.: [Demo] Low-latency spark queries on updatable data. In: Proc. of SIGMOD\u201919, pp. 2009\u20132012 (2019). https:\/\/doi.org\/10.1145\/3299869.3320227","key":"832_CR65","DOI":"10.1145\/3299869.3320227"},{"unstructured":"W3C RDF Data Access Working Group: SPARQL query language. https:\/\/www.w3.org\/TR\/rdf-sparql-query\/. Accessed Jan 2020","key":"832_CR66"},{"doi-asserted-by":"publisher","unstructured":"Wang, Y., Parthasarathy, S., Sadayappan, P.: Stratification driven placement of complex data: a framework for distributed data analytics. In: Proc. of ICDE\u201913, pp. 709\u2013720. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544868","key":"832_CR67","DOI":"10.1109\/ICDE.2013.6544868"},{"unstructured":"Webber, J., Robinson, I., Eifrem, E.: Graph databases. O\u2019Reilly Media (2013)","key":"832_CR68"},{"key":"832_CR69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29044-2","volume-title":"Experimentation in Software Engineering","author":"C Wohlin","year":"2012","unstructured":"Wohlin, C., Runeson, P., H\u00f6st, M., Ohlsson, M.C., Regnell, B.: Experimentation in Software Engineering. Springer, Berlin (2012)"},{"key":"832_CR70","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8265-9_183","volume-title":"Encyclopedia of Database Systems","author":"PT Wood","year":"2018","unstructured":"Wood, P.T.: Graph database. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, 2nd edn. Springer, New York (2018). https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_183","edition":"2"},{"doi-asserted-by":"publisher","unstructured":"Yang, C.C., Ng, T.D.: Terrorism and crime related weblog social network: link, content analysis and information visualization. In: Proc. of ISI\u201907, pp. 55\u201358. IEEE (2007). https:\/\/doi.org\/10.1109\/ISI.2007.379533","key":"832_CR71","DOI":"10.1109\/ISI.2007.379533"}],"container-title":["Software and Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-020-00832-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10270-020-00832-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-020-00832-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:52:44Z","timestamp":1630432364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10270-020-00832-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,2]]},"references-count":71,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["832"],"URL":"https:\/\/doi.org\/10.1007\/s10270-020-00832-3","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"type":"print","value":"1619-1366"},{"type":"electronic","value":"1619-1374"}],"subject":[],"published":{"date-parts":[[2020,11,2]]},"assertion":[{"value":"30 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}