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.
|Title of host publication
|Proceedings of the First International Workshop on Nature Inspired Reasoning for the Semantic Web
|C. Guéret, P. Hitzler, S. Schlobach
|Place of Publication
|Number of pages
|Published - 27 Oct 2008
- EUR ESE 32