{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:38:43Z","timestamp":1768109923285,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030594152","type":"print"},{"value":"9783030594169","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59416-9_31","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:08:14Z","timestamp":1600704494000},"page":"516-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing"],"prefix":"10.1007","author":[{"given":"Michael","family":"Yu","sequence":"first","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0378-8733(01)00035-1","volume":"23","author":"V Batagelj","year":"2001","unstructured":"Batagelj, V., Mrvar, A.: A subquadratic triad census algorithm for large sparse networks with small maximum degree. Soc. Netw. 23(3), 237\u2013243 (2001)","journal-title":"Soc. Netw."},{"key":"31_CR2","unstructured":"Batagelj, V., Zaver\u0161nik, M.: Generalized cores. arXiv preprint cs\/0202039 (2002)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of SIGKDD 2008 (2008)","DOI":"10.1145\/1401890.1401898"},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1839490.1839494","volume":"4","author":"L Becchetti","year":"2010","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. TKDD 4(3), 1\u201328 (2010)","journal-title":"TKDD"},{"issue":"5","key":"31_CR5","doi-asserted-by":"publisher","first-page":"056119","DOI":"10.1103\/PhysRevE.83.056119","volume":"83","author":"JW Berry","year":"2011","unstructured":"Berry, J.W., Hendrickson, B., LaViolette, R.A., Phillips, C.A.: Tolerating the community detection resolution limit with edge weighting. Phys. Rev. E 83(5), 056119 (2011)","journal-title":"Phys. Rev. E"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-15105-7_5","volume-title":"Data Warehousing and Knowledge Discovery","author":"B-H Chou","year":"2010","unstructured":"Chou, B.-H., Suzuki, E.: Discovering community-oriented roles of nodes in a social network. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 2010. LNCS, vol. 6263, pp. 52\u201364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15105-7_5"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: Proceedings of KDD 2011 (2011)","DOI":"10.1145\/2020408.2020513"},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382577.2382581","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. TKDD 6(4), 1\u201332 (2012)","journal-title":"TKDD"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Danisch, M., Balalau, O., Sozio, M.: Listing k-cliques in sparse real-world graphs. In: Proceedings of WWW 2018 (2018)","DOI":"10.1145\/3178876.3186125"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Giechaskiel, I., Panagopoulos, G., Yoneki, E.: PDTL: parallel and distributed triangle listing for massive graphs. In: Proceedings of ICPP 2015 (2015)","DOI":"10.1109\/ICPP.2015.46"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.W.: Massive graph triangulation. In: Proceedings of SIGMOD 2013 (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2691190.2691193","volume":"39","author":"X Hu","year":"2014","unstructured":"Hu, X., Tao, Y., Chung, C.: I\/O-efficient algorithms on triangle listing and counting. ACM Trans. Database Syst. 39(4), 1\u201330 (2014)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"31_CR14","doi-asserted-by":"publisher","first-page":"S48","DOI":"10.1137\/13090729X","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T.D., Seshadhri, C., Task, C.: Counting triangles in massive graphs with MapReduce. SIAM J. Sci. Comput. 36(5), S48\u2013S77 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20133","key":"31_CR15","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Park, H.M., Myaeng, S.H., Kang, U.: PTE: enumerating trillion triangles on distributed systems. In: Proceedings of SIGKDD 2016 (2016)","DOI":"10.1145\/2939672.2939757"},{"issue":"14","key":"31_CR17","first-page":"1870","volume":"6","author":"A Pavan","year":"2013","unstructured":"Pavan, A., Tangwongsan, K., Tirthapura, S., Wu, K.: Counting and sampling triangles from a graph stream. PVLDB 6(14), 1870\u20131881 (2013)","journal-title":"PVLDB"},{"issue":"9","key":"31_CR18","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. PNAS 101(9), 2658\u20132663 (2004)","journal-title":"PNAS"},{"key":"31_CR19","unstructured":"Schank, T.: Algorithmic aspects of triangle-based network analysis. Ph.D. thesis, Universitat Karlsruhe (TH) (2007)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11427186_54","volume-title":"Experimental and Efficient Algorithms","author":"T Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606\u2013609. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11427186_54"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Shun, J., Tangwongsan, K.: Multicore triangle computations without tuning. In: Proceedings of ICDE 2015 (2015)","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: DOULION: counting triangles in massive graphs with a coin. In: Proceedings of SIGKDD 2009 (2009)","DOI":"10.1145\/1557019.1557111"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"T\u00fcrkoglu, D., Turk, A.: Edge-based wedge sampling to estimate triangle counts in very large graphs. In: Proceedings of ICDM 2017 (2017)","DOI":"10.1109\/ICDM.2017.55"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Xiao, D., Cui, Y., Cline, D.B., Loguinov, D.: On asymptotic cost of triangle listing in random graphs. In: PODS, pp. 261\u2013272. ACM (2017)","DOI":"10.1145\/3034786.3034790"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.: Scan: a structural clustering algorithm for networks. In: Proceedings of SIGKDD 2007 (2007)","DOI":"10.1109\/ICDMW.2007.73"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of SIGKDD 2017 (2017)","DOI":"10.1145\/3097983.3098069"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting, analyzing and visualizing triangle k-core motifs within networks. In: Proceedings of ICDE 2012 (2012)","DOI":"10.1109\/ICDE.2012.35"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59416-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:36:53Z","timestamp":1709811413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59416-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594152","9783030594169"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59416-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}