ROS: run-time optimization of SPARQL queries

  • Authors:
  • Liuqing Li;Xin Wang;Xiansen Meng;Zhiyong Feng

  • Affiliations:
  • School of Computer Science and Technology, Tianjin University, Tianjin, China;School of Computer Science and Technology, Tianjin University, Tianjin, China;School of Computer Science and Technology, Tianjin University, Tianjin, China;School of Computer Science and Technology, Tianjin University, Tianjin, China

  • Venue:
  • WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The optimization effect on large-scale RDF data is not statisfactory using the existing algorithms based on cost models. This paper presents the Run-time Optimization of SPARQL queries (ROS), and describes the join graphs and the index structures for SPARQL queries that are foundations of the ROS approach. The ROS algorithm, without cost models, intertwines cost estimation and query optimization into the execution procedure, and determines query plans in run time. Our experiments using the SP2Bench benchmark show that ROS can select the best query plan and improve query efficiency dramatically compared with the existing approaches.