{"title":"大规模流图处理:博士研讨会","authors":"D. Margan, P. Pietzuch","doi":"10.1145/3093742.3093907","DOIUrl":null,"url":null,"abstract":"Dynamically changing graphs are a powerful abstraction used to represent temporal relationships and connections occurring between data entities in various real-world organizations, such as social and telecommunication networks. The increasing volume, variety and velocity of graph-structured data in many application domains have led to a development of large-scale graph processing systems. However, current state-of-the-art graph processing systems do not provide efficient support for streaming graph scenarios. In this report, we describe and discuss stream graph processing, which narrows the problem of traditional graph processing by focusing on near real-time analysis of dynamic graph data constructed and maintained from stream sources, as opposed to processing of historical graph datasets loaded from a disk storage. We provide an outline of challenges in stream graph processing and present our preliminary approach to designing a stream graph processing system done as a part of early PhD work.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"202 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Large-Scale Stream Graph Processing: Doctoral Symposium\",\"authors\":\"D. Margan, P. Pietzuch\",\"doi\":\"10.1145/3093742.3093907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dynamically changing graphs are a powerful abstraction used to represent temporal relationships and connections occurring between data entities in various real-world organizations, such as social and telecommunication networks. The increasing volume, variety and velocity of graph-structured data in many application domains have led to a development of large-scale graph processing systems. However, current state-of-the-art graph processing systems do not provide efficient support for streaming graph scenarios. In this report, we describe and discuss stream graph processing, which narrows the problem of traditional graph processing by focusing on near real-time analysis of dynamic graph data constructed and maintained from stream sources, as opposed to processing of historical graph datasets loaded from a disk storage. We provide an outline of challenges in stream graph processing and present our preliminary approach to designing a stream graph processing system done as a part of early PhD work.\",\"PeriodicalId\":325666,\"journal\":{\"name\":\"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems\",\"volume\":\"202 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3093742.3093907\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3093742.3093907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamically changing graphs are a powerful abstraction used to represent temporal relationships and connections occurring between data entities in various real-world organizations, such as social and telecommunication networks. The increasing volume, variety and velocity of graph-structured data in many application domains have led to a development of large-scale graph processing systems. However, current state-of-the-art graph processing systems do not provide efficient support for streaming graph scenarios. In this report, we describe and discuss stream graph processing, which narrows the problem of traditional graph processing by focusing on near real-time analysis of dynamic graph data constructed and maintained from stream sources, as opposed to processing of historical graph datasets loaded from a disk storage. We provide an outline of challenges in stream graph processing and present our preliminary approach to designing a stream graph processing system done as a part of early PhD work.