{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:58:00Z","timestamp":1773482280527,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T00:00:00Z","timestamp":1307404800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00778-011-0238-6","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T06:52:10Z","timestamp":1307343130000},"page":"97-120","source":"Crossref","is-referenced-by-count":22,"title":["Answering pattern match queries in large graph databases via graph embedding"],"prefix":"10.1007","volume":"21","author":[{"given":"Lei","family":"Zou","sequence":"first","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[]},{"given":"Dongyan","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,7]]},"reference":[{"key":"238_CR1","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Braunm\u00fcller, B., Krebs, F., Kriegel, H.-P.: Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data. In: SIGMOD, pp. 379\u2013388 (2001)","DOI":"10.1145\/376284.375714"},{"issue":"7","key":"238_CR2","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U. Brandes","year":"2007","unstructured":"Brandes U., Pich C.: Centrality estimation in large networks. Int. J. Bifurcat. Chaos 17(7), 2303\u20132318 (2007)","journal-title":"Int. J. Bifurcat. Chaos"},{"key":"238_CR3","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using r-trees. In: SIGMOD, pp. 237\u2013246 (1993)","DOI":"10.1145\/170036.170075"},{"key":"238_CR4","doi-asserted-by":"crossref","unstructured":"Chan, E.P.F., Zhang, N.: Finding shortest paths in large network systems. In: ACM-GIS, pp. 160\u2013166 (2001)","DOI":"10.1145\/512195.512197"},{"key":"238_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: an efficient algorithm for answering graph reachability queries. In: ICDE, pp. 893\u2013902 (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"238_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: fg-index: towards verification-free query processing on graph databases. In: SIGMOD, pp. 857\u2013872. (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"238_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In: EDBT, pp. 481\u2013492 (2009)","DOI":"10.1145\/1516360.1516417"},{"key":"238_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Ding, B., Yu, P.S., Wang, H.: Fast graph pattern matching. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497500"},{"issue":"5","key":"238_CR9","doi-asserted-by":"crossref","first-page":"937","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 J. Comput. 32(5), 937\u2013946 (2003)","journal-title":"SIAM J. Comput."},{"key":"238_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L. Freeman","year":"1977","unstructured":"Freeman L.: A set of measures of centrality based upon betweenness. Sociometry 40, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"238_CR11","doi-asserted-by":"crossref","unstructured":"Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376676"},{"key":"238_CR12","unstructured":"Han J., Kamber M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, (2000)"},{"key":"238_CR13","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.:Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305\u2013316 (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"238_CR14","doi-asserted-by":"crossref","unstructured":"Harangsri, B., Shepherd, J., Ngu, A.H.H.: Selectivity estimation for joins using systematic sampling. In: DEXA workshop, pp. 384\u2013389 (1997)","DOI":"10.1109\/DEXA.1997.617318"},{"key":"238_CR15","unstructured":"He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: ICDE, pp. 38\u201340 (2006)"},{"issue":"2","key":"238_CR16","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish H.V., Ooi B.C., Tan K.-L., Yu C., Zang R.: 0003 iDistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"238_CR17","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"issue":"3","key":"238_CR18","doi-asserted-by":"crossref","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 Trans. Knowl. Data Eng. 10(3), 409\u2013432 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"238_CR19","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis G., Kumar V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"238_CR20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial N., London E., Rabinovich Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"238_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert R., Barab\u00e1si Albert-L\u00e1szl\u00f3: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"238_CR22","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G. Sabidussi","year":"1966","unstructured":"Sabidussi G.: The centrality index of a graph. Psychometrika 31, 581\u2013603 (1966)","journal-title":"Psychometrika"},{"issue":"3","key":"238_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C. Shahabi","year":"2003","unstructured":"Shahabi C., Kolahdouzan M.R., Sharifzadeh M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica 7(3), 255\u2013273 (2003)","journal-title":"GeoInformatica"},{"key":"238_CR24","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS, pp. 39\u201352 (2002)","DOI":"10.1145\/543619.543620"},{"issue":"2","key":"238_CR25","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 J.M.: Saga: a subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"key":"238_CR26","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: SIGKDD, pp. 737\u2013746, (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"238_CR27","doi-asserted-by":"crossref","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD, pp 845\u2013856, (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"238_CR28","doi-asserted-by":"crossref","unstructured":"Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: COCOON (2005)","DOI":"10.1007\/11533719_45"},{"key":"238_CR29","doi-asserted-by":"crossref","unstructured":"Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: Proceedings of international conference on data engineering, pp. 75\u201389 (2006)","DOI":"10.1109\/ICDE.2006.53"},{"key":"238_CR30","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: efficient shortest path query answering on graphs. In: SIGMOD, pp. 99\u2013110 (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"238_CR31","doi-asserted-by":"crossref","unstructured":"Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE, pp. 976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"238_CR32","doi-asserted-by":"crossref","unstructured":"Wu, Y., Patel, J.M., Jagadish, H.V.: Structural join order selection for xml query optimization. In: ICDE, pp. 443\u2013454 (2003)","DOI":"10.1109\/ICDE.2003.1260812"},{"key":"238_CR33","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT, (2009)","DOI":"10.1145\/1516360.1516418"},{"key":"238_CR34","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"},{"key":"238_CR35","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"238_CR36","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: tree + delta \u2265 graph. In: VLDB, pp. 938\u2013949 (2007)"},{"key":"238_CR37","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T., Zhao, D.: Answering pattern match queries in large graph databases via graph embedding. Technical report, Peking University (2011)","DOI":"10.1007\/s00778-011-0238-6"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0238-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-011-0238-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0238-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:13:42Z","timestamp":1741220022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-011-0238-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,7]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["238"],"URL":"https:\/\/doi.org\/10.1007\/s00778-011-0238-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,7]]}}}