A distributed graph engine for web scale RDF data

Proceedings of the VLDB Endowment

Volumn 6, Issue 4, 2013, Pages 265-276

  Zeng, Kai ^a   Yang, Jiacheng ^b   Wang, Haixun ^c   Shao, Bin ^c   Wang, Zhongyuan ^c,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

^c MICROSOFT RESEARCH ASIA   (China)

^d RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINES; GRAPH DATABASES; GRAPHIC METHODS; MATRIX ALGEBRA; QUERY PROCESSING; RANDOM PROCESSES; SEMANTIC WEB;

COMMUNITY DISCOVERIES; EXISTING SYSTEMS; ORDERS OF MAGNITUDE; REACHABILITY; RELATIONAL TABLES; SPARQL QUERIES; STATE-OF-THE-ART APPROACH; STATE-OF-THE-ART SYSTEM;

SEARCH ENGINES;

EID: 84879965310     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2535570.2488333     Document Type: Article

References (40)

1. Billion Triple Challenge. http://challenge.semanticweb.org/.
2. DBpedia SPARQL Benchmark (DBPSB). http://aksw.org/Projects/DBPSB.
3. Jena. http://jena.sourceforge.net.
4. Trinity. http://research.microsoft.com/en-us/projects/trinity/.
5. D. J. Abadi, A. Marcus, S. Madden, and K. Hollenbach. SW-Store: a vertically partitioned DBMS for Semantic Web data management. VLDB J., 18(2):385-406, 2009.
6. S. Alexaki, V. Christophides, G. Karvounarakis, D. Plexousakis, and K. Tolle. The ICS-FORTH RDFSuite: Managing Voluminous RDF Description Bases. In SemWeb, 2001.
7. R. Angles and C. Gutiérrez. Querying rdf data from a graph database perspective. In ESWC, pages 346-360, 2005.
8. M. Atre, V. Chaoji, M. J. Zaki, and J. A. Hendler. Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data. In WWW, pages 41-50, 2010.
9. S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak, and Z. G. Ives. DBpedia: A Nucleus for a Web of Open Data. In ISWC/ASWC, pages 722-735, 2007.
10. P. A. Bernstein and D.-M. W. Chiu. Using Semi-Joins to Solve Relational Queries. J. ACM, 28(1):25-40, 1981.
11. V. Bönström, A. Hinze,, and H. Schweppe. Storing rdf as a graph. In LA-WEB, pages 27-36, 2003.
12. J. Broekstra, A. Kampman,, and F. van Harmelen. Sesame: A Generic Architecture for Storing, and Querying RDF, and RDF Schema. In ISWC, 2002.
13. J. Cheng, J. X. Yu, B. Ding, P. S. Yu,, and H. Wang. Fast graph pattern matching. In ICDE, pages 913-922, 2008.
14. E. I. Chong, S. Das, G. Eadon,, and J. Srinivasan. An Efficient SQL-based RDF Querying Scheme. In VLDB, 2005.
15. O. Erling, and I. Mikhailov. Virtuoso: RDF Support in a Native RDBMS. In Semantic Web Information Management, pages 501-519. 2009.
16. Y. Guo, Z. Pan,, and J. He in. LUBM: A benchmark for OWL knowledge base systems. Journal of Web Semantics, 3(2-3):158-182, 2005.
17. A. Harth, J. Umbrich, A. Hogan,, and S. Decker. Yars2: A federated repository for querying graph structured data from the web. In ISWC/ASWC, pages 211-224, 2007.
18. J. Hayes, and C. Gutierrez. Bipartite graphs as intermediate model for rdf. In ISWC, 2004.
19. H. He, and A. K. Singh. Graphs-at-a-time: query language, and access methods for graph databases. In SIGMOD, 2008.
20. J. Huang, D. J. Abadi,, and K. Ren. Scalable SPARQL Querying of Large RDF Graphs. PVLDB, 4(11), 2011.
21. M. F. Husain, J. P. McGlothlin, M. M. Masud, L. R. Khan,, and B. M. Thuraisingham. Heuristics-Based Query Processing for Large RDF Graphs Using Cloud Computing. IEEE Trans. Knowl. Data Eng., 23(9):1312-1327, 2011.
22. J. Lu, Y. Yu, K. Tu, C. Lin,, and L. Zhang. An Approach to RDF(S) Query, Manipulation, and Inference on Databases. In WAIM, pages 172-183, 2005.
23. A. Lumsdaine, D. Gregor, B. Hendrickson,, and J. W. Berry. Challenges in Parallel Graph Processing. Parallel Processing Letters, 17(1):5-20, 2007.
24. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser,, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, 2010.
25. T. Neumann, and G. Weikum. RDF-3X: a RISC-style engine for RDF. PVLDB, 1(1), 2008.
26. T. Neumann, and G. Weikum. Scalable Join Processing on Very Large RDF Graphs. In SIGMOD, 2009
27. T. Neumann, and G. Weikum. The RDF-3X engine for scalable management of RDF data. VLDB J., 19(1):91-113, 2010.
28. M. Newman, and M. Girvan. Finding, and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
29. K. Rohloff, and R. E. Schantz. High-performance, massively scalable distributed systems using the MapReduce software framework: the SHARD triple-store. In PSI EtA, 2010.
30. B. Shao, H. Wang,, and Y. Li. The Trinity graph engine. Technical Report 161291, Microsoft Research, 2012.
31. B. Shao, H. Wang,, and Y. Xiao. Managing, and mining large graphs: Systems, and implementations. In SIGMOD, 2012.
32. M. Stocker, A. Seaborne, A. Bernstein, C. Kiefer,, and D. Reynolds. SPARQL basic graph pattern optimization using selectivity estimation. In WWW, 2008.
33. Z. Sun, H. Wang, H. Wang, B. Shao,, and J. Li. Efficient subgraph matching on billion node graphs. Proceedings of the VLDB Endowment, 5(9):788-799, 2012.
34. H. Wang, H. He, J. Yang, P. S. Yu,, and J. X. Yu. Dual Labeling: Answering Graph Reachability Queries in Constant Time. In ICDE, page 75, 2006.
35. C. Weiss, P. Karras,, and A. Bernstein. Hexastore: sextuple indexing for semantic web data management. PVLDB, 1(1):1008-1019, 2008.
36. K. Wilkinson, C. Sayers, H. A. Kuno,, and D. Reynolds. Efficient RDF Storage, and Retrieval in Jena2. In SWDB, pages 131-150, 2003.
37. W. Wu, H. Li, H. Wang,, and K. Zhu. Probase: A probabilistic taxonomy for text understanding. In SIGMOD, 2012.
38. S. Yang, X. Yan, B. Zong,, and A. Khan. Towards effective partition management for large graphs. In SIGMOD Conference, pages 517-528, 2012.
39. F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han,, and P. S. Yu. Mining top-k large structural patterns in a massive network. PVLDB, 4(11):807-818, 2011.
40. L. Zou, L. Chen,, and M. T. özsu. Distancejoin: Pattern match query in a large graph database. PVLDB, 2(1):886-897, 2009.