Advertisement

Scalable RDF Path Query Processing Based on Runtime Class Path Lookup Scheme

  • Sung-Jae JungEmail author
  • Dong-min Seo
  • Seungwoo Lee
  • Hanmin Jung
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 274)

Abstract

With the rapidly growing amount of information represented in RDF format, efficient querying RDF graph has become a fundamental challenge. There have been several relationship finding services based on querying RDF database to discover relationships between two objects of interest. Conventional relationship-finding service requires computationally expensive graph search operations which involve multiple self joins. It becomes even more challenging when the graph data is large and diverse. In this paper we propose an algorithm which uses RDF schema information for efficient RDF path query processing. By utilizing the pre-calculated class path expressions, the graph search space is significantly reduced. Compared with the conventional BFS algorithm, the proposed algorithm (bidirectional BFS combined with class path lookup approach) achieves performance improvement by 3 orders of magnitude. Additionally, the proposed algorithm is scalable, because it operates based on B-Tree index when it accesses to triple repository and pre-calculated class path information. Thus, the proposed algorithm is expected to return graph search results within a reasonable response time on even much larger RDF graph.

Keywords

RDF schema path expression SQL based graph search RDF path query class path pre-calculation bidirectional Breadth First Search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Huang, J., Abadi, D., Ren, K.: Scalable SPARQL querying of large RDF graphs. Proceedings of the VLDB Endowment (2011)Google Scholar
  2. 2.
    Heim, P., Hellmann, S., Lehmann, J., Lohmann, S., Stegemann, T.: RelFinder: Revealing relationships in RDF knowledge bases. In: Chua, T.-S., Kompatsiaris, Y., Mérialdo, B., Haas, W., Thallinger, G., Bailer, W. (eds.) SAMT 2009. LNCS, vol. 5887, pp. 182–187. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Seo, D., Koo, H.K., Lee, S., Kim, P., Jung, H., Sung, W.-K.: Efficient finding relationship between individuals in a mass ontology database. In: Kim, T.-H., Adeli, H., Ma, J., Fang, W.-C., Kang, B.-H., Park, B., Sandnes, F.E., Lee, K.C. (eds.) UNESST 2011. CCIS, vol. 264, pp. 281–286. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 4.
    Abadi, D., Marcus, A.: Scalable semantic web data management using vertical partitioning. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB 2007, pp. 411–422 (2007)Google Scholar
  5. 5.
    Melton, J., Simon, A.R.: SQL: 1999 - Understanding Relational Language ComponentsGoogle Scholar
  6. 6.
    Guo, Y., Pan, Z., Heflin, J.: LUBM: A benchmark for OWL knowledge base systems. Web Semantics Science Services and Agents on the World Wide Web 3(2-3), 158–182 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Sung-Jae Jung
    • 1
    • 2
    Email author
  • Dong-min Seo
    • 1
  • Seungwoo Lee
    • 1
  • Hanmin Jung
    • 1
    • 2
  1. 1.Department of Computer Intelligence ResearchKorea Institute of Science and Technology Information (KISTI)DaejeonKorea
  2. 2.Department of Knowledge and Inforamtion ScienceUniversity of Science and Technology (UST)DaejeonKorea

Personalised recommendations