{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:09:48Z","timestamp":1743124188487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319086071"},{"type":"electronic","value":"9783319086088"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08608-8_7","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T05:30:34Z","timestamp":1404451834000},"page":"74-85","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Subgraph Matching Using GPUs"],"prefix":"10.1007","author":[{"given":"Xiaojie","family":"Lin","sequence":"first","affiliation":[]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zeyi","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Qi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Atre, M., Chaoji, V., Zaki, M.J., Hendler, J.A.: Matrix bit loaded: A scalable light weight join query processor for rdf data. In: Proceedings of the 19th International Conference on World Wide Web, pp. 41\u201350. ACM (2010)","DOI":"10.1145\/1772690.1772696"},{"key":"7_CR2","volume-title":"Introduction to protein structure","author":"C. Branden","year":"1991","unstructured":"Branden, C., Tooze, J., et al.: Introduction to protein structure, vol.\u00a02. Garland, New York (1991)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: A recursive model for graph mining. Computer Science Department, 541 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Ding, B., Yu, P.S., Wang, H.: Fast graph pattern matching. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 913\u2013922. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497500"},{"issue":"5","key":"7_CR5","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\u00a032(5), 1338\u20131355 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"10","key":"7_CR6","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\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"7_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-87479-9_40","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"F. Eichinger","year":"2008","unstructured":"Eichinger, F., B\u00f6hm, K., Huber, M.: Mining edge-weighted call graphs to localise software bugs. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 333\u2013348. Springer, Heidelberg (2008)"},{"key":"7_CR8","volume-title":"Database system implementation","author":"H. Garcia-Molina","year":"2000","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database system implementation, vol.\u00a0654. Prentice Hall Upper Saddle River, NJ (2000)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"He, B., Yang, K., Fang, R., Lu, M., Govindaraju, N., Luo, Q., Sander, P.: Relational joins on graphics processors. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 511\u2013524. ACM (2008)","DOI":"10.1145\/1376616.1376670"},{"key":"7_CR10","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 2008 ACM SIGMOD International Conference on Management of Data, pp. 405\u2013418. ACM (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kaldewey, T., Lohman, G., Mueller, R., Volk, P.: Gpu join processing revisited. In: Proceedings of the Eighth International Workshop on Data Management on New Hardware, pp. 55\u201362. ACM (2012)","DOI":"10.1145\/2236584.2236592"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T. Neumann","year":"2010","unstructured":"Neumann, T., Weikum, G.: The rdf-3x engine for scalable management of rdf data. The VLDB Journal\u00a019(1), 91\u2013113 (2010)","journal-title":"The VLDB Journal"},{"key":"7_CR13","unstructured":"NVIDIA: CUDA C best practices guide (2013)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Sun, Z., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. Proceedings of the VLDB \u2026, 788\u2013799 (2012)","DOI":"10.14778\/2311906.2311907"},{"issue":"1","key":"7_CR15","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 (JACM)\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of the ACM (JACM)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 766\u2013777. ACM (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Zhu, F., Qu, Q., Lo, D., Yan, X., Han, J., Yu, P.: Mining top-k large structural patterns in a massive network. Proceedings of the VLDB Endowment\u00a04(11) (2011)","DOI":"10.14778\/3402707.3402720"},{"issue":"1","key":"7_CR18","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\u00a02(1), 886\u2013897 (2009)","journal-title":"Proceedings of the VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08608-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:30:18Z","timestamp":1676583018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08608-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319086071","9783319086088"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08608-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}