Searching and Updating Metric Space Databases Using the Parallel EGNAT

  • Mauricio Marin
  • Roberto Uribe
  • Ricardo Barrientos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4487)


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.


Query Processing Distance Calculation Range Query Query Object Secondary Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixedqueries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, Springer, Heidelberg (1994)Google Scholar
  2. 2.
    Brin, S.: Near neighbor search in large metric spaces. In: The 21st VLDB Conference (1995)Google Scholar
  3. 3.
    Burkhard, W., Keller, R.: Some approaches to best-match file searching. Communication of ACM (1973)Google Scholar
  4. 4.
    Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: The 23st International Conference on VLDB (1997)Google Scholar
  5. 5.
    Navarro, G., Reyes, N.: Fully dynamic spatial approximation trees. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 254–270. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Traina Jr., C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-trees: High performance metric trees minimizing overlap between nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, p. 51. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Uribe, R., Navarro, G., Barrientos, R.J., Marín, M.: An index data structure for searching in metric space databases. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 611–617. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Uhlmann, J.: Satisfying general proximity/similarity queries with Metric Trees. Information Processing Letters (1991)Google Scholar
  9. 9.
    Valiant, L.G.: A bridging model for parallel computation. Comm. ACM (1990)Google Scholar
  10. 10.
    Yianilos, P.: Data structures and algoritms for nearest neighbor search in general metric spaces. In: 4th ACM-SIAM Symposium on Discrete Algorithms (1993)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Mauricio Marin
    • 1
    • 2
  • Roberto Uribe
    • 2
  • Ricardo Barrientos
    • 2
  1. 1.Yahoo! Research, SantiagoChile
  2. 2.DCC, University of MagallanesChile

Personalised recommendations