Zamansal sürümlendirilmiş doküman koleksiyonlarında paralel metin erişimi

In recent years, as the access to the Internet is getting easier andcheaper, the amount and the rate of change of the online datapresented to the Internet users are increasing at an astonishingrate. This ever-changing nature of the Internet causes anever-decaying and replenishing information collection where newlypresented data generally replaces old and sometimes valuable data.There are many recent studies aiming to preserve this valuabletemporal data and size and number of temporal Web data collectionsare increasing. We believe that soon, information retrieval systemsresponding to time-range queries in a reasonable amount of time willemerge as a means of accessing vast temporal Web data collections.Due to tremendous size of temporal data and excessive number ofquery submissions per unit time, temporal information retrievalsystems will have to utilize parallelism as much as possible.In parallel systems, in order to index collections using invertedindices, a strategy on distribution of the inverted indices has tobe followed. In this study, the feasibility of time-basedpartitioned versus term-based partitioned temporal-webinverted-indices is analyzed and a novel parallel text retrievalsystem for answering temporal web queries is implemented consideringthe number of queries processed in unit time. Moreover, weinvestigate the performance of skip-list based and randomized-selectbased ranking schemes on time-based and term-based partitionedinverted indexes. Finally, we compare time-balanced andsize-balanced time-based partitioning schemes. The experimentalresults at small to medium number of processors reveal that formedium to long length queries time-based partitioning works better.