Abstract
With a rapid growth in the available resource description framework (RDF) data from disparate domains, the SPARQL query processing with graph structures has become increasingly important. In this pursuit, we designed a two-phase SPARQL query optimization method to process the SPARQL query. The structural characteristics of RDF data graphs, predicate path sequence indices (PPS-indices), were used to efficiently prune the search space, which captured the inherent features of the RDF data graphs, while the database is updated. Our storage model was based on a relational database. Compared to a baseline solution, the proposed method effectively reduced the cardinalities of the intermediate results during the query processing, and at least an order of magnitude improvement is achieved in filtering performance, thereby improving the efficiency of the query execution.
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.
