Empirical evaluation of strategies to process range queries of numeric sequences in batch-mode

Luiz F. A. BritoMarcelo K. Albertini

Tree structures are largely used to index and search sequences onsecondary memory. In some situations, many range queries are processed almostsimultaneously and the resulting number of disk accesses can be high. In orderto reduce the number of disk accesses, similar sequences can be grouped andspanned as a single query. A simple strategy is to unify all sequences into a singlegroup. However, other strategies for grouping sequences can also be used. In thispaper, we present and empirical evaluation of 5 common grouping strategies forR-trees and M -trees. Our results indicate that for inputs modelled as a randomwalk distribution the overall best implemented strategy for grouping queries isindeed the one unifying all queries in a single group.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: