Project Leader
Josep L. Larriba (larri@ac.upc.es) Project Members
Daniel Jimenez (djimenez@ac.upc.es) Juan J. Navarro (juanjo@ac.upc.es)
Project description
This project deals with the design and evaluation of parallel database algorithms. The aim of this project is to show how locality exploitation can improve the execution of database algorithms specially for in-core text databases. Our first approach has been related to sorting in-core algorithms which are a key point in many database areas and specially in text retrieval. We have proposed an algorithm based on Radix sort which reduces the communication in the number of steps and amount of data communicated. Both issues are achieved by increasing the locality of the algorithm and making a dynamic reasignation of processors respectively. Our results show that our algorithm reduces the execution time of our algorithm to a third of the previous fastest sorting algorithm. Another important achievement of our algorithm is the exploitation of locality at the memory hierarchy level. This reduces the execution time of our algorithm to half the fastest sequential algorithm.