Cambazoğlu, B. BarlaÇatal, A.Aykanat, Cevdet2016-02-082016-02-082006-110302-9743http://hdl.handle.net/11693/27280Date of Conference: 1-3 November, 200621th International Symposium on Computer and Information Sciences – ISCIS 2006Shared-nothing, parallel text retrieval systems require an inverted index, representing a document collection, to be partitioned among a number of processors. In general, the index can be partitioned based on either the terms or documents in the collection, and the way the partitioning is done greatly affects the query processing performance of the parallel system. In this work, we investigate the effect of these two index partitioning schemes on query processing. We conduct experiments on a 32-node PC cluster, considering the case where index is completely stored in disk. Performance results are reported for a large (30 GB) document collection using an MPI-based parallel query processing implementation. © Springer-Verlag Berlin Heidelberg 2006.EnglishData processingInformation retrievalMagnetic disk storageParallel processing systemsProgram processorsQuery languagesText processingDocument collectionIndex partitioning schemesInverted index partitioningParallel text retrieval systemsIndexing (of information)Conference Paper10.1007/11902140_75