{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:12:21Z","timestamp":1775913141866,"version":"3.50.1"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572335"],"award-info":[{"award-number":["61572335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Program of Natural Science Foundation, Educational Commission of Jiangsu Province, China","award":["19KJA610002"],"award-info":[{"award-number":["19KJA610002"]}]},{"name":"Natural Science Foundation, Educational Commission of Jiangsu Province, China","award":["19KJB520052"],"award-info":[{"award-number":["19KJB520052"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s11280-020-00784-0","type":"journal-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T02:02:47Z","timestamp":1580695367000},"page":"519-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SGPM: a privacy protected approach of time-constrained graph pattern matching in cloud"],"prefix":"10.1007","volume":"23","author":[{"given":"Jinjing","family":"Huang","sequence":"first","affiliation":[]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhixu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Pengpeng","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Weiqing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hongzhi","family":"Yin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5123-9279","authenticated-orcid":false,"given":"Lei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"issue":"11","key":"784_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"JF Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832\u2013843 (1983)","journal-title":"Commun. ACM"},{"key":"784_CR2","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., O\u2019neill, A.: Order-preserving symmetric encryption. In: Advances in Cryptology-EUROCRYPT 2009, pp 224\u2013241. Springer (2009)","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"784_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.J.: Private database queries using somewhat homomorphic encryption. In: Applied Cryptography and Network Security, pp 102\u2013118. Springer (2013)","DOI":"10.1007\/978-3-642-38980-1_7"},{"key":"784_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-lwe and security for key dependent messages. In: Advances in Cryptology\u2013CRYPTO 2011, pp 505\u2013524. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_29"},{"issue":"2","key":"784_CR5","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) lwe. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"784_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"784_CR7","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, USA, June 3-6, 2002, pages 310\u2013321 (2002)"},{"key":"784_CR8","doi-asserted-by":"crossref","unstructured":"Bugiel, S., N\u00fcrnberger, S., Sadeghi, A.-R., Schneider, T.: Twin clouds: Secure cloud computing with low latency. In: Communications and Multimedia Security, pp 32\u201344. Springer (2011)","DOI":"10.1007\/978-3-642-24712-5_3"},{"key":"784_CR9","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Applied Cryptography and Network Security, pp 442\u2013455. Springer (2005)","DOI":"10.1007\/11496137_30"},{"issue":"8","key":"784_CR10","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1109\/TKDE.2010.67","volume":"22","author":"L Chen","year":"2010","unstructured":"Chen, L., Wang, C.: Continuous subgraph pattern search over certain and uncertain graph streams. IEEE Trans. Knowl. Data Eng. 22(8), 1093\u20131109 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"784_CR11","unstructured":"Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.-Q., Gu, X.: Towards graph containment search and indexing. In: Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, September 23-27, 2007, pp. 926\u2013937 (2007)"},{"issue":"12","key":"784_CR12","doi-asserted-by":"publisher","first-page":"3318","DOI":"10.1109\/TKDE.2015.2454515","volume":"27","author":"Y-C Chen","year":"2015","unstructured":"Chen, Y.-C., Peng, W.-C., Lee, S.-Y.: Mining temporal patterns in time interval-based data. IEEE Trans. Knowl. Data Eng. 27(12), 3318\u20133331 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"784_CR13","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"784_CR14","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Advances in Cryptology\u2013CRYPTO 2011, pp 487\u2013504. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"784_CR15","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Advances in Cryptology\u2013EUROCRYPT 2012, pp 446\u2013464. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_27"},{"issue":"1","key":"784_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.14778\/2732219.2732223","volume":"7","author":"S Das","year":"2013","unstructured":"Das, S., Narasayya, V.R., Li, F., Syamala, M.: Cpu sharing techniques for performance isolation in multi-tenant relational database-as-a-service. Proceedings of the VLDB Endowment 7(1), 37\u201348 (2013)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"784_CR17","doi-asserted-by":"crossref","unstructured":"ElGamal, T.: A Public key cryptosystem and a signature scheme based on discrete logarithms. In: Advances in Cryptology, pp 10\u201318. Springer (1984)","DOI":"10.1007\/3-540-39568-7_2"},{"key":"784_CR18","doi-asserted-by":"crossref","unstructured":"Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: 2014 IEEE 30th International Conference On Data Engineering (ICDE), pp 664\u2013675. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"784_CR19","doi-asserted-by":"crossref","unstructured":"Elmore, A. J, Das, S., Agrawal, D., Abbadi, A. E.: Zephyr: live migration in shared nothing databases for elastic cloud platforms. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp 301\u2013312. ACM (2011)","DOI":"10.1145\/1989323.1989356"},{"issue":"1","key":"784_CR20","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern from intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"issue":"13","key":"784_CR21","first-page":"1510","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6(13), 1510\u20131521 (2013)","journal-title":"PVLDB"},{"issue":"3","key":"784_CR22","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2508020.2489791","volume":"38","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Incremental graph pattern matching. ACM Trans. Database Syst. 38(3), 18:1\u201318:47 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"12","key":"784_CR23","first-page":"1083","volume":"7","author":"W Fan","year":"2014","unstructured":"Fan, W., Wang, X., Wu, Y., Deng, D.: Distributed graph simulation: Impossibility and possibility. PVLDB 7(12), 1083\u20131094 (2014)","journal-title":"PVLDB"},{"key":"784_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"784_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., et al.: Fully homomorphic encryption using ideal lattices. In: STOC, vol. 9, pp 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"784_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: Advances in Cryptology\u2013EUROCRYPT 2011, pp 129\u2013148. Springer (2011)","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"784_CR27","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Advances in Cryptology\u2013EUROCRYPT 2012, pp 465\u2013482. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"784_CR28","volume-title":"Foundations of Cryptography: volume 2, Basic Applications","author":"O Goldreich","year":"2009","unstructured":"Goldreich, O.: Foundations of Cryptography: volume 2, Basic Applications. Cambridge University Press, Cambridge (2009)"},{"key":"784_CR29","doi-asserted-by":"crossref","unstructured":"Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Applied Cryptography and Network Security, pp 31\u201345. Springer (2004)","DOI":"10.1007\/978-3-540-24852-1_3"},{"key":"784_CR30","unstructured":"Hacig\u00fcm\u00fcs, H., Iyer, B., Mehrotra, S.: Providing database as a service. In: 18th International Conference On Data Engineering, 2002. Proceedings, pp 29\u201338. IEEE (2002)"},{"key":"784_CR31","doi-asserted-by":"crossref","unstructured":"Hacig\u00fcm\u00fc\u015f, H., Iyer, B., Li, C., Mehrotra, S.: Executing sql over encrypted data in the database-service-provider model. In: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp 216\u2013227. ACM (2002)","DOI":"10.1145\/564691.564717"},{"key":"784_CR32","doi-asserted-by":"crossref","unstructured":"Hac\u0131g\u00fcm\u00fc\u015f, H., Iyer, B., Mehrotra, S.: Secure computation on outsourced data: A 10-year retrospective. In: Database Systems for Advanced Applications, pp 16\u201327. Springer (2014)","DOI":"10.1007\/978-3-319-05810-8_2"},{"key":"784_CR33","unstructured":"Han, W.-S., Lee, J., Lee, J.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2013, New York, NY, USA, June 22-27, 2013, pp. 337\u2013348 (2013)"},{"key":"784_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols: Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions. Springer Science & Business Media, Berlin (2010)"},{"key":"784_CR35","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pages 405\u2013418 (2008)"},{"key":"784_CR36","unstructured":"Henzinger, M.R., Henzinger, T.A. , Kopke, P.W. : Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 453\u2013462 (1995)"},{"key":"784_CR37","unstructured":"Huang, S., Fu, A.W., Liu, R.: Minimum spanning trees in temporal graphs. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp 419\u2013430x (2015)"},{"key":"784_CR38","unstructured":"Khurana, U., Deshpande, A.: Storing and analyzing historical graph data at scale. In: Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016., pp. 65\u201376 (2016)"},{"key":"784_CR39","unstructured":"Kossinets, G., Kleinberg, J.M., Watts, D.J.: The structure of information pathways in a social communication network. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp 435\u2013443 (2008)"},{"issue":"2","key":"784_CR40","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133\u2013144 (2012)","journal-title":"PVLDB"},{"key":"784_CR41","unstructured":"Liu, G., Wang, Y., Orgun, M.A.: Finding K optimal social trust paths for the selection of trustworthy service providers in complex social networks. In: IEEE International Conference on Web Services, ICWS 2011, Washington, DC, USA, July 4-9, 2011, pp. 41\u201348 (2011)"},{"key":"784_CR42","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.neucom.2015.11.129","volume":"210","author":"G Liu","year":"2016","unstructured":"Liu, G., Zhu, F., Zheng, K., Liu, A., Li, Z., Zhao, L., Zhou, X.: TOSI A trust-oriented social influence evaluation method in contextual social networks. Neurocomputing 210, 130\u2013140 (2016)","journal-title":"Neurocomputing"},{"issue":"5","key":"784_CR43","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s11390-017-1772-5","volume":"32","author":"A Liu","year":"2017","unstructured":"Liu, A., Li, Z., Liu, G., Zheng, K., Zhang, M., Li, Q., Zhang, X.: Privacy-preserving task assignment in spatial crowdsourcing. J. Comput. Sci Technol. 32(5), 905\u2013918 (2017)","journal-title":"J. Comput. Sci Technol."},{"issue":"2","key":"784_CR44","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.: Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22 (2), 335\u2013362 (2018)","journal-title":"GeoInformatica"},{"issue":"6","key":"784_CR45","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/TKDE.2017.2785824","volume":"30","author":"G Liu","year":"2018","unstructured":"Liu, G., Yi, L., Zheng, K., Liu, A., Li, Z., Wang, Y., Zhou, X.: MCS-GPM: Multi-constrained simulation based graph pattern matching in contextual social graphs. IEEE Trans. Knowl. Data Eng. 30(6), 1050\u20131064 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"784_CR46","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2528937","volume":"39","author":"S Ma","year":"2014","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: Capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 4:1-4:46 (2014)","journal-title":"ACM Trans. Database Syst."},{"key":"784_CR47","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical?. In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"784_CR48","doi-asserted-by":"crossref","unstructured":"Ogura, N., Yamamoto, G., Kobayashi, T., Uchiyama, S.: An improvement of key generation algorithm for Gentry\u2019s homomorphic encryption scheme. In: Advances in Information and Computer Security, pp 70\u201383. Springer (2010)","DOI":"10.1007\/978-3-642-16825-3_6"},{"key":"784_CR49","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology-EUROCRYPT\u201999, pp 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"784_CR50","doi-asserted-by":"crossref","unstructured":"Popa, R. A., Redfield, C., Zeldovich, N., Balakrishnan, H.: Cryptdb: protecting confidentiality with encrypted query processing. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pp 85\u2013100. ACM (2011)","DOI":"10.1145\/2043556.2043566"},{"issue":"11","key":"784_CR51","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Foundations of secure computation 4(11), 169\u2013180 (1978)","journal-title":"Foundations of secure computation"},{"key":"784_CR52","doi-asserted-by":"crossref","unstructured":"Scholl, P., Smart, N.P.: Improved key generation for gentry\u2019s fully homomorphic encryption scheme. In: Cryptography and coding, pp 10\u201322. Springer (2011)","DOI":"10.1007\/978-3-642-25516-8_2"},{"issue":"2","key":"784_CR53","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R Shamir","year":"1999","unstructured":"Shamir, R., Tsur, D.: Faster isomorphism. J. Algorithms 33(2), 267\u2013280 (1999)","journal-title":"J. Algorithms"},{"issue":"1","key":"784_CR54","first-page":"364","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J. X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364\u2013375 (2008)","journal-title":"PVLDB"},{"key":"784_CR55","unstructured":"Song, D. X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 EEE Symposium on security and privacy, 2000. S&P 2000 Proceedings. pp. 44\u201355. IEEE (2000)"},{"issue":"4","key":"784_CR56","first-page":"413","volume":"8","author":"C Song","year":"2014","unstructured":"Song, C., Ge, T., Chen, C.X., Wang, J.: Event pattern matching over graph streams. PVLDB 8(4), 413\u2013424 (2014)","journal-title":"PVLDB"},{"issue":"1","key":"784_CR57","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1670243.1670250","volume":"35","author":"AA Soror","year":"2010","unstructured":"Soror, A.A., Minhas, U.F., Aboulnaga, A., Salem, K., Kokosielis, P., Kamath, S.: Automatic virtual machine configuration for database workloads. ACM Transactions on Database Systems (TODS) 35(1), 7 (2010)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"2","key":"784_CR58","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2007","unstructured":"Tian, Y., McEachin, R.C., Santos, C., States, D.J., Patel, J.M.: SAGA: A subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"key":"784_CR59","doi-asserted-by":"crossref","unstructured":"Tu, S., Frans Kaashoek, M, Madden, S., Zeldovich, N.: Processing analytical queries over encrypted data. In: Proceedings of the VLDB Endowment, pp 289\u2013300. VLDB Endowment (2013)","DOI":"10.14778\/2535573.2488336"},{"key":"784_CR60","doi-asserted-by":"crossref","unstructured":"Van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Advances in Cryptology\u2013EUROCRYPT 2010, pp 24\u201343. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"784_CR61","doi-asserted-by":"crossref","unstructured":"Wong, P., He, Z., Lo, E.: Parallel analytics as a service. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 25\u201336. ACM (2013)","DOI":"10.1145\/2463676.2463714"},{"key":"784_CR62","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Kao, B., Cheung, D.W.L., Li, R., Yiu, S.M.: Secure query processing with data interoperability in a cloud database environment. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp 1395\u20131406. ACM (2014)","DOI":"10.1145\/2588555.2588572"},{"issue":"9","key":"784_CR63","first-page":"721","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. PVLDB 7(9), 721\u2013732 (2014)","journal-title":"PVLDB"},{"key":"784_CR64","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, pp 145\u2013156 (2016)"},{"key":"784_CR65","unstructured":"Xiao, M., Ma, K., Liu, A., Zhao, H., Li, Z., Zheng, K., Zhou, X.: Sra: Secure reverse auction for task assignment in spatial crowdsourcing. IEEE Trans. Knowl. Data Eng., pp. 1\u20131 (2019)"},{"key":"784_CR66","doi-asserted-by":"crossref","unstructured":"Xu, Y., Huang, J., An, L., Li, Z., Yin, H., Zhao, L.: Time-constrained graph pattern matching in a large temporal graph. Web and Big Data - First International Joint Conference, APWeb-WAIM 2017, Beijing, China, July 7-9, 2017, Proceedings, Part I, pp. 100\u2013115 (2017)","DOI":"10.1007\/978-3-319-63579-8_9"},{"key":"784_CR67","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, 1982. SFCS\u201908, pp 160\u2013164. IEEE (1982)"},{"key":"784_CR68","unstructured":"Yi, Y., Da, Y., Wu, H., Cheng, J., Zhou, S., Lui, J.C.S.: Diversified temporal subgraph pattern mining. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016, pp 1965\u20131974 (2016)"},{"key":"784_CR69","unstructured":"Yuan, D., Mitra, P., Yu, H., Lee Giles, C.: Iterative graph feature mining for graph indexing. In: IEEE 28Th International Conference on Data Engineering (ICDE 2012), Washington, DC, USA (Arlington, Virginia), 1-5 April, 2012, pp. 198\u2013209 (2012)"},{"key":"784_CR70","unstructured":"Yuan, D., Mitra, P., Yu, H., Lee Giles, C.: Updating graph indices with a one-pass algorithm. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 1903\u20131916 (2015)"},{"issue":"5","key":"784_CR71","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1007\/s11280-018-0638-2","volume":"22","author":"D Zhai","year":"2019","unstructured":"Zhai, D., Sun, Y., Liu, A., Li, Z., Liu, G., Zhao, L., Zheng, K.: Towards secure and truthful task assignment in spatial crowdsourcing. World Wide Web 22(5), 2017\u20132040 (2019)","journal-title":"World Wide Web"},{"issue":"1","key":"784_CR72","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. PVLDB 3 (1), 340\u2013351 (2010)","journal-title":"PVLDB"},{"issue":"1","key":"784_CR73","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s11280-016-0400-6","volume":"20","author":"J Zhu","year":"2017","unstructured":"Zhu, J., Jiang, W., Liu, A., Liu, G., Zhao, L.: Effective and efficient trajectory outlier detection based on time-dependent popular route. World Wide Web 20(1), 111\u2013134 (2017)","journal-title":"World Wide Web"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00784-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-020-00784-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00784-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T00:32:43Z","timestamp":1612225963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-020-00784-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["784"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00784-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"29 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}