{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:29Z","timestamp":1760597909892,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,30]],"date-time":"2019-11-30T00:00:00Z","timestamp":1575072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,30]],"date-time":"2019-11-30T00:00:00Z","timestamp":1575072000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2016YFC1401900"],"award-info":[{"award-number":["2016YFC1401900"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572119"],"award-info":[{"award-number":["61572119"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572121"],"award-info":[{"award-number":["61572121"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61622202"],"award-info":[{"award-number":["61622202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61732003"],"award-info":[{"award-number":["61732003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61729201"],"award-info":[{"award-number":["61729201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702086"],"award-info":[{"award-number":["61702086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1401256"],"award-info":[{"award-number":["U1401256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["N171604007"],"award-info":[{"award-number":["N171604007"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["N171904007"],"award-info":[{"award-number":["N171904007"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10707-019-00381-y","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T10:37:30Z","timestamp":1575283050000},"page":"199-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Graph simulation on large scale temporal graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Yuliang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,30]]},"reference":[{"key":"381_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wang H, et al. (2010) Managing and mining graph data, vol 40. Springer","DOI":"10.1007\/978-1-4419-6045-0"},{"issue":"1","key":"381_CR2","first-page":"1544","volume":"2","author":"HS de Andrade","year":"2009","unstructured":"de Andrade HS, Sales CL (2009) Pattern match query in a large graph database. Encontros Universit\u00e1rios da UFC 2(1):1544","journal-title":"Encontros Universit\u00e1rios da UFC"},{"key":"381_CR3","unstructured":"Cacciari L, Rafiq O (1995) A temporal reachability analysis. In: International conference on protocol specification, testing and verification. Springer, pp 35\u201349"},{"issue":"1","key":"381_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10115-007-0117-z","volume":"16","author":"J Chan","year":"2008","unstructured":"Chan J, Bailey J, Leckie C (2008) Discovering correlated spatio-temporal changes in evolving graphs. Knowl Inf Syst 16(1):53\u201396","journal-title":"Knowl Inf Syst"},{"key":"381_CR5","doi-asserted-by":"crossref","unstructured":"Chen L, Cong G, Cao X, Tan KL (2015) Temporal spatial-keyword top-k publish\/subscribe. In: 2015 IEEE 31St international conference on data engineering. IEEE, pp 255\u2013266","DOI":"10.1109\/ICDE.2015.7113289"},{"issue":"1\u20132","key":"381_CR6","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 (2010) Graph pattern matching: from intractable to polynomial time. Proc VLDB Endow 3(1\u20132):264\u2013275","journal-title":"Proc VLDB Endow"},{"key":"381_CR7","doi-asserted-by":"crossref","unstructured":"Fan W, Li J, Wang X, Wu Y (2012) Query preserving graph compression. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data. ACM, pp 157\u2013168","DOI":"10.1145\/2213836.2213855"},{"key":"381_CR8","doi-asserted-by":"crossref","unstructured":"Fan W, Wang X, Wu Y (2014) Querying big graphs within bounded resources. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 301\u2013 312","DOI":"10.1145\/2588555.2610513"},{"issue":"12","key":"381_CR9","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.14778\/2732977.2732983","volume":"7","author":"W Fan","year":"2014","unstructured":"Fan W, Wang X, Wu Y, Deng D (2014) Distributed graph simulation: impossibility and possibility. Proc VLDB Endow 7(12):1083\u20131094","journal-title":"Proc VLDB Endow"},{"key":"381_CR10","doi-asserted-by":"crossref","unstructured":"He H, Singh AK (2008) Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data. ACM, pp 405\u2013418","DOI":"10.1145\/1376616.1376660"},{"key":"381_CR11","doi-asserted-by":"crossref","unstructured":"Henzinger MR, Henzinger TA, Kopke PW (1995) Computing simulations on finite and infinite graphs. In: Proceedings of IEEE 36th annual foundations of computer science. IEEE, pp 453\u2013462","DOI":"10.1109\/SFCS.1995.492576"},{"key":"381_CR12","doi-asserted-by":"crossref","unstructured":"Holme P, Saram\u00e4ki J (2013) Temporal networks. Springer","DOI":"10.1007\/978-3-642-36461-7"},{"key":"381_CR13","doi-asserted-by":"crossref","unstructured":"Huang S, Fu AWC, Liu R (2015) Minimum spanning trees in temporal graphs. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM, pp 419\u2013430","DOI":"10.1145\/2723372.2723717"},{"key":"381_CR14","doi-asserted-by":"crossref","unstructured":"Jamil H (2011) Computing subgraph isomorphic queries using structural unification and minimum graph structures. In: Proceedings of the 2011 ACM symposium on applied computing. ACM, pp 1053\u2013 1058","DOI":"10.1145\/1982185.1982415"},{"key":"381_CR15","unstructured":"Kan A, Chan J, Bailey J, Leckie C (2009) A query based approach for mining evolving graphs. In: Proceedings of the Eighth Australasian data mining conference, vol 101. Australian Computer Society, Inc, pp 139\u2013150"},{"key":"381_CR16","doi-asserted-by":"crossref","unstructured":"Kann V (1992) On the approximability of the maximum common subgraph problem. In: Annual symposium on theoretical aspects of computer science. Springer, pp 375\u2013388","DOI":"10.1007\/3-540-55210-3_198"},{"issue":"6","key":"381_CR17","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos V (2009) Temporal graphs. Physica A: Stat. Mech. Appl. 388 (6):1007\u20131023","journal-title":"Physica A: Stat. Mech. Appl."},{"key":"381_CR18","doi-asserted-by":"crossref","unstructured":"Li X, Cheng Y, Cong G, Chen L (2017) Discovering pollution sources and propagation patterns in urban area. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1863\u20131872","DOI":"10.1145\/3097983.3098090"},{"issue":"2","key":"381_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10707-017-0305-2","volume":"22","author":"A Liu","year":"2018","unstructured":"Liu A, Wang W, Shang S, Li Q, Zhang X (2018) Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22 (2):335\u2013362","journal-title":"GeoInformatica"},{"issue":"4","key":"381_CR20","doi-asserted-by":"publisher","first-page":"310","DOI":"10.14778\/2095686.2095690","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2011) Capturing topology in graph pattern matching. Proc VLDB Endow 5(4):310\u2013321","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"381_CR21","first-page":"4","volume":"39","author":"S Ma","year":"2014","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2014) Strong simulation: capturing topology in graph pattern matching. ACM Trans Datab Syst (TODS) 39(1):4","journal-title":"ACM Trans Datab Syst (TODS)"},{"issue":"6","key":"381_CR22","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s12559-018-9600-y","volume":"10","author":"Y Ma","year":"2018","unstructured":"Ma Y, Yuan Y, Wang G, Bi X, Qin H (2018) Trust-aware personalized route query using extreme learning machine in location-based social networks. Cogn Comput 10(6):965\u2013979","journal-title":"Cogn Comput"},{"key":"381_CR23","doi-asserted-by":"crossref","unstructured":"Ma Y, Yuan Y, Wang G, Wang Y, Ma D, Cui P (2019) Local experts finding across multiple social networks. In: International conference on database systems for advanced applications. Springer, pp 536\u2013554","DOI":"10.1007\/978-3-030-18579-4_32"},{"key":"381_CR24","doi-asserted-by":"crossref","unstructured":"Nicosia V, Tang J, Mascolo C, Musolesi M, Russo G, Latora V (2013) Graph metrics for temporal networks. In: Temporal networks. Springer, pp 15\u201340","DOI":"10.1007\/978-3-642-36461-7_2"},{"issue":"1","key":"381_CR25","doi-asserted-by":"publisher","first-page":"016105","DOI":"10.1103\/PhysRevE.84.016105","volume":"84","author":"RK Pan","year":"2011","unstructured":"Pan RK, Saram\u00e4ki J (2011) Path lengths, correlations, and centrality in temporal networks. Phys Rev E 84(1):016105","journal-title":"Phys Rev E"},{"key":"381_CR26","unstructured":"Santoro N, Quattrociocchi W, Flocchini P, Casteigts A, Amblard F (2011) Time-varying graphs and social network analysis: temporal indicators and metrics. arXiv:https:\/\/arxiv.org\/abs\/1102.0629"},{"issue":"7","key":"381_CR27","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1109\/TKDE.2017.2685504","volume":"29","author":"S Shang","year":"2017","unstructured":"Shang S, Chen L, Jensen CS, Wen JR, Kalnis P (2017) Searching trajectories by regions of interest. IEEE Trans Knowl Data Eng 29(7):1549\u20131562","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"381_CR28","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TKDE.2015.2509998","volume":"28","author":"S Shang","year":"2015","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Wen JR, Kalnis P (2015) Collective travel planning in spatial networks. IEEE Trans Knowl Data Eng 28(5):1132\u20131146","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"381_CR29","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.14778\/3137628.3137630","volume":"10","author":"S Shang","year":"2017","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Zheng K, Kalnis P (2017) Trajectory similarity join in spatial networks. Proc VLDB Endow 10(11):1178\u20131189","journal-title":"Proc VLDB Endow"},{"issue":"3","key":"381_CR30","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00778-018-0502-0","volume":"27","author":"S Shang","year":"2018","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Zheng K, Kalnis P (2018) Parallel trajectory similarity joins in spatial networks. Int J Very Large Data Bases 27 (3):395\u2013420","journal-title":"Int J Very Large Data Bases"},{"issue":"6","key":"381_CR31","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1109\/TKDE.2018.2854705","volume":"31","author":"S Shang","year":"2018","unstructured":"Shang S, Chen L, Zheng K, Jensen CS, Wei Z, Kalnis P (2018) Parallel trajectory-to-location join. IEEE Trans Knowl Data Eng 31(6):1194\u20131207","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"381_CR32","doi-asserted-by":"crossref","unstructured":"Shang S, Ding R, Yuan B, Xie K, Zheng K, Kalnis P (2012) User oriented trajectory search for trip recommendation. In: Proceedings of the 15th international conference on extending database technology. ACM, pp 156\u2013167","DOI":"10.1145\/2247596.2247616"},{"issue":"3","key":"381_CR33","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2014","unstructured":"Shang S, Ding R, Zheng K, Jensen CS, Kalnis P, Zhou X (2014) Personalized trajectory matching in spatial networks. Int J Very Large Data Bases 23 (3):449\u2013468","journal-title":"Int J Very Large Data Bases"},{"key":"381_CR34","doi-asserted-by":"crossref","unstructured":"Tang J, Musolesi M, Mascolo C, Latora V (2009) Temporal distance metrics for social network analysis. In: Proceedings of the 2nd ACM workshop on online social networks. ACM, pp 31\u201336","DOI":"10.1145\/1592665.1592674"},{"issue":"1","key":"381_CR35","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"issue":"1","key":"381_CR36","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s41019-019-0090-z","volume":"4","author":"X Wang","year":"2019","unstructured":"Wang X, Chai L, Xu Q, Yang Y, Li J, Wang J, Chai Y (2019) Efficient subgraph matching on large rdf graphs using mapreduce. Data Sci Eng 4(1):24\u201343","journal-title":"Data Sci Eng"},{"key":"381_CR37","doi-asserted-by":"crossref","unstructured":"Whitbeck J, Dias de Amorim M, Conan V, Guillaume JL (2012) Temporal reachability graphs. In: Proceedings of the 18th annual international conference on mobile computing and networking. ACM, pp 377\u2013388","DOI":"10.1145\/2348543.2348589"},{"issue":"4","key":"381_CR38","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1021\/ci00044a012","volume":"24","author":"WT Wipke","year":"1984","unstructured":"Wipke WT, Rogers D (1984) Rapid subgraph search using parallelism. J Chem Inf Comput Sci 24(4):255\u2013262","journal-title":"J Chem Inf Comput Sci"},{"issue":"9","key":"381_CR39","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu H, Cheng J, Huang S, Ke Y, Lu Y, Xu Y (2014) Path problems in temporal graphs. Proc VLDB Endow 7(9):721\u2013732","journal-title":"Proc VLDB Endow"},{"key":"381_CR40","unstructured":"Wu H, Huang Y, Cheng J, Li J, Ke Y (2016) Efficient processing of reachability and time-based path queries in a temporal graph. arXiv:https:\/\/arxiv.org\/abs\/1601.05909"},{"key":"381_CR41","doi-asserted-by":"crossref","unstructured":"Xu Y, Huang J, Liu A, Li Z, Yin H, Zhao L (2017) Time-constrained graph pattern matching in a large temporal graph. In: Asia-Pacific Web (APWeb) and web-age information management (WAIM) joint conference on web and big data. Springer, pp 100\u2013115","DOI":"10.1007\/978-3-319-63579-8_9"},{"issue":"6","key":"381_CR42","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TKDE.2017.2656079","volume":"29","author":"Y Yuan","year":"2017","unstructured":"Yuan Y, Lian X, Chen L, Yu JX, Wang G, Sun Y (2017) Keyword search over distributed graphs with compressed signature. IEEE Trans Knowl Data Eng 29(6):1212\u20131225","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"381_CR43","doi-asserted-by":"crossref","unstructured":"Yue X, Xi M, Chen B, Gao M, He Y, Xu J (2019) A revocable group signatures scheme to provide privacy-preserving authentications. Mobile Networks and Applications","DOI":"10.1007\/s11036-019-01459-5"},{"issue":"1\u20132","key":"381_CR44","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.14778\/1920841.1920988","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang S, Yang J, Jin W (2010) Sapper: subgraph indexing and approximate matching in large graphs. Proc VLDB Endow 3(1\u20132):1185\u20131194","journal-title":"Proc VLDB Endow"},{"key":"381_CR45","doi-asserted-by":"crossref","unstructured":"Zhao K, Chen L, Cong G (2016) Topic exploration in spatio-temporal document collections. In: Proceedings of the 2016 international conference on management of data. ACM, pp 985\u2013998","DOI":"10.1145\/2882903.2882921"},{"issue":"1\u20132","key":"381_CR46","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. Proc VLDB Endow 3(1\u20132):340\u2013351","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"381_CR47","doi-asserted-by":"publisher","first-page":"886","DOI":"10.14778\/1687627.1687727","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu MT (2009) Distance-join: pattern match query in a large graph database. Proc VLDB Endow 2(1):886\u2013897","journal-title":"Proc VLDB Endow"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-019-00381-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-019-00381-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-019-00381-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T00:31:44Z","timestamp":1606609904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-019-00381-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,30]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s10707-019-00381-y","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2019,11,30]]},"assertion":[{"value":"28 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interests"}},{"value":"Informed consent was obtained from all individual participants.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"This article does not contain any studies involving human participants and\/or animals by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and Animal Rights"}}]}}