Abstract
Similarity search in a large collection of stored objects in a metric database has become a most interesting problem. The Spaghettis is an efficient metric data structure to index metric spaces. However, for real applications, when processing large volumes of data, query response time can be high enough. In this case, it is necessary to apply mechanisms in order to significantly reduce the average query response time. In this sense, the parallelization of the metric structures processing is an interesting field of research. Modern multi-core and many-core systems offer a very impressive cost/performance ratio. In this paper two new parallel implementations for range queries on Spaghettis data structures have been carried out: one of them on a many-core processor and the other one on a multi-core processor. Both implementations have been compared in terms of execution time and speedup.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
