{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:42:22Z","timestamp":1767984142989,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T00:00:00Z","timestamp":1449619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of the Hong Kong SAR","award":["418512"],"award-info":[{"award-number":["418512"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572040"],"award-info":[{"award-number":["61572040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00778-015-0416-z","type":"journal-article","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T11:34:10Z","timestamp":1449660850000},"page":"269-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Toward continuous pattern detection over evolving large graph with snapshot isolation"],"prefix":"10.1007","volume":"25","author":[{"given":"Jun","family":"Gao","sequence":"first","affiliation":[]},{"given":"Chang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"416_CR1","unstructured":"Apache Giraph. http:\/\/incubator.apache.org\/giraph\/"},{"key":"416_CR2","doi-asserted-by":"crossref","unstructured":"Blanas, S., Patel, J.M., Ercegovac, V., Rao, J., Shekita, E.J., Tian, Y.: A comparison of join algorithms for log processing in mapreduce. In: SIGMOD, pp. 975\u2013986 (2010)","DOI":"10.1145\/1807167.1807273"},{"issue":"2","key":"416_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/1480506.1480511","volume":"42","author":"P Boldi","year":"2008","unstructured":"Boldi, P., Santini, M., Vigna, S.: A large time-aware graph. SIGIR Forum 42(2), 33\u201338 (2008)","journal-title":"SIGIR Forum"},{"key":"416_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00f6cheler, M., Pugliese, A., Subrahmanian, V.S.: Cosi: cloud oriented subgraph identification in massive social networks. In: ASONAM, pp. 248\u2013255 (2010)","DOI":"10.1109\/ASONAM.2010.80"},{"key":"416_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, R., Hong, J., Kyrola, A., Miao, Y., Weng, X., Wu, M., Yang, F., Zhou, L., Zhao, F., Chen, E.: Kineograph: taking the pulse of a fast-changing and connected world. In: EuroSys, pp. 85\u201398 (2012)","DOI":"10.1145\/2168836.2168846"},{"key":"416_CR6","unstructured":"Choudhury, S., Holder, L.B., Chin, G. Jr., Agarwal, K., Feo, J.: A selectivity based approach to continuous pattern detection in streaming graphs. In: EDBT, pp. 157\u2013168 (2015)"},{"key":"416_CR7","unstructured":"Diao, Y., Fischer, P.M., Franklin, M.J., To, R.: Yfilter: efficient and scalable filtering of xml documents. In: ICDE, pp. 341\u2013342 (2002)"},{"key":"416_CR8","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Luo, J., Tan, Z., Wang, X., Wu, Y.: Incremental graph pattern matching. In: SIGMOD, pp. 925\u2013936 (2011)","DOI":"10.1145\/1989323.1989420"},{"issue":"1","key":"416_CR9","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 matching: from intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"key":"416_CR10","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhou, C., Zhou, J., Yu, J.X.: Continuous pattern detection over billion-edge graph using distributed framework. In: ICDE, pp. 556\u2013567 (2014)","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"416_CR11","doi-asserted-by":"crossref","unstructured":"Green, T.J., Miklau, G., Onizuka, M., Suciu, D.: Processing xml streams with deterministic automata. In: ICDT, pp. 173\u2013189 (2003)","DOI":"10.1007\/3-540-36285-1_12"},{"issue":"12","key":"416_CR12","first-page":"1047","volume":"7","author":"M Han","year":"2014","unstructured":"Han, M., Daudjee, K., Khaled Ammar, M., \u00d6zsu, T., Wang, X., Jin, T.: An experimental comparison of pregel-like graph processing systems. PVLDB 7(12), 1047\u20131058 (2014)","journal-title":"PVLDB"},{"key":"416_CR13","doi-asserted-by":"crossref","unstructured":"Khan, A., Li, N., Yan, X., Guan, Z., Chakraborty, S., Tao, S.: Neighborhood based fast graph search in large networks. In: SIGMOD, pp. 901\u2013912 (2011)","DOI":"10.1145\/1989323.1989418"},{"key":"416_CR14","doi-asserted-by":"crossref","unstructured":"Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data. In: ICDE, pp. 997\u20131008 (2013)","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"416_CR15","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.B.: What is Twitter, a social network or a news media? In: WWW, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"issue":"2","key":"416_CR16","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133\u2013144 (2012)","journal-title":"PVLDB"},{"issue":"8","key":"416_CR17","first-page":"716","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning in the cloud. PVLDB 5(8), 716\u2013727 (2012)","journal-title":"PVLDB"},{"key":"416_CR18","doi-asserted-by":"crossref","unstructured":"Ma, S., Cao, Y., Huai, J., Wo, T.: Distributed graph pattern matching. In: WWW, pp. 949\u2013958 (2012)","DOI":"10.1145\/2187836.2187963"},{"key":"416_CR19","doi-asserted-by":"crossref","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: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"416_CR20","doi-asserted-by":"crossref","unstructured":"McCune, R.R., Weninger, T., Madey, G.R.: Thinking like a vertex: a survey of vertex-centric frameworks for distributed graph processing. CoRR, abs\/1507.04405 (2015)","DOI":"10.1145\/2818185"},{"key":"416_CR21","doi-asserted-by":"crossref","unstructured":"Mondal., J., Deshpande, A.: Managing large dynamic graphs efficiently. In: SIGMOD, pp. 145\u2013156 (2012)","DOI":"10.1145\/2213836.2213854"},{"key":"416_CR22","doi-asserted-by":"crossref","unstructured":"Pugliese, A., Br\u00f6cheler, M., Subrahmanian, V.S., Ovelg\u00f6nne, M.: Efficient multiview maintenance under insertion in huge social networks. TWEB 8(2), 10 (2014)","DOI":"10.1145\/2541290"},{"issue":"7","key":"416_CR23","first-page":"577","volume":"7","author":"S Salihoglu","year":"2014","unstructured":"Salihoglu, S., Widom, J.: Optimizing graph algorithms on pregel-like systems. PVLDB 7(7), 577\u2013588 (2014)","journal-title":"PVLDB"},{"issue":"1","key":"416_CR24","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":"416_CR25","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Xiao, Y.: Trinity: a distributed graph engine on a memory cloud. In: SIGMOD, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"issue":"9","key":"416_CR26","first-page":"788","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. PVLDB 5(9), 788\u2013799 (2012)","journal-title":"PVLDB"},{"issue":"3","key":"416_CR27","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From think like a vertex to think like a graph. PVLDB 7(3), 193\u2013204 (2013)","journal-title":"PVLDB"},{"key":"416_CR28","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.M.: Tale: a tool for approximate large graph matching. In: ICDE, pp. 963\u2013972 (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"416_CR29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23, 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"416_CR30","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen, L.: Continuous subgraph pattern search over graph streams. In: ICDE, pp. 393\u2013404 (2009)","DOI":"10.1109\/ICDE.2009.132"},{"key":"416_CR31","doi-asserted-by":"crossref","unstructured":"Wang, X., Ding, X., Tung, A.K.H., Ying, S., Jin, H.: An efficient graph indexing method. In: ICDE, pp. 210\u2013221 (2012)","DOI":"10.1109\/ICDE.2012.28"},{"key":"416_CR32","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"1","key":"416_CR33","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":"4","key":"416_CR34","first-page":"377","volume":"8","author":"C Zhou","year":"2014","unstructured":"Zhou, C., Gao, J., Sun, B., Yu, J.X.: Mocgraph: scalable distributed graph processing using message online computing. PVLDB 8(4), 377\u2013388 (2014)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0416-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0416-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0416-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T04:48:50Z","timestamp":1567399730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0416-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,9]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0416-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,9]]}}}