tutorial

A Highly Efficient Runtime and Graph Library for Large Scale Graph Analytics

Authors:

Wei Tan,

Ching-Yung LinAuthors Info & Claims

GRADES'14: Proceedings of Workshop on GRAph Data management Experiences and Systems

Pages 1 - 6

https://doi.org/10.1145/2621934.2621945

Published: 22 June 2014 Publication History

Get Access

Abstract

Graph analytics on big data is currently a very active area of research in both industry and academia. To support graph analytics efficiently a large number of graph processing systems have emerged targeting various perspectives of a graph application such as in memory and on disk representations, persistent storage, database capability, runtimes and execution models for exploiting parallelism, etc.

In this paper we discuss a novel graph processing system called System G Native Store which allows for efficient graph data organization and processing on modern computing architectures. In particular we describe a runtime designed to exploit multiple levels of parallelism and a generic infrastructure that allows users to express graphs with various in memory and persistent storage properties. We experimentally show the efficiency of System G Native Store for processing graph queries on state-of-the-art platforms.

References

[1]

SPARQL. http://www.w3.org/TR/rdf-sparql-query.

Google Scholar

[2]

Apache giraph. https://giraph.apache.org/, 2014.

Google Scholar

[3]

Tinkerpop. http://www.tinkerpop.com/, 2014.

Google Scholar

[4]

Titan distributed graph database. http://thinkaurelius.github.io/titan/, 2014.

Google Scholar

[5]

M. Canim and Y. Chang. System G data store: Big, rich graph data analytics in the cloud. In IEEE International Conference on Cloud Engineering, 2013.

Digital Library

Google Scholar

[6]

D. Gregor and A. Lumsdaine. The parallel bgl: A generic library for distributed graph computations. In In Parallel Object-Oriented Scientific Computing, 2005.

Google Scholar

[7]

Harshvardhan, A. Fidel, N. Amato, and L. Rauchwerger. The stapl parallel graph library. In Languages and Compilers for Parallel Computing, 2013.

Google Scholar

[8]

Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1006.4990, 2010.

Google Scholar

[9]

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, pages 135--146. ACM, 2010.

Digital Library

Google Scholar

[10]

K. Pingali. High-speed graph analytics with the galois system. In Proceedings of the First Workshop on Parallel Programming for Analytics Applications, PPAA '14, pages 41--42, 2014.

Digital Library

Google Scholar

[11]

I. Robinson, J. Webber, and E. Eifrem. Graph Databases. O'Reilly Media, Incorporated, 2013.

Digital Library

Google Scholar

[12]

J. Siek, A. Lumsdaine, and L.-Q. Lee. Boost graph library, http://www.boost.org/libs/graph/doc/index.html. 2001.

Google Scholar

Cited By

View all

Lee WKim CPaik YKim S(2023)PISA-DMA: Processing-in-Memory Instruction Set Architecture Using DMAIEEE Access10.1109/ACCESS.2023.323881211(8622-8632)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3238812
Liu YZhang XZhuang DFu XSong S(2022)DynamAP: Architectural Support for Dynamic Graph Traversal on the Automata ProcessorACM Transactions on Architecture and Code Optimization10.1145/355697619:4(1-26)Online publication date: 7-Oct-2022
https://dl.acm.org/doi/10.1145/3556976
Kim CLee WPaik YKwon KKim SPark IKim S(2022)Silent-PIM: Realizing the Processing-in-Memory Computing With Standard Memory RequestsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.306536533:2(251-262)Online publication date: 1-Feb-2022
https://doi.org/10.1109/TPDS.2021.3065365
Show More Cited By

Index Terms

A Highly Efficient Runtime and Graph Library for Large Scale Graph Analytics
1. Information systems
  1. Data management systems
    1. Database management system engines
  2. Information retrieval
    1. Document representation
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Exploiting NVM in large-scale graph analytics
INFLOW '15: Proceedings of the 3rd Workshop on Interactions of NVM/FLASH with Operating Systems and Workloads

Data center applications like graph analytics require servers with ever larger memory capacities. DRAM scaling, however, is not able to match the increasing demands for capacity. Emerging byte-addressable, non-volatile memory technologies (NVM) offer a ...
Large-scale graph analytics in Aster 6: bringing context to big data discovery

Graph analytics is an important big data discovery technique. Applications include identifying influential employees for retention, detecting fraud in a complex interaction network, and determining product affinities by exploiting community buying ...
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph

Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related result, ...

Comments

Information & Contributors

Information

Published In

GRADES'14: Proceedings of Workshop on GRAph Data management Experiences and Systems

June 2014

79 pages

ISBN:9781450329828

DOI:10.1145/2621934

Program Chairs:
Peter Boncz
CWI
,
Josep Lluis Larriba Pey
UPC Catalunya

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: 22 June 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Tutorial
Research
Refereed limited

Conference

SIGMOD/PODS'14

Sponsor:

SIGMOD

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

June 22 - 27, 2014

UT, Snowbird, USA

Acceptance Rates

Overall Acceptance Rate 29 of 61 submissions, 48%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
241
Total Downloads

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

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lee WKim CPaik YKim S(2023)PISA-DMA: Processing-in-Memory Instruction Set Architecture Using DMAIEEE Access10.1109/ACCESS.2023.323881211(8622-8632)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3238812
Liu YZhang XZhuang DFu XSong S(2022)DynamAP: Architectural Support for Dynamic Graph Traversal on the Automata ProcessorACM Transactions on Architecture and Code Optimization10.1145/355697619:4(1-26)Online publication date: 7-Oct-2022
https://dl.acm.org/doi/10.1145/3556976
Kim CLee WPaik YKwon KKim SPark IKim S(2022)Silent-PIM: Realizing the Processing-in-Memory Computing With Standard Memory RequestsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.306536533:2(251-262)Online publication date: 1-Feb-2022
https://doi.org/10.1109/TPDS.2021.3065365
Ma ZTan YJiang HYan ZLiu DChen XZhuge QSha EWang C(2020)Unified-TP: A Unified TLB and Page Table Cache Structure for Efficient Address Translation2020 IEEE 38th International Conference on Computer Design (ICCD)10.1109/ICCD50377.2020.00052(255-262)Online publication date: Oct-2020
https://doi.org/10.1109/ICCD50377.2020.00052
Chaudhry NYousaf M(2020)Architectural assessment of NoSQL and NewSQL systemsDistributed and Parallel Databases10.1007/s10619-020-07310-1Online publication date: 26-Aug-2020
https://doi.org/10.1007/s10619-020-07310-1
Elnawawy HChowdhury RAwad AByrd GEigenmann RDing CMcKee S(2019)Diligent TLBsProceedings of the ACM International Conference on Supercomputing10.1145/3330345.3330363(195-205)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3330345.3330363
Lee WKim CPaik YPark JPark IKim S(2019)Design of Processing-“Inside”-Memory Optimized for DRAM BehaviorsIEEE Access10.1109/ACCESS.2019.29242407(82633-82648)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2924240
Paradies MPlantikow SRest O(2019)Graph Data Management SystemsEncyclopedia of Big Data Technologies10.1007/978-3-319-77525-8_82(822-830)Online publication date: 20-Feb-2019
https://doi.org/10.1007/978-3-319-77525-8_82
Jiang LChen LQiu J(2018)Performance Characterization of Multi-threaded Graph Processing Applications on Many-Integrated-Core Architecture2018 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)10.1109/ISPASS.2018.00033(199-208)Online publication date: Apr-2018
https://doi.org/10.1109/ISPASS.2018.00033
Chen XWardi YYalamanchili S(2018)Instruction-throughput regulation in computer processors with data-center applicationsDiscrete Event Dynamic Systems10.1007/s10626-017-0254-928:1(127-158)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1007/s10626-017-0254-9
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

Index Terms

Recommendations

Exploiting NVM in large-scale graph analytics

Large-scale graph analytics in Aster 6: bringing context to big data discovery

Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Exploiting NVM in large-scale graph analytics

Large-scale graph analytics in Aster 6: bringing context to big data discovery

Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

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