The application of Semantic Web technologies in an Electronic Commerce environment implies a need for good support tools. Fast query engines are required for efficient real-time querying of large amounts of data, usually represented using RDF. We focus on optimizing a special class of SPARQL queries: RDF chain queries. We devise a genetic algorithm, RCQ-GA, that determines the order in which joins need to be performed for an efficient evaluation of RDF chain queries. The approach is benchmarked against a two-phase optimization algorithm, previously proposed in literature. The more complex a query is, the more RCQ-GA outperforms the benchmark in solution quality, execution time needed, and consistency of solution quality. When the algorithms are constrained by a time limit, the overall performance of RCQ-GA compared to the benchmark improves even further.
|Title of host publication||Proceedings of the Twenty-First Benelux Conference on Artificial Intelligence|
|Editors||T. Calders, K. Tuyls, M. Pechenizkiy|
|Place of Publication||Eindhoven, The Netherlands|
|Number of pages||2|
|Publication status||Published - 29 Oct 2009|