2021Unpublished venueRequires access

In-Depth Métan- Search Engine

Mourad Belabed, Dennai Abdeslam

Open publisher page 1 citations

Abstract

The use of search engines is one of the most popular online activities. In addition, users generally receive good results and relatively high confidence in the ability of search engines.The primary objective of this paper is to provide a model for researching and collecting web pages and relevant information at the user’s request.Sometimes when a search query is sent by a user, the use of several search engines creates a difference in the search results on the one hand and a wealth of quality and the quantity of these results at the same time.Experts in this field have confirmed that the relevant search results obtained from a meta-search engine has made substantial progress.In order to improve these meta-search engines, we propose a new model by detailing and optimizing the results of a metasearch (the search for a search) by the duplicate of the search in a precise way and by dissecting a result in several search results until exhaustion of this research search.Repeating this search of search gives birth to a new concept that is «Métan-Search».

About this research paper

What this paper is about

The use of search engines is one of the most popular online activities. In addition, users generally receive good results and relatively high confidence in the ability of search engines.The primary objective of this paper is to provide a model for researching and collecting web pages and relevant information at the user’s request.Sometimes when a search query is sent by a user, the use of several search engines creates a difference in the search results on the one hand and a wealth of quality and the quantity of these results at the same time.Experts in this field have confirmed that the relevant search results obtained from a meta-search engine has made substantial progress.In order to improve these meta-search engines, we propose a new model by detailing and optimizing the results of a metasearch (the search for a search) by the duplicate of the search in a precise way and by dissecting a result in several search results until exhaustion of this research search.Repeating this search of search gives birth to a new concept that is «Métan-Search».

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The use of search engines is one of the most popular online activities. In addition, users generally receive good results and relatively high confidence in the ability of search engines.The primary objective of this paper is to provide a model for researching and collecting web pages and relevant information at the user’s request.Sometimes when a search query is sent by a user, the use of several search engines creates a difference in the search results on the one hand and a wealth of quality and the quantity of these results at the same time.Experts in this field have confirmed that the relevant search results obtained from a meta-search engine has made substantial progress.In order to improve these meta-search engines, we propose a new model by detailing and optimizing the results of a metasearch (the search for a search) by the duplicate of the search in a precise way and by dissecting a result in several search results until exhaustion of this research search.Repeating this search of search gives birth to a new concept that is «Métan-Search».

Key concepts: Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
In-Depth Métan- Search Engine — Research Paper | ScholarLens