Searching and Updating Metric Space Databases Using the Parallel EGNAT

Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It allows searching for similar objects represented in metric spaces. The sequential EGNAT has been shown to achieve good performance in high-dimensional metric spaces with properties (not found in others of the same kind) of allowing update operations and efficient use of secondary memory. Thus, for example, it is suitable for indexing large multimedia databases. However, comparing two objects during a search can be a very expensive operation in terms of running time. This paper shows that parallel computing upon clusters of PCs can be a practical solution for reducing running time costs. We describe alternative distributions for the EGNAT index and their respective parallel search/update algorithms and concurrency control mechanism 4 .

• Type: Conference
• Year: 2007
• Where: ICCS
• Authors: Mauricio Marín, Roberto Uribe, Ricardo J. Barrientos
• Keywords: ICCS 2007, Indexing Large Collections, Indexing Large Multimedia, Metric Spaces