Runtime characterisation of triple stores: An initial investigation

The Semantic Web is considered a data integration system for different content and applications, in which every item has a specified meaning that machines can understand and process without the intervention of a human. Triple stores are the backbone of this "web of data", allowing storage and retrieval of semi-structured data as linked data usually formatted as RDF. Although there have been attempts at benchmarking the response times and query throughput of individual triple stores, there has been no systematic study of the impact of query implementation in terms of performance. In this work, we analyze the general querying process of popular triple stores and construct and measure some core metrics. Using LUBM, we choose three queries to perform experiments on a standard server and report on detailed experimental results. These results will be useful in designing future distributed systems and optimizing architectures for RDF data processing.