2014
DOI: 10.1007/978-3-319-02309-0_70
|View full text |Cite
|
Sign up to set email alerts
|

A Performance Comparison of Several Common Computation Tasks Used in Social Network Analysis Performed on Graph and Relational Databases

Abstract: NoSQL databases are more and more popular, because they fill the gap where traditional relational model of data does not fit. Social network analysis can be an example of an area, where a particular kind of NoSQL database -the graph one seems to be a natural choice. However, relational databases are developed for many years, they include advanced algorithms for indexing, query optimization etc. This raises the question, whether at the field of performance graph database and relation one are competitive. This a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
1
0
3

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 9 publications
0
1
0
3
Order By: Relevance
“…thor of a tweet and all the users who retweet it. Both logical schemas can be used and choosing one among them depends on several possible criteria, as discussed in [Wycislik and Warchal 2014] and [Almabdy 2018], where the authors compare both schemas. It is not our goal to discuss which one is better suited, but rather to illustrate that our approach enables either choice equally.…”
Section: Examples Of Analysis In Osns Supported By Logical Schemasmentioning
confidence: 99%
“…thor of a tweet and all the users who retweet it. Both logical schemas can be used and choosing one among them depends on several possible criteria, as discussed in [Wycislik and Warchal 2014] and [Almabdy 2018], where the authors compare both schemas. It is not our goal to discuss which one is better suited, but rather to illustrate that our approach enables either choice equally.…”
Section: Examples Of Analysis In Osns Supported By Logical Schemasmentioning
confidence: 99%
“…Muitos autores partem do pressuposto que um sistema baseado no modelo de dados relacional não seria eficaz nem eficiente para atender aos requisitos das análises das informac ¸ões de redes sociais. Em [Wycislik and Warchal 2014] é feita uma comparac ¸ão entre o SGBD Oracle 11g (modelo relacional) e o Neo4J (modelo de grafo) executando o algoritmo Local Clustering Coefficient (LCC). Como em outras aplicac ¸ões recentes, o artigo comenta sobre os modelos do tipo NoSQL que se tornaram cada vez mais populares por preencherem lacunas importantes deixadas por sistemas relacionais.…”
Section: Proposta De Pesquisaunclassified
“…Para realizar análises em um tempo aceitável, os dados precisam ser devidamente persistidos para que, posteriormente, seja disponibilizado um acesso rápido aos mesmos. Esta questão de persistência traz alguns questionamentos relevantes, a saber (i) se podemos considerar os bancos de dados em modelos relacionais (tradicionais) ou se é necessário considerar algum outro modelo, como é o caso de sistemas NoSQL em grafos e (ii) se o armazenamento oferecido pelos SGBDs relacionais atende aos requisitos de dados e operac ¸ões ou teríamos de considerar outros tipos nativos dos sistemas de bancos de dados não convencionais [Wycislik and Warchal 2014].…”
Section: Introduc ¸ãOunclassified
“…Recently, graph databases have been popular since they can efficiently handle some database operations required for complex queries on big databases. Many existing studies comparing the graph databases and relational databases show that graph databases perform much better than RDBMs with respect to many aspects [1], [2], [3], [4], [20], [21], [22], [23]. According to those studies, generally, the join operations on relational tables cause high costs in querying RDBMs.…”
Section: Background and Related Workmentioning
confidence: 99%