mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
daf0f74361
search profiling showed, that a major amount of time is wasted by computing url hashes. The computation does an intranet-check, which needs a DNS lookup. This caused that each urlhash computation needed 100-200 milliseconds, which caused remote searches to delay at least 1 second more that necessary. The solution to this problem is to attach a URL hash to the URL data structure, because that means that the url hash value can be filled after retrieval of the URL from the database. The redesign of the url/urlhash management caused a major redesign of many parts of the software. Since some parts had been decided to be given up they had been removed during this change to avoid unnecessary maintenance of unused code. git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@4074 6c8d7289-2bf4-0310-a012-ef5d649a1542
177 lines
7.7 KiB
Java
177 lines
7.7 KiB
Java
// WebStructurePicture.java
|
|
// (C) 2007 by Michael Peter Christen; mc@anomic.de, Frankfurt a. M., Germany
|
|
// first published 22.05.2007 on http://yacy.net
|
|
//
|
|
// This is a part of YaCy, a peer-to-peer based web search engine
|
|
//
|
|
// $LastChangedDate: 2006-04-02 22:40:07 +0200 (So, 02 Apr 2006) $
|
|
// $LastChangedRevision: 1986 $
|
|
// $LastChangedBy: orbiter $
|
|
//
|
|
// LICENSE
|
|
//
|
|
// 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
|
|
|
|
import java.net.MalformedURLException;
|
|
import java.util.ArrayList;
|
|
import java.util.Date;
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
|
|
import de.anomic.http.httpHeader;
|
|
import de.anomic.kelondro.kelondroBase64Order;
|
|
import de.anomic.plasma.plasmaSwitchboard;
|
|
import de.anomic.plasma.plasmaWebStructure;
|
|
import de.anomic.server.serverObjects;
|
|
import de.anomic.server.serverSwitch;
|
|
import de.anomic.yacy.yacyURL;
|
|
import de.anomic.ymage.ymageGraph;
|
|
import de.anomic.ymage.ymageMatrix;
|
|
import de.anomic.ymage.ymageToolPrint;
|
|
|
|
public class WebStructurePicture_p {
|
|
|
|
private static final double maxlongd = (double) Long.MAX_VALUE;
|
|
|
|
public static ymageMatrix respond(httpHeader header, serverObjects post, serverSwitch env) {
|
|
plasmaSwitchboard sb = (plasmaSwitchboard) env;
|
|
|
|
int width = 768;
|
|
int height = 576;
|
|
int depth = 3;
|
|
int nodes = 100; // maximum number of host nodes that are painted
|
|
int time = -1;
|
|
String host = null;
|
|
|
|
if (post != null) {
|
|
width = post.getInt("width", 768);
|
|
height = post.getInt("height", 576);
|
|
depth = post.getInt("depth", 3);
|
|
nodes = post.getInt("nodes", width * height * 100 / 768 / 576);
|
|
time = post.getInt("time", -1);
|
|
host = post.get("host", null);
|
|
}
|
|
|
|
//too small values lead to an error, too big to huge CPU/memory consumption, resulting in possible DOS.
|
|
if (width < 32 ) width = 32;
|
|
if (width > 1920) width = 1920;
|
|
if (height < 24) height = 24;
|
|
if (height > 1920) height = 1920;
|
|
if (depth > 8) depth = 8;
|
|
if (depth < 0) depth = 0;
|
|
|
|
// calculate target time
|
|
long timeout = (time < 0) ? Long.MAX_VALUE : System.currentTimeMillis() + (time * 8 / 10);
|
|
|
|
// find start point
|
|
if ((host == null) || (host.length() == 0) || (host.equals("auto"))) {
|
|
// find domain with most references
|
|
host = sb.webStructure.hostWithMaxReferences();
|
|
}
|
|
ymageMatrix graphPicture;
|
|
if (host == null) {
|
|
// probably no information available
|
|
graphPicture = new ymageMatrix(width, height, ymageGraph.color_back);
|
|
graphPicture.setMode(ymageMatrix.MODE_SUB);
|
|
ymageToolPrint.print(graphPicture, width / 2, height / 2, 0, "NO WEB STRUCTURE DATA AVAILABLE.", 0);
|
|
ymageToolPrint.print(graphPicture, width / 2, height / 2 + 16, 0, "START A WEB CRAWL TO OBTAIN STRUCTURE DATA.", 0);
|
|
} else {
|
|
// find start hash
|
|
String hash = null;
|
|
try {
|
|
hash = (new yacyURL("http://" + host, null)).hash().substring(6);
|
|
} catch (MalformedURLException e) {e.printStackTrace();}
|
|
assert (sb.webStructure.references(hash) != null);
|
|
|
|
// recursively find domains, up to a specific depth
|
|
ymageGraph graph = new ymageGraph();
|
|
if (host != null) place(graph, sb.webStructure, hash, host, nodes, timeout, 0.0, 0.0, 0, depth);
|
|
//graph.print();
|
|
|
|
graphPicture = graph.draw(width, height, 40, 40, 16, 16);
|
|
}
|
|
// print headline
|
|
graphPicture.setColor(ymageGraph.color_text);
|
|
graphPicture.setMode(ymageMatrix.MODE_SUB);
|
|
ymageToolPrint.print(graphPicture, 2, 8, 0, "YACY WEB-STRUCTURE ANALYSIS", -1);
|
|
if (host != null) ymageToolPrint.print(graphPicture, 2, 16, 0, "LINK ENVIRONMENT OF DOMAIN " + host.toUpperCase(), -1);
|
|
ymageToolPrint.print(graphPicture, width - 2, 8, 0, "SNAPSHOT FROM " + new Date().toString().toUpperCase(), 1);
|
|
|
|
return graphPicture;
|
|
|
|
}
|
|
|
|
private static final int place(ymageGraph graph, plasmaWebStructure structure, String centerhash, String centerhost, int maxnodes, long timeout, double x, double y, int nextlayer, int maxlayer) {
|
|
// returns the number of nodes that had been placed
|
|
assert centerhost != null;
|
|
ymageGraph.coordinate center = graph.getPoint(centerhost);
|
|
int mynodes = 0;
|
|
if (center == null) {
|
|
center = graph.addPoint(centerhost, x, y, nextlayer);
|
|
maxnodes--;
|
|
mynodes++;
|
|
}
|
|
if (nextlayer == maxlayer) return mynodes;
|
|
nextlayer++;
|
|
double radius = 1.0 / ((double) (1 << nextlayer));
|
|
Map next = structure.references(centerhash);
|
|
Map.Entry entry;
|
|
String targethash, targethost;
|
|
// first set points to next hosts
|
|
Iterator i = next.entrySet().iterator();
|
|
ArrayList targets = new ArrayList();
|
|
int maxtargetrefs = 8, maxthisrefs = 8;
|
|
int targetrefs, thisrefs;
|
|
double rr, re;
|
|
while ((i.hasNext()) && (maxnodes > 0) && (System.currentTimeMillis() < timeout)) {
|
|
entry = (Map.Entry) i.next();
|
|
targethash = (String) entry.getKey();
|
|
targethost = structure.resolveDomHash2DomString(targethash);
|
|
if (targethost == null) continue;
|
|
thisrefs = ((Integer) entry.getValue()).intValue();
|
|
targetrefs = structure.referencesCount(targethash); // can be cpu/time-critical
|
|
maxtargetrefs = Math.max(targetrefs, maxtargetrefs);
|
|
maxthisrefs = Math.max(thisrefs, maxthisrefs);
|
|
targets.add(new String[] {targethash, targethost});
|
|
if (graph.getPoint(targethost) != null) continue;
|
|
// set a new point. It is placed on a circle around the host point
|
|
double angle = ((double) kelondroBase64Order.enhancedCoder.cardinal((targethash + "____").getBytes())) / maxlongd * 2 * Math.PI;
|
|
//System.out.println("ANGLE = " + angle);
|
|
rr = radius * 0.25 * (1 - targetrefs / maxtargetrefs);
|
|
re = radius * 0.5 * (thisrefs / maxthisrefs);
|
|
graph.addPoint(targethost, x + (radius - rr - re) * Math.cos(angle), y + (radius - rr - re) * Math.sin(angle), nextlayer);
|
|
maxnodes--;
|
|
mynodes++;
|
|
}
|
|
// recursively set next hosts
|
|
i = targets.iterator();
|
|
String[] target;
|
|
int nextnodes;
|
|
while (i.hasNext()) {
|
|
target = (String[]) i.next();
|
|
targethash = target[0];
|
|
targethost = target[1];
|
|
ymageGraph.coordinate c = graph.getPoint(targethost);
|
|
assert c != null;
|
|
nextnodes = ((maxnodes <= 0) || (System.currentTimeMillis() >= timeout)) ? 0 : place(graph, structure, targethash, targethost, maxnodes, timeout, c.x, c.y, nextlayer, maxlayer);
|
|
mynodes += nextnodes;
|
|
maxnodes -= nextnodes;
|
|
graph.setBorder(centerhost, targethost);
|
|
}
|
|
return mynodes;
|
|
}
|
|
|
|
}
|