{"id":22104888,"url":"https://github.com/nemeslaszlo/graphs-system","last_synced_at":"2025-03-24T02:43:50.664Z","repository":{"id":117466177,"uuid":"305648868","full_name":"NemesLaszlo/GraphS-system","owner":"NemesLaszlo","description":"This repository contains a our work about the \"Real-time Constrained Cycle Detection in Large Dynamic Graphs\" paper, which present a GraphS system to efficiently detect constrained cycles in a dynamic graph, which is changing constantly, and return the satisfying cycles in real-time.","archived":false,"fork":false,"pushed_at":"2020-11-20T15:15:27.000Z","size":19,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":4,"default_branch":"main","last_synced_at":"2025-01-29T08:44:17.839Z","etag":null,"topics":["dynamic-graph-algorithm","dynamic-graphs","graph","java","jgrapht"],"latest_commit_sha":null,"homepage":"http://www.vldb.org/pvldb/vol11/p1876-qiu.pdf","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/NemesLaszlo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-10-20T08:59:02.000Z","updated_at":"2025-01-10T14:32:18.000Z","dependencies_parsed_at":null,"dependency_job_id":"2f8a23a8-a320-48ac-a7b4-09976675eb65","html_url":"https://github.com/NemesLaszlo/GraphS-system","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemesLaszlo%2FGraphS-system","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemesLaszlo%2FGraphS-system/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemesLaszlo%2FGraphS-system/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemesLaszlo%2FGraphS-system/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/NemesLaszlo","download_url":"https://codeload.github.com/NemesLaszlo/GraphS-system/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245200670,"owners_count":20576673,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dynamic-graph-algorithm","dynamic-graphs","graph","java","jgrapht"],"created_at":"2024-12-01T06:36:19.242Z","updated_at":"2025-03-24T02:43:50.648Z","avatar_url":"https://github.com/NemesLaszlo.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GraphS-system\nThis repository contains a our work about the \"Real-time Constrained Cycle Detection in Large Dynamic Graphs\" paper, which present a GraphS system to efficiently detect constrained cycles in a dynamic graph, which is changing constantly, and return the satisfying cycles in real-time.\n\nFrom the paper:\n### Abstract.\nAs graph data is prevalent for an increasing number of Internet applications, continuously monitoring structural patterns in dynamic graphs in order to generate real-time alerts\nand trigger prompt actions becomes critical for many applications. In this paper, we present a new system GraphS\nto efficiently detect constrained cycles in a dynamic graph,\nwhich is changing constantly, and return the satisfying cycles\nin real-time. A hot point based index is built and efficiently\nmaintained for each query so as to greatly speed-up query\ntime and achieve high system throughput. The GraphS system is developed at Alibaba to actively monitor various online fraudulent activities based on cycle detection. For a\ndynamic graph with hundreds of millions of edges and vertices, the system is capable to cope with a peak rate of tens\nof thousands of edge updates per second and find all the\ncycles with predefined constraints with a 99.9% latency of\n20 milliseconds.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemeslaszlo%2Fgraphs-system","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnemeslaszlo%2Fgraphs-system","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemeslaszlo%2Fgraphs-system/lists"}