Skip to main content
SpringerLink
Log in

On how to merge sorted lists coming from different web search tools

  • Original paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

 Different web search tools often complement each other. So, if we want to have a good coverage of all relevant web items, a reasonable strategy is to use different search tools and them merge the resulting lists. How to merge them? In this paper, we describe reasonable axioms for the merging procedure and describe all mergings that satisfy these reasonable axioms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Machine Intelligence Institute, Iona College, 715 North Avenue, New Rochelle, NY 10801-18903, USA, , , , , , US

    R. R. Yager

  2. Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA, , , , , , US

    V. Kreinovich

Authors
  1. R. R. Yager
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Kreinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yager, R., Kreinovich, V. On how to merge sorted lists coming from different web search tools. Soft Computing 3, 83–88 (1999). https://doi.org/10.1007/s005000050056

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s005000050056

Keywords

Search

Navigation