Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Data dissemination in large-cardinality social graphs
Linnaeus University, Faculty of Technology, Department of Computer Science.
2015 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Near real-time event streams are a key feature in many popular social media applications. These types of applications allow users to selectively follow event streams to receive a curated list of real-time events from various sources. Due to the emphasis on recency, relevance, personalization of content, and the highly variable cardinality of social subgraphs, it is extremely difficult to implement feed following at the scale of major social media applications. This leads to multiple architectural approaches, but no consensus has been reached as to what is considered to be an idiomatic solution. As of today, there are various theoretical approaches exploiting the dynamic nature of social graphs, but not all of them have been applied in practice. In this paper, large-cardinality graphs are placed in the context of existing research to highlight the exceptional data management challenges that are posed for large-scale real-time social media applications. This work outlines the key characteristics of data dissemination in large-cardinality social graphs, and overviews existing research and state-of-the-art approaches in industry, with the goal of stimulating further research in this direction.

Place, publisher, year, edition, pages
2015. , p. 30
Keywords [en]
Data dissemination, message delivery, social graph, big data, large scale, feed following, materialized views, social network analysis, community structure detection, graph theory, database theory.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:lnu:diva-48268OAI: oai:DiVA.org:lnu-48268DiVA, id: diva2:880547
External cooperation
Subject / course
Computer Science
Educational program
Software Technology Programme, Master Programme, 120 credits
Supervisors
Examiners
Available from: 2015-12-10 Created: 2015-12-09 Last updated: 2016-12-20Bibliographically approved

Open Access in DiVA

report(754 kB)88 downloads
File information
File name FULLTEXT01.pdfFile size 754 kBChecksum SHA-512
8469a6a208c0819879dc83238e13b7958c71f5e7b166c225abeb07e55a3f062a8c7031b8fe37f79f59e34c414e2931a787780b9b51f4d4e10152f9a888479439
Type fulltextMimetype application/pdf
research protocol(218 kB)62 downloads
File information
File name FULLTEXT02.pdfFile size 218 kBChecksum SHA-512
dc812ebbca142cc1b5f7506e80d165a6f1b98f3c345d2ec50977494085f54fe766c7d687c09c6942176d6939aaa33c688c74ca1b52aecb2e313fbf3be65bf9f3
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 150 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 223 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf