In this paper, we address the efficiency of implementing the tf x idf ranking strategy with inverted files. Two search methods are studied. The first one sorts postings lists of query terms based upon the list length. It is the traditional sorting method used in the upperbound search algorithm. The second one sorts postings lists based upon the maximum tf as well as the list length. We show tha...

As the amount of information stored on the web increases at an amazing pace, it gets harder for search engines to retrieve the needed information. Recently, attention in the web community has focused on the use of hyperlinks to help index and organize information. Several methods have been suggested to take account of the knowledge induced by hyperlinks, with different objectives in mind. In th...

The PageRank is a notion used by search engines to reflect a popularity and importance of a page based on its citation ranking. Such ranking was first introduced in 1998 by Google search engine [4]. The PageRank of a page i reflects the importance of this page basing on: 1) how many pages link to i, and 2) how important are the pages that link to i. Since the web changes very fast, the PageRank...

As the amount of information stored on the web increases at an amazing pace, it gets harder for search engines to retrieve the needed information. Recently, attention in the web community has focused on the use of hyperlinks to help index and organize information. Several methods have been suggested to take account of the knowledge induced by hyperlinks, with different objectives in mind. In th...

We propose a new method to rank a special category of time-sensitive queries that are year qualified. The method adjusts the retrieval scores of a base ranking function according to time-stamps of web documents so that the freshest documents are ranked higher. Our method, which is based on feedback control theory, uses ranking errors to adjust the search engine behavior. For this purpose, we us...

Phrase query evaluation is an important task of every search engine. Optimizing the query evaluation time for phrase queries is the biggest threat for the current search engine. Usually, phrase queries are a hassle for standard indexing techniques. This is generally because, merging the posting lists and checking the word ordering takes a lot of time. This paper proposes a new technique called ...

This paper details the participation of the Australian eHealth Research Centre (AEHRC) in the ShARe/CLEF 2013 eHealth Evaluation Lab – Task 3. This task aims to evaluate the use of information retrieval (IR) systems to aid consumers (e.g. patients and their relatives) in seeking health advice on the Web. Our submissions to the ShARe/CLEF challenge are based on language models generated from the...

In web search, latent semantic models have been proposed to bridge the lexical gap between queries and documents that is due to the fact that searchers and content creators often use different vocabularies and language styles to express the same concept. Modern search engines simply use the outputs of latent semantic models as features for a so-called global ranker. We argue that this is not op...

Today, with the presence of digital technology, UMKM actors in Indonesia have numerous opportunities to create job and expand their businesses global market. However, not all sufficient understanding knowledge current technology being used. This research aims design a system that can assist increasing product sales volume by developing an effective efficient web-based application for selecting ...

Search engines results pages (SERPs) for a specific query are constructed according to several mechanisms. One of them consists in ranking Web pages regarding their importance, regardless of their semantic. Indeed, relevance to a query is not enough to provide high quality results, and popularity is used to arbitrate between equally relevant Web pages. The most well-known algorithm that ranks W...