On how to merge sorted lists coming from different web search tools
Author(s) -
Ronald R. Yager,
Vladik Kreinovich
Publication year - 1999
Publication title -
soft computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.626
H-Index - 81
eISSN - 1433-7479
pISSN - 1432-7643
DOI - 10.1007/s005000050056
Subject(s) - merge (version control) , computer science , information retrieval , axiom , web crawler , world wide web , theoretical computer science , data mining , mathematics , geometry
Different web search tools often complement each other. So, if we wantto have a good coverage of all relevant web items, a reasonable strategyis to use different search tools and then merge the resulting lists. How tomerge them? In this paper, we describe reasonable axioms for the mergingprocedure and describe all mergings that satisfy these reasonable axioms.1 IntroductionCurrently, the World Wide Web contains a great amount of (often poorly organized)information. To get the...
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom