Memory resident parallel inverted index construction
Computer and Information Sciences II - 26th International Symposium on Computer and Information Sciences, ISCIS 2011
99 - 105
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28083
Advances in cloud computing, 64-bit architectures and huge RAMs enable performing many search related tasks in memory.We argue that term-based partitioned parallel inverted index construction is among such tasks, and provide an efficient parallel framework that achieves this task. We show that by utilizing an efficient bucketing scheme we can eliminate the need for the generation of a global index and reduce the communication overhead without disturbing balancing constraint. We also propose and investigate assignment schemes that can further reduce communication overheads without disturbing balancing constraints. The conducted experiments indicate promising results. © 2012 Springer-Verlag London Limited.