{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:54:06Z","timestamp":1752360846460,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030750749"},{"type":"electronic","value":"9783030750756"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-75075-6_13","type":"book-chapter","created":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T07:04:46Z","timestamp":1619420686000},"page":"160-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Triangle Enumeration for Billion-Scale Graphs in RDBMS"],"prefix":"10.1007","author":[{"given":"Aly","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Keanelek","family":"Enns","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Mahanthappa, S., Avarkar, B.: Data Formats and Its Research Challenges in IoT: A Survey. Springer (2020)","DOI":"10.1007\/978-981-15-5258-8_47"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Park, H., Silvestri, F., Kang, U., Pagh, R.: Mapreduce triangle enumeration with guarantees (2014)","DOI":"10.1145\/2661829.2662017"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. ACM Tkdd 6, 1\u201332 (2012)","DOI":"10.1145\/2382577.2382581"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.: Massive graph triangulation (2013)","DOI":"10.1145\/2463676.2463704"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Tcs 407, 458\u2013473 (200)","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Schank, T.: Algorithmic aspects of triangle-based network analysis (2007)","DOI":"10.1155\/2007\/52861"},{"key":"13_CR8","unstructured":"Kelly, R.: Internet of things data to top 1.6 zettabytes by 2022. Campus Technol. 9, 1536\u20131233 (201)"},{"key":"13_CR9","unstructured":"Mcafee, A., Brynjolfsson, E., Davenport, T., Patil, D., Barton, D.: Big data: the management revolution. Harv. Bus. Rev. 90, 60\u201368 (2012)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Jagadish, H., Gehrke, J., Labrinidis, A., Papakonstantinou, Y., Patel, J., Ramakrishnan, R., Shahabi, C.: Big data and its technical challenges. CACM 57, 86\u201394 (2014)","DOI":"10.1145\/2611567"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Thomo, A.: Pagerank for billion-scale networks in RDBMS (2020)","DOI":"10.1007\/978-3-030-57796-4_9"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Codd, E.: A relational model of data for large shared data banks. Springer (2002)","DOI":"10.1007\/978-3-642-59412-0_16"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Database mining: a performance perspective. IEEE Tkde 5, 914\u2013925 (1993)","DOI":"10.1109\/69.250074"},{"key":"13_CR14","first-page":"909","volume":"16","author":"C Ordonez","year":"2004","unstructured":"Ordonez, C., Omiecinski, E.: Efficient disk-based K-means clustering for relational databases. IEEE Tkde 16, 909\u2013921 (2004)","journal-title":"IEEE Tkde"},{"key":"13_CR15","unstructured":"Gao, J., Zhou, J., Yu, J., Wang, T.: Shortest path computing in relational DBMSs. IEEE Tkde 26, 997\u20131011 (2013)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40, 1\u201339 (200)","DOI":"10.1145\/1322432.1322433"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Arifuzzaman, S., Khan, M., Marathe, M.: PATRIC: a parallel algorithm for counting triangles in massive networks (2013)","DOI":"10.1145\/2505515.2505545"},{"key":"13_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. Proc. Natl. Acad. Sci. 101, 2658\u20132663 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Berry, J., Hendrickson, B., Laviolette, R., Phillips, C.: Tolerating the community detection resolution limit with edge weighting. Phys. Rev. E 83, 056119 (2011)","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Yu, M., Qin, L., Zhang, Y., Zhang, W., Lin, X.: Aot: pushing the efficiency boundary of main-memory triangle listing (2020)","DOI":"10.1007\/978-3-030-59416-9_31"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Park, H., Chung, C.: An efficient MapReduce algorithm for counting triangles in a very large graph (2013)","DOI":"10.1145\/2505515.2505563"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Park, H., Myaeng, S., Kang, U.: PTE: enumerating trillion triangles on distributed systems (2016)","DOI":"10.1145\/2939672.2939757"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jcss.2016.09.011","volume":"89","author":"A Ahmed","year":"2017","unstructured":"Ahmed, A., Thomo, A.: Computing source-to-target shortest paths for complex networks in RDBMS. J. Comput. Syst. Sci. 89, 114\u2013129 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, New York (2020)","DOI":"10.1017\/9781108684163"}],"container-title":["Lecture Notes in Networks and Systems","Advanced Information Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75075-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T07:21:48Z","timestamp":1619421708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75075-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030750749","9783030750756"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75075-6_13","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aina2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/aina\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}