{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:34:25Z","timestamp":1786980865434,"version":"build-2736575974"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10586-022-03540-3","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T16:12:41Z","timestamp":1643040761000},"page":"515-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Fraud detection in the distributed graph database"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5568-0478","authenticated-orcid":false,"given":"Sakshi","family":"Srivastava","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anil Kumar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"3540_CR1","doi-asserted-by":"crossref","unstructured":"Basak, A., Li, S., Hu, X., Oh, S. M., Xie, X., Zhao, L., ..., Xie, Y.: Analysis and optimization of the memory hierarchy for graph processing workloads. In: 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 373\u2013386. IEEE (2019)","DOI":"10.1109\/HPCA.2019.00051"},{"key":"3540_CR2","doi-asserted-by":"crossref","unstructured":"Cattuto, C., Quaggiotto, M., Panisson, A., Averbuch, A.: Time-varying social networks in a graph database: a Neo4j use case. In: First international workshop on graph data management experiences and systems, pp. 1\u20136 (2013)","DOI":"10.1145\/2484425.2484442"},{"issue":"10","key":"3540_CR3","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0077455","volume":"8","author":"DB Chen","year":"2013","unstructured":"Chen, D.B., Gao, H., L\u00fc, L., Zhou, T.: Identifying influential nodes in large-scale directed networks: the role of clustering. PloS one 8(10), (2013)","journal-title":"PloS one"},{"key":"3540_CR4","doi-asserted-by":"crossref","unstructured":"Drakopoulos, G., Gourgaris, P., Kanavos, A.: Graph communities in Neo4j. Evolving Systems 1\u201311 (2018)","DOI":"10.1007\/s12530-018-9244-x"},{"key":"3540_CR5","unstructured":"Elyasi, N., Choi, C., Sivasubramaniam, A.: Large-scale graph processing on emerging storage devices. In: 17th USENIX Conference on File and Storage Technologies (FAST 19), pp. 309\u2013316 (2019)"},{"key":"3540_CR6","doi-asserted-by":"crossref","unstructured":"Gomez, L., Kuijpers, B., Vaisman, A.: Performing OLAP over graph data: query language, implementation, and a case study. In: Proceedings of the International Workshop on Real-Time Business Intelligence and Analytics, pp. 1\u20138 (2017)","DOI":"10.1145\/3129292.3129293"},{"key":"3540_CR7","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Then, M.: Graph pattern matching: do we have to reinvent the wheel?. In: Proceedings of Workshop on GRAph Data management Experiences and Systems, pp. 1\u20137 (2014)","DOI":"10.1145\/2621934.2621944"},{"key":"3540_CR8","unstructured":"Harding, L.: What are the Panama Papers? A guide to history\u2019s biggest data leak. The Guardian 5(04) (2016)"},{"key":"3540_CR9","doi-asserted-by":"crossref","unstructured":"Holzschuher, F., Peinl, R.: Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j. In: Proceedings of the Joint EDBT\/ICDT 2013 Workshops, pp. 195\u2013204 (2013)","DOI":"10.1145\/2457317.2457351"},{"issue":"6","key":"3540_CR10","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1007\/s10796-016-9647-9","volume":"19","author":"SY Huang","year":"2017","unstructured":"Huang, S.Y., Lin, C.C., Chiu, A.A., Yen, D.C.: Fraud detection using fraud triangle risk factors. Inf. Syst. Front. 19(6), 1343\u20131356 (2017)","journal-title":"Inf. Syst. Front."},{"key":"3540_CR11","doi-asserted-by":"crossref","unstructured":"Junghanns, M., Petermann, A., Neumann, M., Rahm, E.: Management and analysis of big graph data: current systems and open challenges. In: Handbook of Big Data Technologies, pp. 457\u2013505. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-49340-4_14"},{"issue":"3","key":"3540_CR12","first-page":"1","volume":"11","author":"Q Liu","year":"2017","unstructured":"Liu, Q., Xiang, B., Yuan, N.J., Chen, E., Xiong, H., Zheng, Y., Yang, Y.: An influence propagation view of pagerank. ACM Trans. Knowl. Discov. Data (TKDD) 11(3), 1\u201330 (2017)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"3540_CR13","doi-asserted-by":"crossref","unstructured":"Liu, X., Tian, Y., He, Q., Lee, W.C., McPherson, J.: Distributed graph summarization. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 799\u2013808 (2014)","DOI":"10.1145\/2661829.2661862"},{"key":"3540_CR14","unstructured":"Maduako, I., Cavalheri, E., Wachowicz, M.: Exploring the use of time-varying graphs for modelling transit networks (2018). arXiv preprint arXiv:1803.07610"},{"issue":"3","key":"3540_CR15","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1007\/s10586-019-02977-3","volume":"23","author":"H Mahfoud","year":"2020","unstructured":"Mahfoud, H.: Graph pattern matching with counting quantifiers and label-repetition constraints. Clust. Comput. 23(3), 1529\u20131553 (2020)","journal-title":"Clust. Comput."},{"issue":"4","key":"3540_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3409473","volume":"12","author":"S Maiolo","year":"2020","unstructured":"Maiolo, S., Etcheverry, L., Marotta, A.: Data profiling in property graph databases. J. Data Inform. Qual. (JDIQ) 12(4), 1\u201327 (2020)","journal-title":"J. Data Inform. Qual. (JDIQ)"},{"issue":"5","key":"3540_CR17","first-page":"2211","volume":"12","author":"AB Mathew","year":"2018","unstructured":"Mathew, A.B.: Efficient query retrieval from social data in neo4j using lindex. KSII Trans. Internet Inform. Syst. (TIIS) 12(5), 2211\u20132232 (2018)","journal-title":"KSII Trans. Internet Inform. Syst. (TIIS)"},{"key":"3540_CR18","unstructured":"Neo4j Powers the Panama Papers Investigation (2019). https:\/\/Neo4j.com\/news\/Neo4j-powers Panama-papersinvestigation"},{"key":"3540_CR19","unstructured":"Obermaier, F., Obermayer, B.: The Panama Papers: Breaking the story of how the rich and powerful hide their money. Simon and Schuster (2017)"},{"issue":"11","key":"3540_CR20","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1093\/rfs\/hhz017","volume":"32","author":"J O\u2019Donovan","year":"2019","unstructured":"O\u2019Donovan, J., Wagner, H.F., Zeume, S.: The value of offshore secrets: Evidence from the Panama Papers. The Review of Financial Studies 32(11), 4117\u20134155 (2019)","journal-title":"The Review of Financial Studies"},{"key":"3540_CR21","doi-asserted-by":"publisher","first-page":"113303","DOI":"10.1016\/j.dss.2020.113303","volume":"133","author":"T Pourhabibi","year":"2020","unstructured":"Pourhabibi, T., Ong, K.L., Kam, B.H., Boo, Y.L.: Fraud detection: a systematic literature review of graph-based anomaly detection approaches. Decis. Support Syst. 133, 113303 (2020)","journal-title":"Decis. Support Syst."},{"key":"3540_CR22","first-page":"1","volume":"14","author":"L Qiu","year":"2021","unstructured":"Qiu, L., Zhang, J., Tian, X.: Ranking influential nodes in complex networks based on local and global structures. Appl. Intell. 14, 1\u201314 (2021)","journal-title":"Appl. Intell."},{"issue":"3","key":"3540_CR23","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s10586-019-03013-0","volume":"23","author":"G Roumelis","year":"2020","unstructured":"Roumelis, G., Velentzas, P., Vassilakopoulos, M., Corral, A., Fevgas, A., Manolopoulos, Y.: Parallel processing of spatial batch-queries using xBR+-trees in solid-state drives. Clust. Comput. 23(3), 1555\u20131575 (2020)","journal-title":"Clust. Comput."},{"key":"3540_CR24","doi-asserted-by":"crossref","unstructured":"Sarma, D., Alam, W., Saha, I., Alam, M.N., Alam, M.J., Hossain, S.: Bank fraud detection using community detection algorithm. In: 2020 Second International Conference on Inventive Research in Computing Applications (ICIRCA), pp. 642\u2013646. IEEE (2020)","DOI":"10.1109\/ICIRCA48905.2020.9182954"},{"key":"3540_CR25","doi-asserted-by":"crossref","unstructured":"Sarstedt, M., Mooi, E.: A concise guide to market research. Process, Data, and, 12 (2014)","DOI":"10.1007\/978-3-642-53965-7"},{"issue":"01","key":"3540_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.36548\/jismac.2021.1.003","volume":"3","author":"S Shakya","year":"2021","unstructured":"Shakya, S.: IoT based F-RAN architecture using cloud and edge detection system. J. ISMAC 3(01), 31\u201339 (2021)","journal-title":"J. ISMAC"},{"key":"3540_CR27","doi-asserted-by":"crossref","unstructured":"Spyropoulos, V., Vasilakopoulou, C., Kotidis, Y.: Digree: A middleware for a graph databases polystore. In: 2016 IEEE International Conference on Big Data (Big Data), pp. 2580\u20132589. IEEE (2016)","DOI":"10.1109\/BigData.2016.7840900"},{"key":"3540_CR28","doi-asserted-by":"crossref","unstructured":"Srivastava, S., Singh, A.K.: Graph based analysis of panama papers. In: 2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC), pp. 822\u2013827. IEEE (2018)","DOI":"10.1109\/PDGC.2018.8745785"},{"key":"3540_CR29","doi-asserted-by":"crossref","unstructured":"Sz\u00e1rnyas, G.: Incremental view maintenance for property graph queries. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1843\u20131845 (2018)","DOI":"10.1145\/3183713.3183724"},{"key":"3540_CR30","unstructured":"Tanase, G., Suzumura, T., Lee, J., Chen, C. F., Crawford, J., Kanezashi, H., ..., Vijitbenjaronk, W.D.: System G distributed graph database (2018). arXiv preprint arXiv:1802.03057"},{"key":"3540_CR31","unstructured":"The five most important Graphs from the Panama Papers leaks (2019). https:\/\/qz.com\/654027\/the-five-most-important-graphs-from-these-.panama-papers-leaks"},{"key":"3540_CR32","doi-asserted-by":"crossref","unstructured":"van Rest, O., Hong, S., Kim, J., Meng, X., Chafi, H.: PGQL: a property graph query language. In: Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems, pp. 1\u20136 (2016)","DOI":"10.1145\/2960414.2960421"},{"key":"3540_CR33","volume-title":"A Programmatic Introduction to Neo4j","author":"J Webber","year":"2018","unstructured":"Webber, J., Robinson, I.: A Programmatic Introduction to Neo4j. Addison-Wesley Professional, Boston (2018)"},{"key":"3540_CR34","unstructured":"What is the Secret Behind the Panama Papers? (2019). https:\/\/datafloq.com\/read\/panama-papers-its-all-about-the-data\/2072"},{"issue":"2","key":"3540_CR35","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s10586-020-03173-4","volume":"24","author":"P Yelmewad","year":"2021","unstructured":"Yelmewad, P., Talawar, B.: Parallel deterministic local search heuristic for minimum latency problem. Clust. Comput. 24(2), 969\u2013995 (2021)","journal-title":"Clust. Comput."},{"key":"3540_CR36","doi-asserted-by":"crossref","unstructured":"Zhu, J., Tirumala, S.S., Babu, G.A.: A technical evaluation of Neo4j and elasticsearch for mining twitter data. In: International Conference on Advances in Computing and Data Sciences, pp. 359-369. Springer, Singapore (2018)","DOI":"10.1007\/978-981-13-1813-9_36"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03540-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03540-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03540-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T09:14:44Z","timestamp":1677489284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03540-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,24]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["3540"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03540-3","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,24]]},"assertion":[{"value":"18 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}