research-article

Benchmarking database systems for social network applications

Authors:

Renzo Angles,

Arnau Prat-Pérez,

David Dominguez-Sal,

Josep-Lluis Larriba-PeyAuthors Info & Claims

GRADES '13: First International Workshop on Graph Data Management Experiences and Systems

Article No.: 15, Pages 1 - 7

https://doi.org/10.1145/2484425.2484440

Published: 23 June 2013 Publication History

Get Access

Abstract

Graphs have become an indispensable tool for the analysis of linked data. As with any data representation, the need for using database management systems appears when they grow in size and complexity. Associated to those needs, benchmarks appear to assess the performance of such systems in specific scenarios, representative of real use cases.

In this paper we propose a microbenchmark based on social networks. This includes a data generator that synthetically creates social graphs, and a set of low level atomic queries that model parts of the behavior of social network users. In order to understand how different data management paradigms are stressed, we execute the benchmark over five different database systems representing graph (Dex and Neo4j), RDF (RDF-3X) and relational (Virtuoso and PostgreSQL) data management. We conclude that reachability queries are those that put all the database systems into more difficulties, justifying themselves, and making them good candidates for more complex benchmarks.

References

[1]

R. Angles. A comparison of current graph database models. In ICDEW, pages 171--177, 2012.

Digital Library

Google Scholar

[2]

T. G. Armstrong, V. Ponnekanti, D. Borthakur, and M. Callaghan. Linkench: a database benchmark based on the facebook social graph. In ACM SIGMOD, 2013 (To appear).

Digital Library

Google Scholar

[3]

J. Biskup and H. Stiefeling. Transitive closure algorithms for very large databases. In Workshop on Graph Theoretical Concepts in Computer Science, 1988.

Digital Library

Google Scholar

[4]

H. Boral and D. J. DeWitt. A methodology for database system performance evaluation. SIGMOD Record, 14(2):176--185, 1984.

Digital Library

Google Scholar

[5]

D. Chakrabarti, Y. Zhan, and C.s Faloutsos. R-mat: A recursive model for graph mining. In ICDM, 2004.

Google Scholar

[6]

D. Dominguez-Sal, P. Urbón-Bayes, A. Giménez-Vañó, S. Gómez-Villamor, N. Martínez-Bazan, and J. Larriba-Pey. Survey of graph database performance on the hpc scalable graph analysis benchmark. In IWGD, pages 37--48, 2010.

Digital Library

Google Scholar

[7]

Facebook. Annual report 2012 (10k). 1 Feb. 2013.

Google Scholar

[8]

J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. TKDD, 1(1):2, 2007.

Digital Library

Google Scholar

[9]

T. Neumann and G. Weikum. The rdf-3x engine for scalable management of rdf data. VLDB Journal, 19(1):91--113, 2010.

Digital Library

Google Scholar

[10]

Mihalis Yannakakis. Graph-Theoretic Methods in Database Theory. In PODS, pages 230--242. ACM Press, 1990.

Digital Library

Google Scholar

Cited By

View all

Johnson MParadies MKlöckner HMuzafarova ALackeos KChampion DDembska MSchindler S(2024)Evaluation of Provenance Serialisations for Astronomical Provenance - Application Track2024 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)10.1109/EuroSPW61312.2024.00070(583-591)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSPW61312.2024.00070
Zheng YDou WWang YQin ZTang LGao YWang DWang WWei JRyu SSmaragdakis Y(2022)Finding bugs in Gremlin-based graph database systems via Randomized differential testingProceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3533767.3534409(302-313)Online publication date: 18-Jul-2022
https://dl.acm.org/doi/10.1145/3533767.3534409
Patras VLaskas PKoritsoglou KFudos IKarvounis E(2021)A comparative evaluation of RDBMS and GDBMS for shortest path operations on pedestrian navigation data2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)10.1109/SEEDA-CECNSM53056.2021.9566235(1-5)Online publication date: 24-Sep-2021
https://doi.org/10.1109/SEEDA-CECNSM53056.2021.9566235
Show More Cited By

Benchmarking database systems for social network applications
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Benchmarking simple database operations
SIGMOD '87: Proceedings of the 1987 ACM SIGMOD international conference on Management of data

There are two widely-known benchmarks for database management systems the TP1 benchmarks (Anon et al [1985]), designed to measure transaction throughout, and the Wisconsin benchmarks (Bitton, Dewitt, & Turbyfil [1984]), designed to measure the ...
Benchmarking simple database operations

There are two widely-known benchmarks for database management systems the TP1 benchmarks (Anon et al [1985]), designed to measure transaction throughout, and the Wisconsin benchmarks (Bitton, Dewitt, & Turbyfil [1984]), designed to measure the ...
Benchmarking in-memory database

We have witnessed exciting development of RAM technology in the past decade. The memory size grows rapidly and the price continues to decrease, so that it is feasible to deploy large amounts of RAM in a computer system. Several companies and research ...

Comments

Information & Contributors

Information

Published In

GRADES '13: First International Workshop on Graph Data Management Experiences and Systems

June 2013

101 pages

ISBN:9781450321884

DOI:10.1145/2484425

Conference Chairs:
Peter Boncz
CWI
,
Thomas Neumann
TU Munich

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 June 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Conference

SIGMOD/PODS'13

Sponsor:

SIGMOD

SIGMOD/PODS'13: International Conference on Management of Data

June 23, 2013

New York, New York

Acceptance Rates

Overall Acceptance Rate 29 of 61 submissions, 48%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
689
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)1

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Johnson MParadies MKlöckner HMuzafarova ALackeos KChampion DDembska MSchindler S(2024)Evaluation of Provenance Serialisations for Astronomical Provenance - Application Track2024 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)10.1109/EuroSPW61312.2024.00070(583-591)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSPW61312.2024.00070
Zheng YDou WWang YQin ZTang LGao YWang DWang WWei JRyu SSmaragdakis Y(2022)Finding bugs in Gremlin-based graph database systems via Randomized differential testingProceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3533767.3534409(302-313)Online publication date: 18-Jul-2022
https://dl.acm.org/doi/10.1145/3533767.3534409
Patras VLaskas PKoritsoglou KFudos IKarvounis E(2021)A comparative evaluation of RDBMS and GDBMS for shortest path operations on pedestrian navigation data2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)10.1109/SEEDA-CECNSM53056.2021.9566235(1-5)Online publication date: 24-Sep-2021
https://doi.org/10.1109/SEEDA-CECNSM53056.2021.9566235
Rahimi MMalek MClaramunt CLe Pors T(2021)A topology-based graph data model for indoor spatial-social networkingInternational Journal of Geographical Information Science10.1080/13658816.2021.191234935:12(2517-2539)Online publication date: 14-Apr-2021
https://doi.org/10.1080/13658816.2021.1912349
Ahmadi ZParand FMatinfar F(2021) A fuzzy logic‐based approach for fuzzy queries over NoSQL graph database Concurrency and Computation: Practice and Experience10.1002/cpe.654234:1Online publication date: 3-Aug-2021
https://doi.org/10.1002/cpe.6542
Constantinov CDogaru DMocanu M(2020)Graph Model Proposals for Capturing Meta-information Within Professional Network Data2020 Seventh International Conference on Social Networks Analysis, Management and Security (SNAMS)10.1109/SNAMS52053.2020.9336574(1-8)Online publication date: 14-Dec-2020
https://doi.org/10.1109/SNAMS52053.2020.9336574
Angles RParedes RGarcia R(2020) R 3 MAT: A Rapid and Robust Graph Generator IEEE Access10.1109/ACCESS.2020.30095778(130048-130065)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3009577
Van Erven GCarvalho RCordeiro da Silva WLifschitz SVera-Olivera HHolanda M(2019)Designing Graph Databases With GRAPHEDJournal of Database Management10.4018/JDM.201901010330:1(41-60)Online publication date: Jan-2019
https://doi.org/10.4018/JDM.2019010103
Kovács TSimon GMezei G(2019)Benchmarking Graph Database Backends—What Works Well with Wikidata?Acta Cybernetica10.14232/actacyb.24.1.2019.524:1(43-60)Online publication date: 21-May-2019
https://doi.org/10.14232/actacyb.24.1.2019.5
Azzini ACeravolo PColella M(2019)Performances of OLAP Operations in Graph and Relational DatabasesKnowledge Management in Organizations10.1007/978-3-030-21451-7_24(282-293)Online publication date: 12-Jun-2019
https://doi.org/10.1007/978-3-030-21451-7_24
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Benchmarking simple database operations

Benchmarking simple database operations

Benchmarking in-memory database

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

Benchmarking simple database operations

Benchmarking simple database operations

Benchmarking in-memory database

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations