{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:53:18Z","timestamp":1777733598026,"version":"3.51.4"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2021,6,2]]},"abstract":"<jats:p>Graph processing has been widely adopted in various financial scenarios at Ant Group to detect malicious and prohibited user behaviors. The low latency requirement under big data volume and high throughput raises rigorous challenges for efficient online graph processing. This paper gives a brief introduction of our encountered issues, the current solutions, and some future directions we are exploring.<\/jats:p>","DOI":"10.1145\/3469379.3469389","type":"journal-article","created":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T12:43:56Z","timestamp":1622983436000},"page":"84-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Taking the Pulse of Financial Activities with Online Graph Processing"],"prefix":"10.1145","volume":"55","author":[{"given":"Xiaowei","family":"Zhu","sequence":"first","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhisong","family":"Fu","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenxuan","family":"Pan","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Jiang","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuntao","family":"Hong","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongchao","family":"Liu","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Fang","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenguang","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University, Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changhua","family":"He","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"https:\/\/www.antgroup.com\/.  https:\/\/www.antgroup.com\/."},{"key":"e_1_2_1_2_1","unstructured":"https:\/\/www.alipay.com\/. 86  https:\/\/www.alipay.com\/. 86"},{"key":"e_1_2_1_3_1","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Singles%27_ Day.  https:\/\/en.wikipedia.org\/wiki\/Singles%27_ Day."},{"key":"e_1_2_1_4_1","first-page":"17","volume-title":"10th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 12)","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez , Yucheng Low , Haijie Gu , Danny Bickson , and Carlos Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs . In 10th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 12) , pages 17 -- 30 , 2012 . Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In 10th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 12), pages 17--30, 2012."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2019.103537"},{"key":"e_1_2_1_7_1","first-page":"3","volume-title":"CIDR","volume":"3","author":"Dong Siying","year":"2017","unstructured":"Siying Dong , Mark Callaghan , Leonidas Galanis , Dhruba Borthakur , Tony Savor , and Michael Strum . Optimizing space amplification in rocksdb . In CIDR , volume 3 , page 3 , 2017 . Siying Dong, Mark Callaghan, Leonidas Galanis, Dhruba Borthakur, Tony Savor, and Michael Strum. Optimizing space amplification in rocksdb. In CIDR, volume 3, page 3, 2017."},{"key":"e_1_2_1_8_1","first-page":"305","volume-title":"search of an understandable consensus algorithm. In 2014 {USENIX} Annual Technical Conference ({USENIX}{ATC} 14)","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John Ousterhout . In search of an understandable consensus algorithm. In 2014 {USENIX} Annual Technical Conference ({USENIX}{ATC} 14) , pages 305 -- 319 , 2014 . Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In 2014 {USENIX} Annual Technical Conference ({USENIX}{ATC} 14), pages 305--319, 2014."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_11_1","unstructured":"https:\/\/www.intel.com\/content\/www\/ us\/en\/architecture-and-technology\/ optane-dc-persistent-memory.html.  https:\/\/www.intel.com\/content\/www\/ us\/en\/architecture-and-technology\/ optane-dc-persistent-memory.html."},{"key":"e_1_2_1_12_1","unstructured":"Renzo Angles J\u00e1nos Benjamin Antal Alex Averbuch Peter Boncz Orri Erling Andrey Gubichev Vlad Haprian Moritz Kaufmann Josep Llu\u00eds Larriba Pey Norbert Mart\u00ednez et al. The ldbc social network benchmark. arXiv preprint arXiv:2001.02299 2020.  Renzo Angles J\u00e1nos Benjamin Antal Alex Averbuch Peter Boncz Orri Erling Andrey Gubichev Vlad Haprian Moritz Kaufmann Josep Llu\u00eds Larriba Pey Norbert Mart\u00ednez et al. The ldbc social network benchmark. arXiv preprint arXiv:2001.02299 2020."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3469379.3469389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3469379.3469389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:23Z","timestamp":1750195703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3469379.3469389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,6,2]]}},"alternative-id":["10.1145\/3469379.3469389"],"URL":"https:\/\/doi.org\/10.1145\/3469379.3469389","relation":{},"ISSN":["0163-5980"],"issn-type":[{"value":"0163-5980","type":"print"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"2021-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}