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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
