// plasmaWebStructure.java // ----------------------------- // (C) 2007 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany // first published 15.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 package de.anomic.plasma; import java.io.File; import java.io.IOException; import java.util.Date; import java.util.HashMap; import java.util.Iterator; import java.util.Map; import java.util.SortedMap; import java.util.TreeMap; import java.util.TreeSet; import de.anomic.kelondro.kelondroBase64Order; import de.anomic.kelondro.kelondroMicroDate; import de.anomic.kelondro.kelondroDate; import de.anomic.server.serverFileUtils; import de.anomic.server.logging.serverLog; import de.anomic.yacy.yacyURL; public class plasmaWebStructure { public static int maxCRLDump = 500000; public static int maxCRGDump = 200000; public static int maxref = 300; // maximum number of references, to avoid overflow when a large link farm occurs (i.e. wikipedia) public static int maxhosts = 8000; // maximum number of hosts in web structure map private StringBuilder crg; // global citation references private final serverLog log; private final File rankingPath, structureFile; private final String crlFile, crgFile; TreeMap structure_old, structure_new; // ',' to {}* public plasmaWebStructure(final serverLog log, final File rankingPath, final String crlFile, final String crgFile, final File structureFile) { this.log = log; this.rankingPath = rankingPath; this.crlFile = crlFile; this.crgFile = crgFile; this.crg = new StringBuilder(maxCRGDump); this.structure_old = new TreeMap(); this.structure_new = new TreeMap(); this.structureFile = structureFile; // load web structure final Map loadedStructure = (this.structureFile.exists()) ? serverFileUtils.loadHashMap(this.structureFile) : new TreeMap(); if (loadedStructure != null) this.structure_old.putAll(loadedStructure); // delete out-dated entries in case the structure is too big if (this.structure_old.size() > maxhosts) { // fill a set with last-modified - dates of the structure final TreeSet delset = new TreeSet(); String key, value; for (final Map.Entry entry : this.structure_old.entrySet()) { key = entry.getKey(); value = entry.getValue(); delset.add(value.substring(0, 8) + key); } int delcount = this.structure_old.size() - (maxhosts * 9 / 10); final Iterator j = delset.iterator(); while ((delcount > 0) && (j.hasNext())) { this.structure_old.remove(j.next().substring(8)); delcount--; } } } public Integer[] /*(outlinksSame, outlinksOther)*/ generateCitationReference(final plasmaParserDocument document, final plasmaCondenser condenser, final Date docDate) { final yacyURL url = document.dc_source(); // generate citation reference final Map hl = document.getHyperlinks(); final Iterator it = hl.keySet().iterator(); String nexturlhash; final StringBuilder cpg = new StringBuilder(12 * (hl.size() + 1) + 1); final StringBuilder cpl = new StringBuilder(12 * (hl.size() + 1) + 1); final String lhp = url.hash().substring(6); // local hash part int GCount = 0; int LCount = 0; while (it.hasNext()) { nexturlhash = it.next().hash(); if (nexturlhash != null) { if (nexturlhash.substring(6).equals(lhp)) { // this is a inbound link cpl.append(nexturlhash.substring(0, 6)); // store only local part LCount++; } else { // this is a outbound link cpg.append(nexturlhash); // store complete hash GCount++; } } } // append this reference to buffer // generate header info final String head = url.hash() + "=" + kelondroMicroDate.microDateHoursStr(docDate.getTime()) + // latest update timestamp of the URL kelondroMicroDate.microDateHoursStr(System.currentTimeMillis()) + // last visit timestamp of the URL kelondroBase64Order.enhancedCoder.encodeLongSmart(LCount, 2) + // count of links to local resources kelondroBase64Order.enhancedCoder.encodeLongSmart(GCount, 2) + // count of links to global resources kelondroBase64Order.enhancedCoder.encodeLongSmart(document.getImages().size(), 2) + // count of Images in document kelondroBase64Order.enhancedCoder.encodeLongSmart(0, 2) + // count of links to other documents kelondroBase64Order.enhancedCoder.encodeLongSmart(document.getTextLength(), 3) + // length of plain text in bytes kelondroBase64Order.enhancedCoder.encodeLongSmart(condenser.RESULT_NUMB_WORDS, 3) + // count of all appearing words kelondroBase64Order.enhancedCoder.encodeLongSmart(condenser.words().size(), 3) + // count of all unique words kelondroBase64Order.enhancedCoder.encodeLongSmart(0, 1); // Flags (update, popularity, attention, vote) //crl.append(head); crl.append ('|'); crl.append(cpl); crl.append((char) 13); crl.append((char) 10); crg.append(head); crg.append('|'); crg.append(cpg); crg.append((char) 13); crg.append((char) 10); learn(url, cpg); // if buffer is full, flush it. /* if (crl.length() > maxCRLDump) { flushCitationReference(crl, "crl"); crl = new StringBuilder(maxCRLDump); } **/ if (crg.length() > maxCRGDump) { flushCitationReference("crg"); crg = new StringBuilder(maxCRGDump); } return new Integer[] {Integer.valueOf(LCount), Integer.valueOf(GCount)}; } public void flushCitationReference(final String type) { if (crg.length() < 12) return; final String filename = type.toUpperCase() + "-A-" + new kelondroDate().toShortString(true) + "." + crg.substring(0, 12) + ".cr.gz"; final File path = new File(rankingPath, (type.equals("crl")) ? crlFile : crgFile); path.mkdirs(); final File file = new File(path, filename); // generate header final StringBuilder header = new StringBuilder(200); header.append("# Name=YaCy " + ((type.equals("crl")) ? "Local" : "Global") + " Citation Reference Ticket"); header.append((char) 13); header.append((char) 10); header.append("# Created=" + System.currentTimeMillis()); header.append((char) 13); header.append((char) 10); header.append("# Structure=,'=',,,,,,,,,,,'|',*"); header.append((char) 13); header.append((char) 10); header.append("# ---"); header.append((char) 13); header.append((char) 10); crg.insert(0, header.toString()); try { serverFileUtils.writeAndGZip(crg.toString().getBytes(), file); if (this.log.isFine()) log.logFine("wrote citation reference dump " + file.toString()); } catch (final IOException e) { e.printStackTrace(); } } private static int refstr2count(final String refs) { if ((refs == null) || (refs.length() <= 8)) return 0; assert (refs.length() - 8) % 10 == 0; return (refs.length() - 8) / 10; } static Map refstr2map(final String refs) { if ((refs == null) || (refs.length() <= 8)) return new HashMap(); final Map map = new HashMap(); String c; final int refsc = refstr2count(refs); for (int i = 0; i < refsc; i++) { c = refs.substring(8 + i * 10, 8 + (i + 1) * 10); map.put(c.substring(0, 6), Integer.valueOf(c.substring(6), 16)); } return map; } private static String map2refstr(final Map map) { final StringBuilder s = new StringBuilder(map.size() * 10); s.append(kelondroDate.formatShortDay(new Date())); String h; for (final Map.Entry entry : map.entrySet()) { s.append(entry.getKey()); h = Integer.toHexString(entry.getValue().intValue()); if (h.length() == 0) { s.append("0000"); } else if (h.length() == 1) { s.append("000").append(h); } else if (h.length() == 2) { s.append("00").append(h); } else if (h.length() == 3) { s.append('0').append(h); } else if (h.length() == 4) { s.append(h); } else { s.append("FFFF"); } } return s.toString(); } public Map references(final String domhash) { // returns a map with a domhash(String):refcount(Integer) relation assert domhash.length() == 6; SortedMap tailMap; Map h = new HashMap(); synchronized (structure_old) { tailMap = structure_old.tailMap(domhash); if (!tailMap.isEmpty()) { final String key = tailMap.firstKey(); if (key.startsWith(domhash)) { h = refstr2map(tailMap.get(key)); } } } synchronized (structure_new) { tailMap = structure_new.tailMap(domhash); if (!tailMap.isEmpty()) { final String key = tailMap.firstKey(); if (key.startsWith(domhash)) { h.putAll(refstr2map(tailMap.get(key))); } } } return h; } public int referencesCount(final String domhash) { // returns the number of domains that are referenced by this domhash assert domhash.length() == 6 : "domhash = " + domhash; SortedMap tailMap; int c = 0; synchronized (structure_old) { tailMap = structure_old.tailMap(domhash); if (!tailMap.isEmpty()) { final String key = tailMap.firstKey(); if (key.startsWith(domhash)) { c = refstr2count(tailMap.get(key)); } } } synchronized (structure_new) { tailMap = structure_new.tailMap(domhash); if (!tailMap.isEmpty()) { final String key = tailMap.firstKey(); if (key.startsWith(domhash)) { c += refstr2count(tailMap.get(key)); } } } return c; } public String resolveDomHash2DomString(final String domhash) { // returns the domain as string, null if unknown assert domhash.length() == 6; SortedMap tailMap; synchronized(structure_old) { tailMap = structure_old.tailMap(domhash); if (!tailMap.isEmpty()) { final String key = tailMap.firstKey(); if (key.startsWith(domhash)) { return key.substring(7); } } } synchronized(structure_new) { tailMap = structure_new.tailMap(domhash); if (!tailMap.isEmpty()) { final String key = tailMap.firstKey(); if (key.startsWith(domhash)) { return key.substring(7); } } } return null; } private void learn(final yacyURL url, final StringBuilder reference /*string of b64(12digits)-hashes*/) { final String domhash = url.hash().substring(6); // parse the new reference string and join it with the stored references final Map refs = references(domhash); assert reference.length() % 12 == 0; String dom; int c; for (int i = 0; i < reference.length() / 12; i++) { dom = reference.substring(i * 12 + 6, (i + 1) * 12); c = 0; if (refs.containsKey(dom)) { c = (refs.get(dom)).intValue(); } refs.put(dom, Integer.valueOf(++c)); } // check if the maxref is exceeded if (refs.size() > maxref) { int shrink = refs.size() - (maxref * 9 / 10); delloop: while (shrink > 0) { // shrink the references: the entry with the smallest number of references is removed int minrefcount = Integer.MAX_VALUE; String minrefkey = null; findloop: for (final Map.Entry entry : refs.entrySet()) { if (entry.getValue().intValue() < minrefcount) { minrefcount = entry.getValue().intValue(); minrefkey = entry.getKey(); } if (minrefcount == 1) break findloop; } // remove the smallest if (minrefkey == null) break delloop; refs.remove(minrefkey); shrink--; } } // store the map back to the structure synchronized(structure_new) { structure_new.put(domhash + "," + url.getHost(), map2refstr(refs)); } } private static final void joinStructure(final TreeMap into, final TreeMap from) { for (final Map.Entry e: from.entrySet()) { if (into.containsKey(e.getKey())) { final Map s0 = refstr2map(into.get(e.getKey())); final Map s1 = refstr2map(e.getValue()); for (final Map.Entry r: s1.entrySet()) { if (s0.containsKey(r.getKey())) { s0.put(r.getKey(), s0.get(r.getKey()).intValue() + r.getValue().intValue()); } else { s0.put(r.getKey(), r.getValue().intValue()); } } into.put(e.getKey(), map2refstr(s0)); } else { into.put(e.getKey(), e.getValue()); } } } public void joinOldNew() { synchronized(structure_new) { joinStructure(this.structure_old, this.structure_new); this.structure_new.clear(); } } public void saveWebStructure() { joinOldNew(); try { synchronized(structure_old) { serverFileUtils.saveMap(this.structureFile, this.structure_old, "Web Structure Syntax: ',' to {}*"); } } catch (final IOException e) { e.printStackTrace(); } } public String hostWithMaxReferences() { // find domain with most references String maxhost = null; int refsize, maxref = 0; joinOldNew(); synchronized(structure_new) { for (final Map.Entry entry : structure_old.entrySet()) { refsize = entry.getValue().length(); if (refsize > maxref) { maxref = refsize; maxhost = entry.getKey().substring(7); } } } return maxhost; } public Iterator structureEntryIterator(final boolean latest) { // iterates objects of type structureEntry return new structureIterator(latest); } public class structureIterator implements Iterator { private final Iterator> i; private structureEntry nextentry; public structureIterator(final boolean latest) { i = ((latest) ? structure_new : structure_old).entrySet().iterator(); next0(); } public boolean hasNext() { return nextentry != null; } private void next0() { Map.Entry entry = null; String dom = null, ref; while (i.hasNext()) { entry = i.next(); dom = entry.getKey(); if (dom.length() >= 8) break; if (!i.hasNext()) { nextentry = null; return; } } if ((entry == null) || (dom == null)) { nextentry = null; return; } ref = entry.getValue(); nextentry = new structureEntry(dom.substring(0, 6), dom.substring(7), ref.substring(0, 8), refstr2map(ref)); } public structureEntry next() { final structureEntry r = nextentry; next0(); return r; } public void remove() { throw new UnsupportedOperationException("not implemented"); } } public static class structureEntry { public String domhash, domain, date; public Map references; public structureEntry(final String domhash, final String domain, final String date, final Map references) { this.domhash = domhash; this.domain = domain; this.date = date; this.references = references; } } public void close() { log.logInfo("Saving Web Structure File"); saveWebStructure(); } }