Genetic algorithms for RDF chain query optimization

A.C. Hogenboom, D.V. Milea, F. Frasincar, U. Kaymak

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


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.
Original languageEnglish
Title of host publicationProceedings of the 21st Benelux Conference on Artificial Intelligence (BNAIC 2009, Eindhoven, The Netherlands, October 29-30, 2009)
EditorsT. Calders, K. Tuyls, M. Pechenizkiy
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Publication statusPublished - 2009
Event21st Benelux Conference on Artificial Intelligence (BNAIC 2009) - Eindhoven, Netherlands
Duration: 29 Oct 200930 Oct 2009
Conference number: 21


Conference21st Benelux Conference on Artificial Intelligence (BNAIC 2009)
Abbreviated titleBNAIC 2009
OtherThe 21st Benelux Conference on Artificial Intelligence (BNAIC 2009)


Dive into the research topics of 'Genetic algorithms for RDF chain query optimization'. Together they form a unique fingerprint.

Cite this