{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:24Z","timestamp":1740098964340,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319671611"},{"type":"electronic","value":"9783319671628"}],"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-67162-8_6","type":"book-chapter","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T10:16:52Z","timestamp":1505125012000},"page":"45-53","source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous Graph Pattern Matching on Multiprocessor Systems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Krause","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annett","family":"Ungeth\u00fcm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kissinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Habich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,9]]},"reference":[{"key":"6_CR1","first-page":"1457","volume":"9","author":"G Bagan","year":"2016","unstructured":"Bagan, G., et al.: Generating flexible workloads for graph databases. PVLDB 9, 1457\u20131460 (2016)","journal-title":"PVLDB"},{"key":"6_CR2","first-page":"63","volume":"4","author":"S Decker","year":"2000","unstructured":"Decker, S., et al.: The semantic web: the roles of xml and rdf. IEEE 4, 63\u201373 (2000)","journal-title":"IEEE"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Fard, A., et al.: A distributed vertex-centric approach for pattern matching in massive graphs. In: 2013 IEEE International Conference on Big Data (Oct 2013)","DOI":"10.1109\/BigData.2013.6691601"},{"key":"6_CR4","unstructured":"Gonzalez, J.E., et al.: Powergraph: Distributed graph-parallel computation on natural graphs. In: OSDI (2012)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., et al.: 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."},{"key":"6_CR6","unstructured":"Kissinger, T., et al.: ERIS: A numa-aware in-memory storage engine for analytical workload. In: ADMS (2014)"},{"key":"6_CR7","unstructured":"Krause, A., et al.: Asynchronous graph pattern matching on multiprocessor systems (2017). https:\/\/arxiv.org\/abs\/1706.03968"},{"key":"6_CR8","unstructured":"Krause, A., et al.: Partitioning Strategy Selection for In-Memory Graph Pattern Matching on Multiprocessor Systems (2017). http:\/\/wwwdb.inf.tu-dresden.de\/europar2017\/ . Accepted at Euro-Par 2017"},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune, R.R., et al.: Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv. 48(2), 25:1\u201325:39 (2015)","journal-title":"ACM Comput. Surv."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, D., et al.: A lightweight infrastructure for graph analytics. In: SIGOPS (2013)","DOI":"10.1145\/2517349.2522739"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"4021","DOI":"10.1093\/nar\/28.20.4021","volume":"28","author":"H Ogata","year":"2000","unstructured":"Ogata, H., et al.: A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Res. 28, 4021\u20134028 (2000)","journal-title":"Nucleic Acids Res."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1177\/016555150202800601","volume":"28","author":"E Otte","year":"2002","unstructured":"Otte, E., et al.: Social network analysis: a powerful strategy, also for the information sciences. J. Inf. Sci. 28, 441\u2013453 (2002)","journal-title":"J. Inf. Sci."},{"key":"6_CR13","first-page":"928","volume":"2","author":"I Pandis","year":"2010","unstructured":"Pandis, I., et al.: Data-oriented transaction execution. PVLDB 2, 928\u2013939 (2010)","journal-title":"PVLDB"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Pandit, S., et al.: Netprobe: A fast and scalable system for fraud detection in online auction networks. In: WWW (2007)","DOI":"10.1145\/1242572.1242600"},{"key":"6_CR15","first-page":"1906","volume":"6","author":"J Seo","year":"2013","unstructured":"Seo, J., et al.: Distributed socialite: A datalog-based language for large-scale graph analysis. PVLDB 6, 1906\u20131917 (2013)","journal-title":"PVLDB"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Shun, J., et al.: Ligra: a lightweight graph processing framework for shared memory. IN: SIGPLAN (2013)","DOI":"10.1145\/2442516.2442530"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Tas, M.K., et al.: Greed is good: Optimistic algorithms for bipartite-graph partial coloring on multicore architectures. CoRR (2017)","DOI":"10.1109\/ICPP.2017.59"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Tran, T., et al.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.119"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33, 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood, P.T.: Query languages for graph databases. SIGMOD 41, 50\u201360 (2012)","journal-title":"SIGMOD"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Yasui, Y., et al.: Numa-aware scalable graph traversal on SGI UV systems. IN: HPGP (2016)","DOI":"10.1145\/2915516.2915522"}],"container-title":["Communications in Computer and Information Science","New Trends in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67162-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T05:15:03Z","timestamp":1570079703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67162-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319671611","9783319671628"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67162-8_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}