• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Distributed k-Core view materialization and maintenance for large dynamic graphs

      Thumbnail
      View / Download
      3.0 Mb
      Author
      Aksu, H.
      Canim, M.
      Chang, Yuan-Chi
      Korpeoglu, I.
      Ulusoy, O.
      Date
      2014-10
      Source Title
      IEEE Transactions on Knowledge & Data Engineering
      Print ISSN
      1041-4347
      Publisher
      Institute of Electrical and Electronics Engineers
      Volume
      26
      Issue
      10
      Pages
      2439 - 2452
      Language
      English
      Type
      Article
      Item Usage Stats
      109
      views
      113
      downloads
      Abstract
      In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’ regions of a graph. 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 but also to maintain them in order to keep up with continuous updates. Adding to the challenge is that real world data sets are outgrowing the capacity of a single server and its main memory. 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. Our algorithms execute against the partitioned graph data in parallel and take advantage of k-core properties to aggressively prune unnecessary computation. Experimental evaluation results demonstrated orders of magnitude speedup and advantages of maintaining k-core incrementally and in batch windows over complete reconstruction. Our algorithms thus enable practitioners to create and maintain many k-core views on different topics in rich social network content simultaneously.
      Keywords
      K-core
      Graph Theory
      Distributed computing
      Dynamic social networks
      Random hypergraphs
      Networks
      Decomposition
      Permalink
      http://hdl.handle.net/11693/12681
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TKDE.2013.2297918
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy