You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
351 lines
16 KiB
351 lines
16 KiB
// yacySearch.java
|
|
// -------------------------------------
|
|
// (C) by Michael Peter Christen; mc@yacy.net
|
|
// first published on http://www.anomic.de
|
|
// Frankfurt, Germany, 2004
|
|
//
|
|
// $LastChangedDate$
|
|
// $LastChangedRevision$
|
|
// $LastChangedBy$
|
|
//
|
|
// This program is free software; you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program; if not, write to the Free Software
|
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
package de.anomic.yacy;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.HashMap;
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
import java.util.TreeMap;
|
|
import java.util.regex.Pattern;
|
|
|
|
import net.yacy.kelondro.index.HandleSet;
|
|
import net.yacy.kelondro.logging.Log;
|
|
import net.yacy.kelondro.order.Bitfield;
|
|
import net.yacy.kelondro.util.ScoreCluster;
|
|
import net.yacy.repository.Blacklist;
|
|
|
|
import de.anomic.crawler.ResultURLs;
|
|
import de.anomic.search.QueryParams;
|
|
import de.anomic.search.RankingProfile;
|
|
import de.anomic.search.RankingProcess;
|
|
import de.anomic.search.SearchEvent;
|
|
import de.anomic.search.Segment;
|
|
import de.anomic.yacy.dht.PeerSelection;
|
|
|
|
public class yacySearch extends Thread {
|
|
|
|
private static final ThreadGroup ysThreadGroup = new ThreadGroup("yacySearchThreadGroup");
|
|
|
|
final private String wordhashes, excludehashes, urlhashes, sitehash, authorhash;
|
|
final private boolean global;
|
|
final private int partitions;
|
|
final private Segment indexSegment;
|
|
final private RankingProcess containerCache;
|
|
final private SearchEvent.SecondarySearchSuperviser secondarySearchSuperviser;
|
|
final private Blacklist blacklist;
|
|
final private yacySeed targetPeer;
|
|
private int urls;
|
|
private final int count, maxDistance;
|
|
final private RankingProfile rankingProfile;
|
|
final private Pattern prefer, filter;
|
|
final private String language;
|
|
final private Bitfield constraint;
|
|
final private yacySeedDB peers;
|
|
|
|
ResultURLs crawlResults;
|
|
|
|
public yacySearch(
|
|
final String wordhashes, final String excludehashes,
|
|
final String urlhashes,
|
|
final Pattern prefer, final Pattern filter,
|
|
final String language,
|
|
final String sitehash, final String authorhash,
|
|
final int count, final int maxDistance,
|
|
final boolean global, final int partitions,
|
|
final yacySeed targetPeer,
|
|
final Segment indexSegment,
|
|
final yacySeedDB peers,
|
|
final ResultURLs crawlResults,
|
|
final RankingProcess containerCache,
|
|
final SearchEvent.SecondarySearchSuperviser secondarySearchSuperviser,
|
|
final Blacklist blacklist,
|
|
final RankingProfile rankingProfile,
|
|
final Bitfield constraint) {
|
|
super(ysThreadGroup, "yacySearch_" + targetPeer.getName());
|
|
//System.out.println("DEBUG - yacySearch thread " + this.getName() + " initialized " + ((urlhashes.length() == 0) ? "(primary)" : "(secondary)"));
|
|
assert wordhashes.length() >= 12;
|
|
this.wordhashes = wordhashes;
|
|
this.excludehashes = excludehashes;
|
|
this.urlhashes = urlhashes;
|
|
this.prefer = prefer;
|
|
this.filter = filter;
|
|
this.language = language;
|
|
this.sitehash = sitehash;
|
|
this.authorhash = authorhash;
|
|
this.global = global;
|
|
this.partitions = partitions;
|
|
this.indexSegment = indexSegment;
|
|
this.peers = peers;
|
|
this.crawlResults = crawlResults;
|
|
this.containerCache = containerCache;
|
|
this.secondarySearchSuperviser = secondarySearchSuperviser;
|
|
this.blacklist = blacklist;
|
|
this.targetPeer = targetPeer;
|
|
this.urls = -1;
|
|
this.count = count;
|
|
this.maxDistance = maxDistance;
|
|
this.rankingProfile = rankingProfile;
|
|
this.constraint = constraint;
|
|
}
|
|
|
|
public void run() {
|
|
try {
|
|
this.urls = yacyClient.search(
|
|
peers.mySeed(),
|
|
wordhashes, excludehashes, urlhashes, prefer, filter, language,
|
|
sitehash, authorhash,
|
|
count, maxDistance, global, partitions,
|
|
targetPeer, indexSegment, crawlResults, containerCache, secondarySearchSuperviser,
|
|
blacklist, rankingProfile, constraint);
|
|
if (urls >= 0) {
|
|
// urls is an array of url hashes. this is only used for log output
|
|
//yacyCore.log.logInfo("REMOTE SEARCH - remote peer " + targetPeer.hash + ":" + targetPeer.getName() + " contributed " + urls.length + " links for word hash " + wordhashes + ": " + new String(urllist));
|
|
peers.mySeed().incRI(urls);
|
|
peers.mySeed().incRU(urls);
|
|
} else {
|
|
yacyCore.log.logInfo("REMOTE SEARCH - no answer from remote peer " + targetPeer.hash + ":" + targetPeer.getName());
|
|
}
|
|
} catch (final Exception e) {
|
|
Log.logException(e);
|
|
} finally {
|
|
containerCache.oneFeederTerminated();
|
|
}
|
|
}
|
|
|
|
public static String set2string(final HandleSet hashes) {
|
|
String wh = "";
|
|
final Iterator<byte[]> iter = hashes.iterator();
|
|
while (iter.hasNext()) { wh = wh + new String(iter.next()); }
|
|
return wh;
|
|
}
|
|
|
|
public int links() {
|
|
return this.urls;
|
|
}
|
|
|
|
public int count() {
|
|
return this.count;
|
|
}
|
|
|
|
public yacySeed target() {
|
|
return targetPeer;
|
|
}
|
|
|
|
private static yacySeed[] selectClusterPeers(final yacySeedDB seedDB, final TreeMap<byte[], String> peerhashes) {
|
|
final Iterator<Map.Entry<byte[], String>> i = peerhashes.entrySet().iterator();
|
|
final ArrayList<yacySeed> l = new ArrayList<yacySeed>();
|
|
Map.Entry<byte[], String> entry;
|
|
yacySeed s;
|
|
while (i.hasNext()) {
|
|
entry = i.next();
|
|
s = seedDB.get(new String(entry.getKey())); // should be getConnected; get only during testing time
|
|
if (s != null) {
|
|
s.setAlternativeAddress(entry.getValue());
|
|
l.add(s);
|
|
}
|
|
}
|
|
final yacySeed[] result = new yacySeed[l.size()];
|
|
for (int j = 0; j < l.size(); j++) {
|
|
result[j] = l.get(j);
|
|
}
|
|
return result;
|
|
//return (yacySeed[]) l.toArray();
|
|
}
|
|
|
|
private static yacySeed[] selectSearchTargets(final yacySeedDB seedDB, final HandleSet wordhashes, int seedcount, int redundancy) {
|
|
// find out a specific number of seeds, that would be relevant for the given word hash(es)
|
|
// the result is ordered by relevance: [0] is most relevant
|
|
// the seedcount is the maximum number of wanted results
|
|
if (seedDB == null) { return null; }
|
|
if ((seedcount >= seedDB.sizeConnected()) || (seedDB.noDHTActivity())) {
|
|
seedcount = seedDB.sizeConnected();
|
|
}
|
|
|
|
// put in seeds according to dht
|
|
final ScoreCluster<String> ranking = new ScoreCluster<String>();
|
|
final HashMap<String, yacySeed> regularSeeds = new HashMap<String, yacySeed>();
|
|
final HashMap<String, yacySeed> matchingSeeds = new HashMap<String, yacySeed>();
|
|
yacySeed seed;
|
|
Iterator<yacySeed> dhtEnum;
|
|
Iterator<byte[]> iter = wordhashes.iterator();
|
|
while (iter.hasNext()) {
|
|
PeerSelection.selectDHTPositions(seedDB, iter.next(), redundancy, regularSeeds, ranking);
|
|
}
|
|
|
|
// put in seeds according to size of peer
|
|
dhtEnum = seedDB.seedsSortedConnected(false, yacySeed.ICOUNT);
|
|
int c = Math.min(seedDB.sizeConnected(), seedcount);
|
|
int score;
|
|
while (dhtEnum.hasNext() && c > 0) {
|
|
seed = dhtEnum.next();
|
|
if (seed == null) continue;
|
|
if (!seed.getFlagAcceptRemoteIndex()) continue; // probably a robinson peer
|
|
score = (int) Math.round(Math.random() * ((c / 3) + 3));
|
|
if (Log.isFine("PLASMA")) Log.logFine("PLASMA", "selectPeers/RWIcount: " + seed.hash + ":" + seed.getName() + ", RWIcount=" + seed.getWordCount() + ", score " + score);
|
|
ranking.addScore(seed.hash, score);
|
|
regularSeeds.put(seed.hash, seed);
|
|
c--;
|
|
}
|
|
|
|
// put in seeds that are public robinson peers and where the peer tags match with query
|
|
// or seeds that are newbies to ensure that public demonstrations always work
|
|
dhtEnum = seedDB.seedsConnected(true, false, null, (float) 0.50);
|
|
while (dhtEnum.hasNext()) {
|
|
seed = dhtEnum.next();
|
|
if (seed == null) continue;
|
|
if (seed.matchPeerTags(wordhashes)) {
|
|
String specialized = seed.getPeerTags().toString();
|
|
if (!specialized.equals("[*]")) Log.logInfo("PLASMA", "selectPeers/PeerTags: " + seed.hash + ":" + seed.getName() + ", is specialized peer for " + specialized);
|
|
regularSeeds.remove(seed.hash);
|
|
ranking.deleteScore(seed.hash);
|
|
matchingSeeds.put(seed.hash, seed);
|
|
} else if (seed.getFlagAcceptRemoteIndex() && seed.getAge() < 1) { // the 'workshop feature'
|
|
Log.logInfo("PLASMA", "selectPeers/Age: " + seed.hash + ":" + seed.getName() + ", is newbie, age = " + seed.getAge());
|
|
regularSeeds.remove(seed.hash);
|
|
ranking.deleteScore(seed.hash);
|
|
matchingSeeds.put(seed.hash, seed);
|
|
}
|
|
}
|
|
|
|
// evaluate the ranking score and select seeds
|
|
seedcount = Math.min(ranking.size(), seedcount);
|
|
final yacySeed[] result = new yacySeed[seedcount + matchingSeeds.size()];
|
|
c = 0;
|
|
Iterator<String> iters = ranking.scores(false); // higher are better
|
|
while (iters.hasNext() && c < seedcount) {
|
|
seed = regularSeeds.get(iters.next());
|
|
seed.selectscore = c;
|
|
Log.logInfo("PLASMA", "selectPeers/_dht_: " + seed.hash + ":" + seed.getName() + " is choice " + c);
|
|
result[c++] = seed;
|
|
}
|
|
for (final yacySeed s: matchingSeeds.values()) {
|
|
s.selectscore = c;
|
|
Log.logInfo("PLASMA", "selectPeers/_match_: " + s.hash + ":" + s.getName() + " is choice " + c);
|
|
result[c++] = s;
|
|
}
|
|
|
|
// System.out.println("DEBUG yacySearch.selectPeers = " + seedcount + " seeds:"); for (int i = 0; i < seedcount; i++) System.out.println(" #" + i + ":" + result[i]); // debug
|
|
return result;
|
|
}
|
|
|
|
public static yacySearch[] primaryRemoteSearches(
|
|
final String wordhashes, final String excludehashes,
|
|
final Pattern prefer, final Pattern filter, String language,
|
|
final String sitehash,
|
|
final String authorhash,
|
|
final int count, final int maxDist,
|
|
final Segment indexSegment,
|
|
final yacySeedDB peers,
|
|
final ResultURLs crawlResults,
|
|
final RankingProcess containerCache,
|
|
final SearchEvent.SecondarySearchSuperviser secondarySearchSuperviser,
|
|
int targets,
|
|
final Blacklist blacklist,
|
|
final RankingProfile rankingProfile,
|
|
final Bitfield constraint,
|
|
final TreeMap<byte[], String> clusterselection) {
|
|
// check own peer status
|
|
//if (wordIndex.seedDB.mySeed() == null || wordIndex.seedDB.mySeed().getPublicAddress() == null) { return null; }
|
|
|
|
// prepare seed targets and threads
|
|
assert language != null;
|
|
assert wordhashes.length() >= 12 : "wordhashes = " + wordhashes;
|
|
final yacySeed[] targetPeers =
|
|
(clusterselection == null) ?
|
|
selectSearchTargets(
|
|
peers,
|
|
QueryParams.hashes2Set(wordhashes),
|
|
targets,
|
|
peers.redundancy())
|
|
: selectClusterPeers(peers, clusterselection);
|
|
if (targetPeers == null) return new yacySearch[0];
|
|
targets = targetPeers.length;
|
|
if (targets == 0) return new yacySearch[0];
|
|
final yacySearch[] searchThreads = new yacySearch[targets];
|
|
for (int i = 0; i < targets; i++) {
|
|
if (targetPeers[i] == null || targetPeers[i].hash == null) continue;
|
|
searchThreads[i] = new yacySearch(
|
|
wordhashes, excludehashes, "", prefer, filter, language,
|
|
sitehash, authorhash,
|
|
count, maxDist, true, targets, targetPeers[i],
|
|
indexSegment, peers, crawlResults, containerCache, secondarySearchSuperviser, blacklist, rankingProfile, constraint);
|
|
searchThreads[i].start();
|
|
}
|
|
return searchThreads;
|
|
}
|
|
|
|
public static yacySearch secondaryRemoteSearch(
|
|
final String wordhashes, final String urlhashes,
|
|
final Segment indexSegment,
|
|
final yacySeedDB peers,
|
|
final ResultURLs crawlResults,
|
|
final RankingProcess containerCache,
|
|
final String targethash, final Blacklist blacklist,
|
|
final RankingProfile rankingProfile,
|
|
final Bitfield constraint, final TreeMap<byte[], String> clusterselection) {
|
|
assert wordhashes.length() >= 12 : "wordhashes = " + wordhashes;
|
|
|
|
// check own peer status
|
|
if (peers.mySeed() == null || peers.mySeed().getPublicAddress() == null) { return null; }
|
|
assert urlhashes != null;
|
|
assert urlhashes.length() > 0;
|
|
|
|
// prepare seed targets and threads
|
|
final yacySeed targetPeer = peers.getConnected(targethash);
|
|
if (targetPeer == null || targetPeer.hash == null) return null;
|
|
if (clusterselection != null) targetPeer.setAlternativeAddress(clusterselection.get(targetPeer.hash.getBytes()));
|
|
final yacySearch searchThread = new yacySearch(
|
|
wordhashes, "", urlhashes, Pattern.compile(""), Pattern.compile(".*"), "", "", "", 0, 9999, true, 0, targetPeer,
|
|
indexSegment, peers, crawlResults, containerCache, null, blacklist, rankingProfile, constraint);
|
|
searchThread.start();
|
|
return searchThread;
|
|
}
|
|
|
|
public static int remainingWaiting(final yacySearch[] searchThreads) {
|
|
if (searchThreads == null) return 0;
|
|
int alive = 0;
|
|
for (int i = 0; i < searchThreads.length; i++) {
|
|
if (searchThreads[i].isAlive()) alive++;
|
|
}
|
|
return alive;
|
|
}
|
|
|
|
public static int collectedLinks(final yacySearch[] searchThreads) {
|
|
int links = 0;
|
|
for (int i = 0; i < searchThreads.length; i++) {
|
|
if (!(searchThreads[i].isAlive()) && searchThreads[i].urls > 0) links += searchThreads[i].urls;
|
|
}
|
|
return links;
|
|
}
|
|
|
|
public static void interruptAlive(final yacySearch[] searchThreads) {
|
|
for (int i = 0; i < searchThreads.length; i++) {
|
|
if (searchThreads[i].isAlive()) searchThreads[i].interrupt();
|
|
}
|
|
}
|
|
|
|
}
|