SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval Pages 206 - 213
en_US
Identifier
dc.identifier.other
Doi:10.1007/978-3-642-03784-9-20
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/125944
Abstract
dc.description.abstract
Term-partitioned indexes are generally inefficient for the evaluation
of conjunctive queries, as they require the communication of long
posting lists. On the other side, document-partitioned indexes incur in
excessive overheads as the evaluation of every query involves the participation
of all the processors, therefore their scalability is not adequate
for real systems. We propose to arrange a set of processors in
a two-dimensional array, applying term-partitioning at row level and
document-partitioning at column level. Choosing the adequate number
of rows and columns given the available number of processors, together
with the selection of the proper ways of partitioning the index over that
topology is the subject of this paper