In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Abstract. We consider query execution strategies for object-oriented distributed databases. There are several scenarios of query decomposition, assuming that the corresponding quer...
Hanna Kozankiewicz, Krzysztof Stencel, Kazimierz S...
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...