ImprovingWeb Searches with Distributed Buckets Structures

Author

Costa, V. Gil ; Printista, A.M. ; Marín, M.

Author_Institution

Dept. of Comput. Sci., San Luis Univ.

fYear

2006

fDate

Oct. 2006

Firstpage

119

Lastpage

126

Abstract

This article compares several strategies for searching in Web engines and we present the bucket algorithms to improve the efficiency of a classical index data structure for parallel textual database. We use the inverted files as the data structure and the vector space model to perform the ranking of documents. The main interest is the queries parallel processing on a cluster of PCs, and therefore this paper is focused in the communication and synchronization optimization. The design of the server that processes the queries, is effected on top of the bulk synchronous-BSP model of parallel computing, to study how query performance is affected by the index organization

Keywords

Internet; data structures; database indexing; full-text databases; parallel databases; query processing; search engines; synchronisation; Web engine search; Web information retrieval; bulk synchronous-BSP model; communication optimization; distributed buckets structures; document ranking; index data structure; inverted files; parallel textual database; queries parallel processing; server design; synchronization optimization; vector space model; Costs; Data structures; Databases; Indexing; Information retrieval; Parallel processing; Performance analysis; Query processing; Search engines; Web search;

fLanguage

English

Publisher

ieee

Conference_Titel

Web Congress, 2006. LA-Web '06. Fourth Latin American

Conference_Location

Cholula

Print_ISBN

0-7695-2693-4

Type

conf

DOI

10.1109/LA-WEB.2006.18

Filename

4022101