We introduce an adaptation of the RLC metric data structure to secondary memory. RLC is generic, dynamic, and efficient when compared with other metric data structures implemented in main memory, where performance is analysed only in terms of the number of distance computations. In this work, the experimental study compares RLC with three data structures implemented in secondary memory, comprises two dictionaries and two sets of images, and evaluates both the number of distance computations and the number of I/O operations performed. The results show that RLC is very efficient for range queries and very competitive for insertions.
|Title of host publication||INFORUM|
|Publisher||Universidade do Minho|
|Publication status||Published - 1 Jan 2010|
|Event||INForum - Simpósio de Informática - |
Duration: 1 Jan 2010 → …
|Conference||INForum - Simpósio de Informática|
|Period||1/01/10 → …|