Abstract
In this paper we present an approach based on genetic algorithms for determining optimal RDF query paths. The performance of this approach is benchmarked against the performance of a two-phase optimization algorithm. For more complex queries, the genetic algorithm RDFGA generally outperforms two-phase optimization in solution quality, execution time needed, and consistency in performance. Setting a time limit improves the overall performance of RDFGA compared to two-phase optimization even more.
Original language | English |
---|---|
Title of host publication | Proceedings of the First International Workshop on Nature Inspired Reasoning for the Semantic Web |
Editors | C. Guéret, P. Hitzler, S. Schlobach |
Place of Publication | Karlsruhe, Germany |
Pages | 16-30 |
Publication status | Published - 2008 |