2 citations · 2 across the 1 of their papers we have counts for
3 papers
Can the Optimizer Cost be Used to Predict Query Execution Times?
Anthony Kleerekoper, Javier Navaridas, Mikel Lujan
Predicting the execution time of queries is an important problem with applications in scheduling, service level agreements and error detection. During query planning, a cost is ass…
Breadth First Search Vectorization on the Intel Xeon Phi
Mireya Paredes, Graham Riley, Mikel Lujan
Breadth First Search (BFS) is a building block for graph algorithms and has recently been used for large scale analysis of information in a variety of applications including social…
Towards co-designed optimizations in parallel frameworks: A MapReduce case study
Colin Barrett, Christos Kotselidis, Mikel Luján
The explosion of Big Data was followed by the proliferation of numerous complex parallel software stacks whose aim is to tackle the challenges of data deluge. A drawback of a such…