{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:12:33Z","timestamp":1750911153460,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687827"},{"type":"electronic","value":"9783319687834"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68783-4_31","type":"book-chapter","created":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T05:08:32Z","timestamp":1507007312000},"page":"457-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Subgraph Matching on Non-volatile Memory"],"prefix":"10.1007","author":[{"given":"Yishu","family":"Shen","sequence":"first","affiliation":[]},{"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,4]]},"reference":[{"issue":"4.5","key":"31_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1147\/rd.524.0465","volume":"52","author":"S Raoux","year":"2008","unstructured":"Raoux, S., Burr, G.W., Breitwisch, M.J., Rettner, C.T., Chen, Y.-C., Shelby, R.M., Salinga, M., et al.: Phase-change random access memory: a scalable technology. IBM J. Res. Dev. 52(4.5), 465\u2013479 (2008)","journal-title":"IBM J. Res. Dev."},{"issue":"7191","key":"31_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1038\/nature06932","volume":"453","author":"DB Strukov","year":"2008","unstructured":"Strukov, D.B., Snider, G.S., Stewart, D.R., Williams, R.S.: The missing memristor found. Nature 453(7191), 80\u201383 (2008)","journal-title":"Nature"},{"key":"31_CR3","unstructured":"Driskill-Smith, A.: Latest advances and future prospects of STT-RAM. In: Non-volatile Memories Workshop, pp. 11\u201313 (2010)"},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","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(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"issue":"10","key":"31_CR5","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., et al.: 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."},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., et al.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1(1), 364\u2013375 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Query language and access methods for graph databases. In: ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, pp. 405\u2013418. DBLP, June 2010","DOI":"10.1145\/1376616.1376660"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, J., Lee, J.H.: Turbo ISO: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: ACM SIGMOD International Conference on Management of Data, pp. 337\u2013348. ACM (2013)","DOI":"10.1145\/2463676.2465300"},{"issue":"5","key":"31_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.14778\/2735479.2735493","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc. VLDB Endow. 8(5), 617\u2013628 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., et al.: Efficient subgraph matching by postponing cartesian products. In: International Conference, pp. 1199\u20131214 (2016)","DOI":"10.1145\/2882903.2915236"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/LCA.2015.2402435","volume":"14","author":"M Poremba","year":"2015","unstructured":"Poremba, M., Zhang, T., Xie, Y.: NVMain 2.0: architectural simulator to model (non-)volatile memory systems. IEEE Comput. Archit. Lett. 14(2), 140\u2013143 (2015)","journal-title":"IEEE Comput. Archit. Lett."},{"issue":"2","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2024716.2024718","volume":"39","author":"N Binkert","year":"2011","unstructured":"Binkert, N., Beckmann, B., Black, G., et al.: The gem5 simulator. ACM SIGARCH Comput. Archit. News 39(2), 1\u20137 (2011)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Fineman, J.T., Gibbons, P.B., et al.: Efficient algorithms with asymmetric read and write costs. arXiv preprint arXiv:1511.01038 (2015)","DOI":"10.1145\/2755573.2755604"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Fineman, J.T., Gibbons, P.B., et al.: Sorting with asymmetric read and write costs. In: ACM on Symposium on Parallelism in Algorithms and Architectures, pp. 1\u201312. ACM (2016)","DOI":"10.1145\/2755573.2755604"},{"issue":"5","key":"31_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.14778\/2732269.2732277","volume":"7","author":"SD Viglas","year":"2014","unstructured":"Viglas, S.D.: Write-limited sorts and joins for persistent memory. Proc. VLDB Endow. 7(5), 413\u2013424 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Carson, E., Demmel, J., Grigori, L., et al.: Write-avoiding algorithms. In: IEEE International Parallel and Distributed Processing Symposium, pp. 648\u2013658. IEEE (2016)","DOI":"10.1109\/IPDPS.2016.114"},{"issue":"2","key":"31_CR17","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., et al.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc. VLDB Endow. 6(2), 133\u2013144 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"31_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68783-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T23:55:09Z","timestamp":1750895709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68783-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687827","9783319687834"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68783-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"4 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puschino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}