{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:44Z","timestamp":1740169244895,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100007219","name":"Shanghai Natural Science Foundation","doi-asserted-by":"publisher","award":["20ZR1402700"],"award-info":[{"award-number":["20ZR1402700"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472339","61873337","61572421","61272124"],"award-info":[{"award-number":["61472339","61873337","61572421","61272124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3106266","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T20:04:14Z","timestamp":1629489854000},"page":"116528-116539","source":"Crossref","is-referenced-by-count":0,"title":["buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0035-2287","authenticated-orcid":false,"given":"Xiaozhe","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7586-5741","authenticated-orcid":false,"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6494-5319","authenticated-orcid":false,"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8617-8939","authenticated-orcid":false,"given":"Ming","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.06.013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.15439\/2017F19"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328917"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9166-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-00099-9"},{"article-title":"Augmenting databases with generalized tran-sitive closure","year":"1993","author":"dar","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556578"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505724"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2278-9"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"leiserson","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1134030.1134043"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767832"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9346-x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28472-4_8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_158"},{"key":"ref7","first-page":"154","article-title":"Fast generation of large scale social networks while incor-porating transitive closures","author":"pfeiffer","year":"2012","journal-title":"Proc Int Conf Privacy Secur Risk Trust Int Conf Social Comput (SocialCom)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0201008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1370597"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298576"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612181"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365694"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0495-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035927"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90032-1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09519716.pdf?arnumber=9519716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:35:35Z","timestamp":1662669335000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9519716\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3106266","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}