Filters








50,091 Hits in 5.9 sec

Distributed $k$ -Core View Materialization and Maintenance for Large Dynamic Graphs

Hidayet Aksu, Mustafa Canim, Yuan-Chi Chang, Ibrahim Korpeoglu, ozgur Ulusoy
2014 IEEE Transactions on Knowledge and Data Engineering  
These challenges inspired us to propose a new set of distributed algorithms for k-core view construction and maintenance on a horizontally scaling storage and computing platform.  ...  As the real world graphs such as social network graphs grow in size, the contents get richer and the topologies change dynamically, we are challenged not only to materialize k-core subgraphs for one time  ...  The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1109/tkde.2013.2297918 fatcat:ws4aopylhne3tc64d3z2dziloe

Efficient community identification and maintenance at multiple resolutions on distributed datastores

Hidayet Aksu, Mustafa Canim, Yuan-Chi Chang, Ibrahim Korpeoglu, Özgür Ulusoy
2015 Data & Knowledge Engineering  
Recognizing that large graphs and their even larger attributed content cannot be stored and managed by a single server, we then propose distributed algorithms to construct and maintain a multi-k-core graph  ...  With dynamic changes to its graph representation and content, the incremental maintenance of a community poses significant challenges in computation.  ...  The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1016/j.datak.2015.06.001 fatcat:ajhszwzcqbhszb5s2gum3k5ore

Batch dynamic algorithm to find k -core hierarchies

Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek
2022 Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)  
We focus on the important problem of maintaining cores on rapidly changing dynamic graphs, where batches of edge changes need to be processed quickly.  ...  We develop a new dynamic batch algorithm to maintain cores, with their connected subgraphs, that improves efficiency over processing edge-by-edge.  ...  In all cases, the distributions are relatively focused in one time range. Given that our query is efficient the runtime largely consists of copying memory.  ... 
doi:10.1145/3534540.3534694 fatcat:vy4ob5kl4ze3tlmrsqlaunlttm

BLADYG

Sabeur Aridhi, Alberto Montresor, Yannis Velegrakis
2016 Proceedings of the ACM Workshop on High Performance Graph Processing - HPGP '16  
Recently, distributed processing of large dynamic graphs has become very popular, especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis.  ...  We present bladyg, a block-centric framework that addresses the issue of dynamism in large-scale graphs. We present an implementation of bladyg on top of akka framework.  ...  We applied bladyg to the problem of distributed k-core decomposition in large dynamic graphs.  ... 
doi:10.1145/2915516.2915525 dblp:conf/hpdc/AridhiMV16 fatcat:sybtzvatmjhrhag42axroqmnim

BLADYG: A Graph Processing Framework for Large Dynamic Graphs

Sabeur Aridhi, Alberto Montresor, Yannis Velegrakis
2017 Big Data Research  
Recently, distributed processing of large dynamic graphs has become very popular, especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis.  ...  We present bladyg, a block-centric framework that addresses the issue of dynamism in large-scale graphs. We present an implementation of BLADYG on top of akka framework.  ...  We applied bladyg to two different problems: (1) distributed k-core decomposition in large dynamic graphs and (2) partitioning of large dynamic graphs.  ... 
doi:10.1016/j.bdr.2017.05.003 fatcat:b5yc2uy7trainf5ccxe2hdxhci

Core Maintenance in Dynamic Graphs: A Parallel Approach based on Matching [article]

Na Wang, Dongxiao Yu, Hai Jin, Qiang-Sheng Hua, Xuanhua Shi, Xia Xie
2017 arXiv   pre-print
Comparing with sequential approaches, our algorithms can improve the core maintenance efficiency significantly.  ...  In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem.  ...  Due to the great challenge posed in solving the core maintenance problem in dynamic graphs, previous works all focus on the case that only one edge is inserted into/deleted from the graph.  ... 
arXiv:1703.03900v1 fatcat:sunptgqxyrdxbnpvumcnmb6hym

Parallel Algorithms for Core Maintenance in Dynamic Graphs [article]

Na Wang, Dongxiao Yu, Hai Jin, Chen Qian, Xia Xie, Qiang-Sheng Hua
2016 arXiv   pre-print
This paper initiates the studies of parallel algorithms for core maintenance in dynamic graphs.  ...  To the best of our knowledge, the proposed algorithms are the first parallel ones for the fundamental core maintenance problem.  ...  It is a very difficult task to design parallel algorithms for core maintenance in dynamic graphs.  ... 
arXiv:1612.09368v1 fatcat:5oadmysvjvdzdbqdcwhkpkwoa4

A case for tree migration and integrated tree maintenance in QoS multicasting

A. Chakrabarti, G. Manimaran
2003 Computer Communications  
Moreover, we also propose an integrated approach for group management involving both local and global tree maintenance techniques.  ...  The proliferation of QoS-aware group applications coupled with the limited availability of network resources demands for efficient mechanisms to support QoS multicasting.  ...  In this paper, we focus only on the issues triggered due to group dynamics, namely, multicast tree maintenance (COLM routing, tree rearrangement, core migration).  ... 
doi:10.1016/s0140-3664(02)00195-0 fatcat:zuymq2e6uvelfidab5st3t3wxm

Efficient and Scalable Aggregate Computation on Temporal Graphs

Vincent Le Claire
2020 Very Large Data Bases Conference  
To aggreagte efficiently, useful operations on graphs need to be selected, the composition of aggregation functions needs to be investigated, and the distribution of the calculation must be studied.  ...  Existing and ongoing work on temporal graphs has focused on path problems and graph databases in general.  ...  The research problem is four-fold: Graphs have different (sometimes very costly) operations; it is necessary to find a set of operations that is both efficient and expressive.  ... 
dblp:conf/vldb/Claire20 fatcat:x5dlv6tlyjdu3o6lmvh4volyme

Multi-resolution Social Network Community Identification and Maintenance on Big Data Platform

Hidayet Aksu, Mustafa Canim, Yuan-Chi Chang, Ibrahim Korpeoglu, Ozgur Ulusoy
2013 2013 IEEE International Congress on Big Data  
We then present distributed algorithms to construct and maintain a multi-k-core graph, implemented on the scalable big-data platform Apache HBase.  ...  Community identification in social networks is of great interest and with dynamic changes to its graph representation and content, the incremental maintenance of community poses significant challenges  ...  The proposed algorithm, however, does not consider any distributed scenario where the graph resides on a large cluster of machines.  ... 
doi:10.1109/bigdata.congress.2013.23 dblp:conf/bigdata/AksuCCKU13 fatcat:apchfbd3wnd3zdmir6n63tdo4y

A Fast Order-Based Approach for Core Maintenance [article]

Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin
2016 arXiv   pre-print
One important graph analytics is to explore cohesive subgraphs in a large graph. Among several cohesive subgraphs studied, k-core is one that can be computed in linear time for a static graph.  ...  Since graphs are evolving in real applications, in this paper, we study core maintenance which is to reduce the computational cost to compute k-cores for a graph when graphs are updated from time to time  ...  CONCLUSIONS In this paper, we study core maintenance to reduce the computational cost to compute k-cores for a graph when edges are inserted/removed dynamically.  ... 
arXiv:1606.00200v2 fatcat:xfpzpkwke5ae5d7t552tjfavxi

ElCore: Dynamic elastic resource management and discovery for future large-scale manycore enabled distributed systems

Javad Zarrin, Rui L. Aguiar, João Paulo Barraca
2016 Microprocessors and microsystems  
The next generation of many-core enabled large-scale computing systems relies on thousands of billions of heterogeneous processing cores connected to form a single computing unit.  ...  The proposed architecture contains a set of modules which will dynamically be instantiated on the nodes in the distributed system on demand.  ...  This means that, in order to still be able to efficiently use such computing environments, we need to provide scalable approaches which can deal with so very large-scale systems.  ... 
doi:10.1016/j.micpro.2016.06.007 fatcat:tgqz6x3vzjddbgyab2xskei57e

Parallel Simplification of Large Meshes on PC Clusters [article]

Hua Xiong, Xiaohong Jiang, Yaping Zhang, Jiaoying Shi
2008 Eurographics Symposium on Parallel Graphics and Visualization  
To address this problem, we propose two parallel schemes to speed up simplifying large meshes on a PC cluster.  ...  While there are many algorithms proposed to simplify these large meshes, the time of simplification process is usually very long, especially for those algorithms based on iterative edge collapse.  ...  We would like to thank the Stanford Graphics Group for providing the data sets.  ... 
doi:10.2312/egpgv/egpgv08/033-040 fatcat:vo7bega5orbedjrjqbncdxfade

Robust architectures for open distributed systems and topological self-stabilization

Stefan Schmid
2010 Proceedings of the Third International Workshop on Reliability, Availability, and Security - WRAS '10  
Distributed systems are often dynamic in the sense that there are frequent membership changes (nodes joining and leaving the network), either due to regular churn or due to an attack.  ...  This paper reports on some of our recent results on robust distributed systems.  ...  The SHELL Heap There are several dynamic distributed systems that are based on the continuous-discrete approach. One example is SHELL [28] .  ... 
doi:10.1145/1953563.1953569 dblp:conf/podc/Schmid10 fatcat:prd2iy7dtzbxdasinyk32s7vhu

A Mobile Ad Hoc Network Routing Protocols: A Comparative Study [chapter]

Alagan Ramasamy Rajeswari
2020 Recent Trends in Communication Networks [Working Title]  
Mobile Ad hoc NETworks (MANET), are complex and distributed networks that are dynamic. Which are infrastructure less and multi-hop in nature.  ...  Hence it is necessary to design an efficient routing protocol for ad hoc network which can address the issues of MANET efficiently.  ...  Issues Protocol Approach Large area of flooding-flooding is a routing technique used to forward packets from the source to destination during the route discovery phase or in a recovery phase. 1.  ... 
doi:10.5772/intechopen.92550 fatcat:b34ndcwnlzgfhpeyydnywacadu
« Previous Showing results 1 — 15 out of 50,091 results