{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:13:30Z","timestamp":1747455210086,"version":"3.40.5"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319139593"},{"type":"electronic","value":"9783319139609"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","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":[[2015]]},"DOI":"10.1007\/978-3-319-13960-9_3","type":"book-chapter","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T03:40:51Z","timestamp":1421120451000},"page":"28-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compiled Plans for In-Memory Path-Counting Queries"],"prefix":"10.1007","author":[{"given":"Brandon","family":"Myers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Hyrkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Halperin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Howe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"3_CR1","unstructured":"neo4j open source graph database, May 2013. http:\/\/neo4j.org\/"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.14778\/1687553.1687592","volume":"2","author":"Y Ahmad","year":"2009","unstructured":"Ahmad, Y., Koch, C.: DBToaster: a SQL compiler for high-performance delta processing in main-memory databases. Proc. VLDB Endow. 2(2), 1566\u20131569 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-88564-1_8","volume-title":"The Semantic Web - ISWC 2008","author":"R Angles","year":"2008","unstructured":"Angles, R., Gutierrez, C.: The expressive power of SPARQL. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 114\u2013129. Springer, Heidelberg (2008)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Backstrom, L., et al.: Group formation in large social networks: membership, growth, and evolution. In: ACM KDD, pp. 44\u201354 (2006)","DOI":"10.1145\/1150402.1150412"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: An efficient multithreaded runtime system. In: Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 1995, pp. 207\u2013216. ACM, New York (1995)","DOI":"10.1145\/209937.209958"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Caverlee, J., Liu, L.: Countering web spam with credibility-based link analysis. In: ACM Principles of Distributed Computing (PODC), pp. 157\u2013166 (2007)","DOI":"10.1145\/1281100.1281124"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chen, S., Ailamaki, A., Gibbons, P., Mowry, T.: Improving hash join performance through prefetching. In: International Conference on Data Engineering (ICDE), pp. 116\u2013127 (2004)","DOI":"10.1109\/ICDE.2004.1319989"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-04329-1_21","volume-title":"Semantic Web Information Management","author":"O Erling","year":"2010","unstructured":"Erling, O., Mikhailov, I.: Virtuoso: RDF support in a native RDBMS. In: de Virgilio, R., Giunchiglia, F., Tanca, L. (eds.) Semantic Web Information Management, pp. 501\u2013519. Springer, Heidelberg (2010)"},{"key":"3_CR9","unstructured":"Gonzalez, J.E., et al.: PowerGraph: distributed graph-parallel computation on natural graphs. In: USENIX Operating Systems Design and Implementation (OSDI), pp. 17\u201330 (2012)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., et al.: Exploring network structure, dynamics, and function using NetworkX. In: Python in Science Conference (SciPy), pp. 11\u201315, August 2008","DOI":"10.25080\/TCWV9851"},{"key":"3_CR11","unstructured":"HP-Vertica. Vertica analytics platform, June 2013. http:\/\/www.vertica.com"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C., Task, C.: Counting triangles in massive graphs with MapReduce. arXiv preprint arXiv:1301.5887 (2013)","DOI":"10.1137\/13090729X"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: International Conference on World Wide Web (WWW), pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"3_CR14","unstructured":"Leskovec, J., et al.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. CoRR, abs\/0810.1355 (2008)"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/1090191.1080126","volume":"35","author":"BT Loo","year":"2005","unstructured":"Loo, B.T., et al.: Declarative routing: extensible routing with declarative queries. SIGCOMM Comput. Commun. Rev. 35(4), 289\u2013300 (2005)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Losemann, K., Martens, W.: The complexity of evaluating path expressions in SPARQL. In: Proceedings of Principles of Database Systems (PODS) (2012)","DOI":"10.1145\/2213556.2213573"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: ACM SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Mandal, A., Fowler, R., Porterfield, A.: Modeling memory concurrency for multi-socket multi-core systems. In: Performance Analysis of Systems Software (ISPASS), March 2010","DOI":"10.1109\/ISPASS.2010.5452064"},{"key":"3_CR19","unstructured":"Nelson, J., et al.: Crunching large graphs with commodity processors. In: USENIX Conference on Hot Topics in Parallelism (HotPar), pp. 10\u201310 (2011)"},{"issue":"9","key":"3_CR20","doi-asserted-by":"publisher","first-page":"539","DOI":"10.14778\/2002938.2002940","volume":"4","author":"T Neumann","year":"2011","unstructured":"Neumann, T.: Efficiently compiling efficient query plans for modern hardware. Proc. VLDB Endow. 4(9), 539\u2013550 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Neumann, T., Weikum, G.: x-RDF-3X: fast querying, high update rates, and consistency for RDF databases. In: Proceedings of the 36th International Conference on Very Large Data Bases, PVLDB 2013 (2010)","DOI":"10.14778\/1920841.1920877"},{"key":"3_CR22","unstructured":"Pavan, A., Tangwongan, K., Tirthapura, S.: Parallel and distributed triangle counting on graph streams. Technical report, IBM (2013)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11926078_3","volume-title":"The Semantic Web - ISWC 2006","author":"J P\u00e9rez","year":"2006","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 30\u201343. Springer, Heidelberg (2006)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-25953-1_5","volume-title":"The Semantic Web: ESWC 2011 Workshops","author":"M Przyjaciel-Zablocki","year":"2012","unstructured":"Przyjaciel-Zablocki, M., Sch\u00e4tzle, A., Hornung, T., Lausen, G.: RDFPath: path query processing on large RDF graphs with MapReduce. In: Garc\u00eda-Castro, R., Fensel, D., Antoniou, G. (eds.) ESWC 2011. LNCS, vol. 7117, pp. 50\u201364. Springer, Heidelberg (2012)"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/1942788.1868314","volume":"46","author":"T Rompf","year":"2010","unstructured":"Rompf, T., Odersky, M.: Lightweight modular staging: a pragmatic approach to runtime code generation and compiled dsls. SIGPLAN Not. 46(2), 127\u2013136 (2010)","journal-title":"SIGPLAN Not."},{"key":"3_CR26","unstructured":"Seo, J., Guo, S., Lam, M.S.: SociaLite: datalog extensions for efficient social network analysis. In: 29th IEEE International Conference on Data Engineering. IEEE (2013)"},{"key":"3_CR27","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-03422-0_7","volume-title":"Business Intelligence for the Real-Time Enterprise","author":"FM Waas","year":"2009","unstructured":"Waas, F.M.: Beyond conventional data warehousing-massively parallel data processing with Greenplum database. In: Castellanos, M., Dayal, U., Sellis, T. (eds.) BIRTE 2008. LNBIP, vol. 27, pp. 89\u201396. Springer, Heidelberg (2009)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Welc, A., Raman, R., Wu, Z., Hong, S., Chafi, H., Banerjee, J.: Graph analysis: do we have to reinvent the wheel? In: First International Workshop on Graph Data Management Experiences and Systems, GRADES 2013, pp. 7:1\u20137:6. ACM, New York (2013)","DOI":"10.1145\/2484425.2484432"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: ACM SIGKDD Workshop on Mining Data Semantics, pp. 3:1\u20133:8 (2012)","DOI":"10.1145\/2350190.2350193"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1016\/j.patcog.2013.04.013","volume":"46","author":"W Zhang","year":"2013","unstructured":"Zhang, W., Zhao, D., Wang, X.: Agglomerative clustering via maximum incremental path integral. Pattern Recogn. 46, 3056\u20133065 (2013)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","In Memory Data Management and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13960-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T19:18:18Z","timestamp":1747423098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13960-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319139593","9783319139609"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13960-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}