Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Heuristic and randomized optimization for the join ordering problem
The VLDB Journal — The International Journal on Very Large Data Bases
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
RAL: An Algebra for Querying RDF
World Wide Web
Fundamentals of Database Systems, Fourth Edition
Fundamentals of Database Systems, Fourth Edition
Towards distributed processing of RDF path queries
International Journal of Web Engineering and Technology
RCQ-GA: RDF Chain Query Optimization Using Genetic Algorithms
EC-Web 2009 Proceedings of the 10th International Conference on E-Commerce and Web Technologies
Finding the achilles heel of the web of data: using network analysis for link-recommendation
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
In order to effectively and efficiently disclose the ever-growing amount of widely distributed RDF data to demanding users in real-time environments, RDF query engines need to optimize the join order of partial query results. For this, a two-phase optimization (2PO) algorithm and a genetic algorithm (GA) have already been proposed. We propose an alternative approach - an ant colony system (ACS). On a large RDF data source, our approach significantly outperforms both 2PO and the GA in terms of execution time and solution quality for RDF chain queries consisting of up to about ten joins. For larger queries, our novel ACS delivers solutions of better quality than 2PO does, while realizing a solution quality that is comparable to the solution quality of the GA method. However, the GA approach offers the best trade-off between execution time and solution quality for such larger queries.