FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2605929129> ?p ?o ?g. }

• W2605929129 endingPage "1649" @default.
• W2605929129 startingPage "1636" @default.
• W2605929129 abstract "With the remarkable proliferation of intelligent mobile devices and fast growing broadband wireless technology, social networking is undergoing explosive growth in recent years as more and more users access social networks via mobile platforms. It is often expensive or even impossible to deploy a large online social network (OSN) on a single server. A cost-effective approach is horizontal scaling, where the OSN is partitioned and deployed on a set of low-cost servers. In this research, we study the problem of minimum-cost balanced partitioning of OSNs. Our goal is to achieve the best partitioning by minimizing the total inter-server traffic cost and at the same time balancing the load among servers. Given its NP-hardness, we propose new techniques and explore efficient heuristics to address the problem, especially for extremely large OSNs with an enormous volume of social nodes, social connections, and social data. Our key contributions include a localized approach with $O(delta ^2)$ complexity to explicitly calculate the projected gain in inter-server traffic cost (named Server Change Benefit (SCB) ). Built upon this technique, we devise two algorithms that offer online and offline solutions to achieving minimum-cost balanced partitioning of OSNs. The online algorithm is fast and highly efficient to process newly arrival individual nodes. The offline algorithm uses the current online result as a starting point. It further reduces inter-server traffic cost by applying relocation and swapping. It employs a merging process to group the nodes according to the social structure and swap the groups with similar size to further reduce the total inter-server traffic cost. We implement both algorithms and evaluate them based on a variety of real-world OSN datasets from Facebook, Arxiv, Gnutella, Amazon, and Twitter. The simulations demonstrate that the proposed algorithms can significantly reduce the execution time by an average of three folds and at the same time yield supreme performance (i.e., inter-server traffic cost) in comparison with existing solutions." @default.
• W2605929129 created "2017-04-28" @default.
• W2605929129 creator A5036976028 @default.
• W2605929129 creator A5048208733 @default.
• W2605929129 creator A5061078522 @default.
• W2605929129 date "2018-07-01" @default.
• W2605929129 modified "2023-09-26" @default.
• W2605929129 title "Scalable Minimum-Cost Balanced Partitioning of Large-Scale Social Networks: Online and Offline Solutions" @default.
• W2605929129 cites W1539763710 @default.
• W2605929129 cites W2022704179 @default.
• W2605929129 cites W2061473489 @default.
• W2605929129 cites W2070232376 @default.
• W2605929129 cites W2081684915 @default.
• W2605929129 cites W2087946700 @default.
• W2605929129 cites W2090827575 @default.
• W2605929129 cites W2108614537 @default.
• W2605929129 cites W2125032792 @default.
• W2605929129 cites W2149965524 @default.
• W2605929129 cites W2153704625 @default.
• W2605929129 doi "https://doi.org/10.1109/tpds.2017.2694835" @default.
• W2605929129 hasPublicationYear "2018" @default.
• W2605929129 type Work @default.
• W2605929129 sameAs 2605929129 @default.
• W2605929129 citedByCount "6" @default.
• W2605929129 countsByYear W26059291292019 @default.
• W2605929129 countsByYear W26059291292020 @default.
• W2605929129 countsByYear W26059291292021 @default.
• W2605929129 crossrefType "journal-article" @default.
• W2605929129 hasAuthorship W2605929129A5036976028 @default.
• W2605929129 hasAuthorship W2605929129A5048208733 @default.
• W2605929129 hasAuthorship W2605929129A5061078522 @default.
• W2605929129 hasBestOaLocation W26059291291 @default.
• W2605929129 hasConcept C111919701 @default.
• W2605929129 hasConcept C120314980 @default.
• W2605929129 hasConcept C121332964 @default.
• W2605929129 hasConcept C173608175 @default.
• W2605929129 hasConcept C2778755073 @default.
• W2605929129 hasConcept C41008148 @default.
• W2605929129 hasConcept C48044578 @default.
• W2605929129 hasConcept C62520636 @default.
• W2605929129 hasConceptScore W2605929129C111919701 @default.
• W2605929129 hasConceptScore W2605929129C120314980 @default.
• W2605929129 hasConceptScore W2605929129C121332964 @default.
• W2605929129 hasConceptScore W2605929129C173608175 @default.
• W2605929129 hasConceptScore W2605929129C2778755073 @default.
• W2605929129 hasConceptScore W2605929129C41008148 @default.
• W2605929129 hasConceptScore W2605929129C48044578 @default.
• W2605929129 hasConceptScore W2605929129C62520636 @default.
• W2605929129 hasIssue "7" @default.
• W2605929129 hasLocation W26059291291 @default.
• W2605929129 hasOpenAccess W2605929129 @default.
• W2605929129 hasPrimaryLocation W26059291291 @default.
• W2605929129 hasRelatedWork W1596201972 @default.
• W2605929129 hasRelatedWork W1604898313 @default.
• W2605929129 hasRelatedWork W1767718647 @default.
• W2605929129 hasRelatedWork W1784521533 @default.
• W2605929129 hasRelatedWork W1788737569 @default.
• W2605929129 hasRelatedWork W1986253068 @default.
• W2605929129 hasRelatedWork W2364921833 @default.
• W2605929129 hasRelatedWork W2380023786 @default.
• W2605929129 hasRelatedWork W2385146268 @default.
• W2605929129 hasRelatedWork W2503642292 @default.
• W2605929129 hasVolume "29" @default.
• W2605929129 isParatext "false" @default.
• W2605929129 isRetracted "false" @default.
• W2605929129 magId "2605929129" @default.
• W2605929129 workType "article" @default.