Powerful and efficient bulk shortest-path queries-Reference-Cited by-同舟云学术

Powerful and efficient bulk shortest-path queries

Published:2016 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems - GRADES '16
language:
Short-container-title:

Author:

Rutgers Peter¹,Martella Claudio¹,Voulgaris Spyros¹,Boncz Peter¹

Affiliation:

1. VU University Amsterdam, The Netherlands

Publisher

ACM Press

Reference13 articles.

1. T. Akiba, Y. Iwata, and Y. Yoshida. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. InACM SIGMOD, 2013.

2. A. Ching, S. Edunov, M. Kabiljo, D. Logothetis, and S. Muthukrishnan. One trillion edges: graph processing at facebook-scale.VLDB, 2015.

3. J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. Graphx: Graph processing in a distributed dataflow framework. InOSDI, 2014.

4. S. Hong, S. Depner, T. Manhardt, J. Van Der Lugt, M. Verstraaten, and H. Chafi. Pgx. d: a fast distributed graph processing engine. InSupercomputing Conference (SC), 2015.

5. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. Challenges in parallel graph processing.Parallel Processing Letters, 2007.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Experiences with Implementing Landmark Embedding in Neo4j;Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) - GRADES-NDA'19;2019

2. Property Graph Database Modeling and Application of Electronic Medical Record;2018 Eighth International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC);2018-07