{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T08:25:03Z","timestamp":1772180703227,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319635781","type":"print"},{"value":"9783319635798","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63579-8_9","type":"book-chapter","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T05:02:42Z","timestamp":1501650162000},"page":"100-115","source":"Crossref","is-referenced-by-count":12,"title":["Time-Constrained Graph Pattern Matching in a Large Temporal Graph"],"prefix":"10.1007","author":[{"given":"Yanxia","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jinjing","family":"Huang","sequence":"additional","affiliation":[]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhixu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hongzhi","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,3]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Wisconsin, pp. 310\u2013321. ACM (2002)","DOI":"10.1145\/564691.564727"},{"issue":"1","key":"9_CR2","doi-asserted-by":"crossref","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. Proc. VLDB Endow. 3(1), 264\u2013275 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","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, M.: SAGA: a subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"issue":"10","key":"9_CR4","doi-asserted-by":"crossref","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":"9_CR5","doi-asserted-by":"crossref","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, Canada, pp. 405\u2013418. ACM (2008)","DOI":"10.1145\/1376616.1376660"},{"issue":"1","key":"9_CR6","doi-asserted-by":"crossref","first-page":"364","DOI":"10.14778\/1453856.1453899","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. Proc. VLDB Endow. 1(1), 364\u2013375 (2008)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"9_CR7","doi-asserted-by":"crossref","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. Proc. VLDB Endow. 3(3), 340\u2013351 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Han, W., Lee, J., Lee, J.H.: Turbo $$_{\\text{iso}}$$ : towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 337\u2013348. ACM, New York (2013)","DOI":"10.1145\/2463676.2465300"},{"issue":"12","key":"9_CR9","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.14778\/2732977.2732983","volume":"7","author":"W Fan","year":"2014","unstructured":"Fan, W., Wang, X., Wu, Y., Deng, D.: Distributed graph simulation: impossibility and possibility. Proc. VLDB Endow. 7(12), 1083\u20131094 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"8","key":"9_CR10","doi-asserted-by":"crossref","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."},{"issue":"3","key":"9_CR11","first-page":"18","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\u2013118 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"9_CR12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.14778\/2735496.2735504","volume":"8","author":"C Song","year":"2014","unstructured":"Song, C., Ge, T., Chen, C.X., Wang, J.: Event pattern matching over graph streams. Proc. VLDB Endow. 8(4), 413\u2013424 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"9_CR13","unstructured":"Khurana, U., Deshpande, A.: Storing and analyzing historical graph data at scale. In: Proceedings of the 19th International Conference on Extending Database Technology, France, pp. 65\u201376 (2016)"},{"issue":"13","key":"9_CR14","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.14778\/2536258.2536263","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. Proc. VLDB Endow. 6(13), 1510\u20131521 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"9_CR15","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J Allen","year":"1983","unstructured":"Allen, J., Allen, J.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832\u2013843 (1983)","journal-title":"Commun. ACM"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Jin, R., McCallen, S., Liu, C., Xiang, Y., Almaas, E., Zhou, X.J.: Identifying dynamic network modules with temporal and spatial constraints. In: Proceedings of the Pacific Symposium, USA, pp. 203\u2013214 (2009)","DOI":"10.1142\/9789812836939_0020"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R Shamir","year":"1999","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. J. Algorithms 33, 267\u2013280 (1999)","journal-title":"J. Algorithms"},{"key":"9_CR18","doi-asserted-by":"crossref","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, pp. 419\u2013430 (2015)","DOI":"10.1145\/2723372.2723717"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yan, D., Wu, H., Cheng, J., Zhou, S., Lui, J.C.S.: Diversified temporal subgraph pattern mining. In: Proceedings of the 22nd International Conference on Knowledge Discovery and Data Mining, San Francisco, pp. 1965\u20131974 (2016)","DOI":"10.1145\/2939672.2939848"},{"key":"9_CR20","doi-asserted-by":"crossref","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, Helsinki, pp. 145\u2013156 (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"issue":"9","key":"9_CR21","doi-asserted-by":"crossref","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.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Kossinets, G., Kleinberg, J.M., Watts, D.J.: The structure of information pathways in a social communication network. In: Proceedings of the 14th International Conference on Knowledge Discovery and Data Mining, Las Vegas, pp. 435\u2013443 (2008)","DOI":"10.1145\/1401890.1401945"},{"issue":"2","key":"9_CR23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W., Kasperovics, R., Lee, J.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc. VLDB Endow. 6(2), 133\u2013144 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"9_CR24","doi-asserted-by":"crossref","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, pp. 453\u2013462 (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"issue":"1","key":"9_CR25","first-page":"4","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. Trans. Database Syst. 39(1), 4 (2014)","journal-title":"Trans. Database Syst."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Yuan, D., Mitra, P., Yu, H., Giles, C.L.: Iterative graph feature mining for graph indexing. In: 28th International Conference on Data Engineering, USA, pp. 198\u2013209 (2012)","DOI":"10.1109\/ICDE.2012.11"},{"key":"9_CR27","unstructured":"Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D., Gu, X.: Towards graph containment search and indexing. In: Proceedings of the 33rd International Conference on Very Large Data Bases, Austria, pp. 926\u2013937 (2007)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Yuan, D., Mitra, P., Yu, H., Giles, C.L.: Updating graph indices with a one-pass algorithm. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, pp. 1903\u20131916 (2015)","DOI":"10.1145\/2723372.2746482"},{"issue":"12","key":"9_CR29","doi-asserted-by":"crossref","first-page":"3318","DOI":"10.1109\/TKDE.2015.2454515","volume":"27","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Peng, W., Lee, S.: 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."},{"key":"9_CR30","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."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63579-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:55:43Z","timestamp":1750794943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63579-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319635781","9783319635798"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63579-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}