{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:29Z","timestamp":1760597789239},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T00:00:00Z","timestamp":1537228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11704-016-5522-6","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T10:47:58Z","timestamp":1510224478000},"page":"966-983","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using partial evaluation in holistic subgraph search"],"prefix":"10.1007","volume":"12","author":[{"given":"Peng","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenqin","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongyan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,18]]},"reference":[{"key":"5522_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/1516360.1516384","volume-title":"Proceedings of the 12th International Conference on Extending Database Technology.","author":"S J Zhang","year":"2009","unstructured":"Zhang S J, Li S R, Yang J. GADDI: distance index based subgraph matching in biological networks. In: Proceedings of the 12th International Conference on Extending Database Technology. 2009, 192\u2013203"},{"issue":"5571","key":"5522_CR2","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1126\/science.1070120","volume":"296","author":"D J Watts","year":"2002","unstructured":"Watts D J, Dodds P S, Newman M E J. Identity and search in social networks. Science, 2002, 296(5571): 1302\u20131305","journal-title":"Science"},{"key":"5522_CR3","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1145\/1367497.1367578","volume-title":"Proceedings of the 17th International Conference on World Wide Web.","author":"M Stocker","year":"2008","unstructured":"Stocker M, Seaborne A, Bernstein A, Kiefer C, Reynolds D. SPARQL basic graph pattern optimization using selectivity estimation. In: Proceedings of the 17th International Conference on World Wide Web. 2008, 595\u2013604"},{"issue":"5","key":"5522_CR4","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U. Reachability and distance queries via 2-hop labels. SIAM Journal on Computing, 2003, 32(5): 1338\u20131355","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5522_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-005-0177-1","volume":"16","author":"E P F Chan","year":"2007","unstructured":"Chan E P F, Lim H. Optimization and evaluation of shortest path queries. The VLDB Journal, 2007, 16(3): 343\u2013369","journal-title":"The VLDB Journal"},{"issue":"3","key":"5522_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N Jing","year":"1998","unstructured":"Jing N, Huang Y W, Rundensteiner E A. Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Transactions on Knowledge and Data Engineering, 1998, 10(3): 409\u2013432","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5522_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/1516360.1516417","volume-title":"Proceedings of the 12th International Conference on Extending Database Technology.","author":"J F Cheng","year":"2009","unstructured":"Cheng J F, Yu J X. On-line exact shortest distance query processing. In: Proceedings of the 12th International Conference on Extending Database Technology. 2009, 481\u2013492"},{"key":"5522_CR8","first-page":"75","volume-title":"Proceedings of the 22nd International Conference on Data Engineering","author":"H X Wang","year":"2006","unstructured":"Wang H X, He H, Yang J, Yu P S, Yu J X. Dual labeling: answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering. 2006, 75"},{"key":"5522_CR9","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/1247480.1247573","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.","author":"S Tri\u00dfl","year":"2007","unstructured":"Tri\u00dfl S, Leser U. Fast and practical indexing and querying of very large graphs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007, 845\u2013856"},{"key":"5522_CR10","first-page":"893","volume-title":"Proceedings of the 24th International Conference on Data Engineering.","author":"Y J Chen","year":"2008","unstructured":"Chen Y J, Chen Y B. An efficient algorithm for answering graph reachability queries. In: Proceedings of the 24th International Conference on Data Engineering. 2008, 893\u2013902"},{"key":"5522_CR11","first-page":"39","volume-title":"Proceedings of the 21st ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems.","author":"D Shasha","year":"2002","unstructured":"Shasha D, Wang J T L, Giugno R. Algorithmics and applications of tree and graph searching. In: Proceedings of the 21st ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems. 2002, 39\u201352"},{"key":"5522_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/1007568.1007607","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.","author":"X F Yan","year":"2004","unstructured":"Yan X F, Yu P S, Han J W. Graph indexing: a frequent structure-based approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2004, 335\u2013346"},{"key":"5522_CR13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/1376616.1376660","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.","author":"H H He","year":"2008","unstructured":"He H 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. 2008, 405\u2013418"},{"key":"5522_CR14","first-page":"966","volume-title":"Proceedings of the 23rd International Conference on Data Engineering.","author":"S J Zhang","year":"2007","unstructured":"Zhang S J, Hu M, Yang J. Tree Pi: a novel graph indexing method. In: Proceedings of the 23rd International Conference on Data Engineering. 2007, 966\u2013975"},{"key":"5522_CR15","first-page":"938","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases.","author":"P X Zhao","year":"2007","unstructured":"Zhao P X, Yu J X, Yu P S. Graph indexing: tree + delta >= graph. In: Proceedings of the 33rd International Conference on Very Large Data Bases. 2007, 938\u2013949"},{"key":"5522_CR16","first-page":"38","volume-title":"Proceedings of the 22nd International Conference on Data Engineering.","author":"H H He","year":"2006","unstructured":"He H H, Singh A K. Closure-tree: an index structure for graph queries. In: Proceedings of the 22nd International Conference on Data Engineering. 2006, 38"},{"key":"5522_CR17","first-page":"963","volume-title":"Proceedings of the 24th International Conference on Data Engineering.","author":"Y Y Tian","year":"2008","unstructured":"Tian Y Y, Patel J M. TALE: a tool for approximate large graph matching. In: Proceedings of the 24th International Conference on Data Engineering. 2008, 963\u2013972"},{"issue":"1-2","key":"5522_CR18","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P X Zhao","year":"2010","unstructured":"Zhao P X, Han J W. On graph query optimization in large networks. Proceedings of the VLDB Endowment, 2010, 3(1-2): 340\u2013351","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5522_CR19","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-22351-8_19","volume-title":"Proceedings of the 23rd International Conference on Scientific and Statistical Database Management.","author":"P Peng","year":"2011","unstructured":"Peng P, Zou L, Chen L, Lin X M, Zhao D Y. Subgraph search over massive disk resident graphs. In: Proceedings of the 23rd International Conference on Scientific and Statistical Database Management. 2011, 312\u2013321"},{"key":"5522_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/2396761.2396806","volume-title":"Proceedings of the 21st ACM International Conference on Information and Knowledge Management.","author":"S Sakr","year":"2012","unstructured":"Sakr S, Elnikety S, He Y X. G-SPARQL: a hybrid engine for querying large attributed graphs. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management. 2012, 335\u2013344"},{"issue":"9","key":"5522_CR21","doi-asserted-by":"publisher","first-page":"788","DOI":"10.14778\/2311906.2311907","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun Z, Wang H Z, Wang H X, Shao B, Li J Z. Efficient subgraph matching on billion node graphs. Proceedings of the VLDB Endowment, 2012, 5(9): 788\u2013799","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5522_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/2463676.2465300","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.","author":"W S Han","year":"2013","unstructured":"Han W S, Lee J, Lee J H. Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2013, 337\u2013348"},{"key":"5522_CR23","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-12026-8_13","volume-title":"Proceedings of the 15th International Conference on Database Systems for Advanced Applications.","author":"K Zhu","year":"2010","unstructured":"Zhu K, Zhang Y, Lin X M, Zhu G P, Wang W. NOVA: a novel and efficient framework for finding subgraph isomorphism mappings in large graphs. In: Proceedings of the 15th International Conference on Database Systems for Advanced Applications. 2010, 140\u2013154"},{"issue":"1","key":"5522_CR24","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 M T. Distance Join: pattern match query in a large graph database. Proceedings of the VLDB Endowment, 2009, 2(1): 886\u2013897","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5522_CR25","first-page":"1033","volume-title":"Proceedings of IEEE International Conference on Data Engineering.","author":"J X Yu","year":"2013","unstructured":"Yu J X, Zeng X G, Cheng J F. Top-k graph pattern matching over large graphs. In: Proceedings of IEEE International Conference on Data Engineering. 2013, 1033\u20131044"},{"key":"5522_CR26","first-page":"310","volume-title":"Proceedings of ACM SIGMOD International Conference on Management of Data.","author":"N Bruno","year":"2002","unstructured":"Bruno N, Koudas N, Srivastava D. Holistic twig joins: optimal XML pattern matching. In: Proceedings of ACM SIGMOD International Conference on Management of Data. 2002, 310\u2013321"},{"key":"5522_CR27","first-page":"273","volume-title":"Proceedings of the 29th International Conference on Very Large Data Bases.","author":"H F Jiang","year":"2003","unstructured":"Jiang H F, Wang W, Lu H J, Yu J X. Holistic twig joins on indexed XML documents. In: Proceedings of the 29th International Conference on Very Large Data Bases. 2003, 273\u2013284"},{"key":"5522_CR28","first-page":"29","volume-title":"Proceedings of ACM\/IEEE Conference on Supercomputing","author":"G Karypis","year":"1995","unstructured":"Karypis G, Kumar V. Analysis of multilevel graph partitioning. In: Proceedings of ACM\/IEEE Conference on Supercomputing. 1995, 29"},{"key":"5522_CR29","first-page":"568","volume-title":"Proceedings of the 30th International Conference on Data Engineering.","author":"L Wang","year":"2014","unstructured":"Wang L, Xiao Y H, Shao B, Wang H X. How to partition a billion-node graph. In: Proceedings of the 30th International Conference on Data Engineering. 2014, 568\u2013579"},{"key":"5522_CR30","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1145\/2063576.2063834","volume-title":"Proceedings of the 20th ACM Conference on Information and Knowledge Management.","author":"K Tretyakov","year":"2011","unstructured":"Tretyakov K, Armas-Cervantes A, Garc\u00eda-Banuelos L, Vilo J, Dumas M. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: Proceedings of the 20th ACM Conference on Information and Knowledge Management. 2011, 1785\u20131794"},{"key":"5522_CR31","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.artint.2012.06.001","volume":"194","author":"J Hoffart","year":"2013","unstructured":"Hoffart J, Suchanek F M, Berberich K, Weikum G. YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia. Artificial Intelligence, 2013, 194: 28\u201361","journal-title":"Artificial Intelligence"},{"issue":"11","key":"5522_CR32","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.14778\/2809974.2809985","volume":"8","author":"J Kim","year":"2015","unstructured":"Kim J, Shin H, Han W S, Hong S, Chafi H. Taming subgraph isomorphism for RDF query processing. Proceedings of the VLDB Endowment, 2015, 8(11): 1238\u20131249","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"5522_CR33","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J R Ullmann","year":"1976","unstructured":"Ullmann J R. An algorithm for subgraph isomorphism. Journal of the ACM, 1976, 23(1): 31\u201342","journal-title":"Journal of the ACM"},{"issue":"10","key":"5522_CR34","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L P Cordella","year":"2004","unstructured":"Cordella L P, Foggia P, Sansone C, Vento M. A (sub) graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(10): 1367\u20131372","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"5522_CR35","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s11280-014-0322-0","volume":"19","author":"P Peng","year":"2016","unstructured":"Peng P, Zou L, Chen L, Lin X M, Zhao D Y. Answering subgraph queries over massive disk resident graphs. World Wide Web: Internet and Web Information Systems, 2016, 19(3): 417\u2013448","journal-title":"World Wide Web: Internet and Web Information Systems"},{"issue":"2","key":"5522_CR36","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","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. Proceedings of the VLDB Endowment, 2012, 6(2): 133\u2013144","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"5","key":"5522_CR37","doi-asserted-by":"publisher","first-page":"617","DOI":"10.14778\/2735479.2735493","volume":"8","author":"X G Ren","year":"2015","unstructured":"Ren X G, Wang J H. Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proceedings of the VLDB Endowment, 2015, 8(5): 617\u2013628","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5522_CR38","first-page":"62","volume-title":"Proceedings of the 29th International Conference on Data Engineering.","author":"F N Afrati","year":"2013","unstructured":"Afrati F N, Fotakis D, Ullman J D. Enumerating subgraph instances using Map-Reduce. In: Proceedings of the 29th International Conference on Data Engineering. 2013, 62\u201373"},{"issue":"12","key":"5522_CR39","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.14778\/2732977.2732983","volume":"7","author":"W F Fan","year":"2014","unstructured":"Fan W F, Wang X, Wu Y H, Deng D. Distributed graph simulation: impossibility and possibility. Proceedings of the VLDB Endowment, 2014, 7(12): 1083\u20131094","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"5522_CR40","doi-asserted-by":"publisher","first-page":"264","DOI":"10.14778\/1920841.1920878","volume":"3","author":"W F Fan","year":"2010","unstructured":"Fan W F, Li J Z, Ma S, Tang N, Wu Y H, Wu Y P. Graph pattern matching: from intractable to polynomial time. Proceedings of the VLDB Endowment, 2010, 3(1): 264\u2013275","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"13","key":"5522_CR41","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.14778\/2536258.2536263","volume":"6","author":"W F Fan","year":"2013","unstructured":"Fan W F, Wang X, Wu Y H. Diversified top-k graph pattern matching. Proceedings of the VLDB Endowment, 2013, 6(13): 1510\u20131521","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5522_CR42","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1145\/2187836.2187963","volume-title":"Proceedings of the 21st World Wide Web Conference.","author":"S Ma","year":"2012","unstructured":"Ma S, Cao Y, Huai J P, Wo T Y. Distributed graph pattern matching. In: Proceedings of the 21st World Wide Web Conference. 2012, 949\u2013958"},{"key":"5522_CR43","first-page":"901","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.","author":"A Khan","year":"2011","unstructured":"Khan A, Li N, Yan X F, Guan Z Y, Chakraborty S, Tao S. Neighborhood based fast graph search in large networks. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2011, 901\u2013912"},{"key":"5522_CR44","first-page":"211","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases.","author":"P Buneman","year":"2006","unstructured":"Buneman P, Cong G, Fan W F, Kementsietsidis A. Using partial evaluation in distributed query evaluation. In: Proceedings of the 32nd International Conference on Very Large Data Bases. 2006, 211\u2013222"},{"key":"5522_CR45","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/1247480.1247537","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.","author":"G Cong","year":"2007","unstructured":"Cong G, Fan W F, Kementsietsidis A. Distributed query evaluation with performance guarantees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007, 509\u2013520"},{"issue":"4","key":"5522_CR46","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2389241.2389251","volume":"37","author":"G Cong","year":"2012","unstructured":"Cong G, Fan W F, Kementsietsidis A, Li J Z, Liu X M. Partial evaluation for distributed XPath query processing and beyond. ACM Transactions on Database Systems, 2012, 37(4): 32","journal-title":"ACM Transactions on Database Systems"},{"issue":"11","key":"5522_CR47","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.14778\/2350229.2350248","volume":"5","author":"W F Fan","year":"2012","unstructured":"Fan W F, Wang X, Wu Y H. Performance guarantees for distributed reachability queries. Proceedings of the VLDB Endowment, 2012, 5(11): 1304\u20131315","journal-title":"Proceedings of the VLDB Endowment"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-016-5522-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-5522-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-5522-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T07:26:36Z","timestamp":1693207596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-016-5522-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,18]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["5522"],"URL":"https:\/\/doi.org\/10.1007\/s11704-016-5522-6","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,18]]},"assertion":[{"value":"5 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}