Memory resident parallel inverted index construction
Author
Küçükyılmaz, Tayfun
Türk, Ata
Aykanat, Cevdet
Date
2012Source Title
Computer and Information Sciences II
Publisher
Springer, London
Pages
99 - 105
Language
English
Item Usage Stats
179
views
views
151
downloads
downloads
Abstract
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.
Keywords
64-bit architecturesCommunication overheads
Global index
Inverted indices
Memory-resident
Parallel framework
Communication
Information science
Random access storage
Cost reduction
Permalink
http://hdl.handle.net/11693/28083Published Version (Please cite this version)
https://doi.org/10.1007/978-1-4471-2155-8_12https://doi.org/10.1007/978-1-4471-2155-8