mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
773ba1e91a
- controlled object order for all database tables - migrated DHT position computation to correct base64-decoded values this also closed the 'gaps' in the dht positions git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@3049 6c8d7289-2bf4-0310-a012-ef5d649a1542
468 lines
20 KiB
Java
468 lines
20 KiB
Java
// indexRAMRI.java
|
|
// (C) 2005, 2006 by Michael Peter Christen; mc@anomic.de, Frankfurt a. M., Germany
|
|
// first published 2005 on http://www.anomic.de
|
|
//
|
|
// 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.index;
|
|
|
|
import java.io.File;
|
|
import java.io.IOException;
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
import java.util.Set;
|
|
import java.util.TreeMap;
|
|
|
|
import de.anomic.kelondro.kelondroBase64Order;
|
|
import de.anomic.kelondro.kelondroException;
|
|
import de.anomic.kelondro.kelondroFixedWidthArray;
|
|
import de.anomic.kelondro.kelondroMScoreCluster;
|
|
import de.anomic.kelondro.kelondroNaturalOrder;
|
|
import de.anomic.kelondro.kelondroRow;
|
|
import de.anomic.server.logging.serverLog;
|
|
import de.anomic.yacy.yacySeedDB;
|
|
|
|
public final class indexRAMRI implements indexRI {
|
|
|
|
// environment constants
|
|
public static final long wCacheMaxAge = 1000 * 60 * 30; // milliseconds; 30 minutes
|
|
|
|
// class variables
|
|
private final File databaseRoot;
|
|
protected final TreeMap cache; // wordhash-container
|
|
private final kelondroMScoreCluster hashScore;
|
|
private final kelondroMScoreCluster hashDate;
|
|
private long initTime;
|
|
private int cacheMaxCount;
|
|
public int cacheReferenceLimit;
|
|
private final serverLog log;
|
|
private String indexArrayFileName;
|
|
private kelondroRow payloadrow;
|
|
private kelondroRow bufferStructureBasis;
|
|
|
|
// calculated constants
|
|
private static String maxKey;
|
|
static {
|
|
maxKey = ""; for (int i = 0; i < yacySeedDB.commonHashLength; i++) maxKey += 'z';
|
|
//minKey = ""; for (int i = 0; i < yacySeedDB.commonHashLength; i++) maxKey += '-';
|
|
}
|
|
|
|
public indexRAMRI(File databaseRoot, kelondroRow payloadrow, int wCacheReferenceLimitInit, String dumpname, serverLog log) {
|
|
|
|
// creates a new index cache
|
|
// the cache has a back-end where indexes that do not fit in the cache are flushed
|
|
this.databaseRoot = databaseRoot;
|
|
this.cache = new TreeMap();
|
|
this.hashScore = new kelondroMScoreCluster();
|
|
this.hashDate = new kelondroMScoreCluster();
|
|
this.initTime = System.currentTimeMillis();
|
|
this.cacheMaxCount = 10000;
|
|
this.cacheReferenceLimit = wCacheReferenceLimitInit;
|
|
this.log = log;
|
|
this.indexArrayFileName = dumpname;
|
|
this.payloadrow = payloadrow;
|
|
this.bufferStructureBasis = new kelondroRow(
|
|
"byte[] wordhash-" + yacySeedDB.commonHashLength + ", " +
|
|
"Cardinal occ-4 {b256}, " +
|
|
"Cardinal time-8 {b256}, " +
|
|
"byte[] urlprops-" + payloadrow.objectsize(),
|
|
kelondroBase64Order.enhancedCoder, 0);
|
|
|
|
// read in dump of last session
|
|
try {
|
|
restore();
|
|
} catch (IOException e){
|
|
log.logSevere("unable to restore cache dump: " + e.getMessage(), e);
|
|
}
|
|
}
|
|
|
|
|
|
public synchronized long getUpdateTime(String wordHash) {
|
|
indexContainer entries = getContainer(wordHash, null, false, -1);
|
|
if (entries == null) return 0;
|
|
return entries.updated();
|
|
}
|
|
|
|
private void dump() throws IOException {
|
|
log.logConfig("creating dump for index cache '" + indexArrayFileName + "', " + cache.size() + " words (and much more urls)");
|
|
File indexDumpFile = new File(databaseRoot, indexArrayFileName);
|
|
if (indexDumpFile.exists()) indexDumpFile.delete();
|
|
kelondroFixedWidthArray dumpArray = null;
|
|
dumpArray = new kelondroFixedWidthArray(indexDumpFile, bufferStructureBasis, 0);
|
|
long startTime = System.currentTimeMillis();
|
|
long messageTime = System.currentTimeMillis() + 5000;
|
|
long wordsPerSecond = 0, wordcount = 0, urlcount = 0;
|
|
Map.Entry entry;
|
|
String wordHash;
|
|
indexContainer container;
|
|
long updateTime;
|
|
indexRWIEntry iEntry;
|
|
kelondroRow.Entry row = dumpArray.row().newEntry();
|
|
|
|
// write wCache
|
|
synchronized (cache) {
|
|
Iterator i = cache.entrySet().iterator();
|
|
while (i.hasNext()) {
|
|
// get entries
|
|
entry = (Map.Entry) i.next();
|
|
wordHash = (String) entry.getKey();
|
|
updateTime = getUpdateTime(wordHash);
|
|
container = (indexContainer) entry.getValue();
|
|
|
|
// put entries on stack
|
|
if (container != null) {
|
|
Iterator ci = container.entries();
|
|
while (ci.hasNext()) {
|
|
iEntry = (indexRWIEntry) ci.next();
|
|
row.setCol(0, wordHash.getBytes());
|
|
row.setCol(1, kelondroNaturalOrder.encodeLong(container.size(), 4));
|
|
row.setCol(2, kelondroNaturalOrder.encodeLong(updateTime, 8));
|
|
row.setCol(3, iEntry.toKelondroEntry().bytes());
|
|
dumpArray.set((int) urlcount++, row);
|
|
}
|
|
}
|
|
wordcount++;
|
|
i.remove(); // free some mem
|
|
|
|
// write a log
|
|
if (System.currentTimeMillis() > messageTime) {
|
|
// System.gc(); // for better statistic
|
|
wordsPerSecond = wordcount * 1000 / (1 + System.currentTimeMillis() - startTime);
|
|
log.logInfo("dumping status: " + wordcount + " words done, " + (cache.size() / (wordsPerSecond + 1)) + " seconds remaining, free mem = " + (Runtime.getRuntime().freeMemory() / 1024 / 1024) + "MB");
|
|
messageTime = System.currentTimeMillis() + 5000;
|
|
}
|
|
}
|
|
}
|
|
dumpArray.close();
|
|
dumpArray = null;
|
|
log.logConfig("dumped " + urlcount + " word/URL relations in " + ((System.currentTimeMillis() - startTime) / 1000) + " seconds");
|
|
}
|
|
|
|
private long restore() throws IOException {
|
|
File indexDumpFile = new File(databaseRoot, indexArrayFileName);
|
|
if (!(indexDumpFile.exists())) return 0;
|
|
kelondroFixedWidthArray dumpArray = new kelondroFixedWidthArray(indexDumpFile, bufferStructureBasis, 0);
|
|
log.logConfig("restore array dump of index cache '" + indexArrayFileName + "', " + dumpArray.size() + " word/URL relations");
|
|
long startTime = System.currentTimeMillis();
|
|
long messageTime = System.currentTimeMillis() + 5000;
|
|
long urlCount = 0, urlsPerSecond = 0;
|
|
try {
|
|
synchronized (cache) {
|
|
Iterator i = dumpArray.contentRows(-1);
|
|
String wordHash;
|
|
//long creationTime;
|
|
indexRWIEntry wordEntry;
|
|
kelondroRow.Entry row;
|
|
//Runtime rt = Runtime.getRuntime();
|
|
while (i.hasNext()) {
|
|
// get out one entry
|
|
row = (kelondroRow.Entry) i.next();
|
|
if ((row == null) || (row.empty(0)) || (row.empty(3))) continue;
|
|
wordHash = row.getColString(0, "UTF-8");
|
|
//creationTime = kelondroRecords.bytes2long(row[2]);
|
|
wordEntry = new indexRWIEntryNew(row.getColBytes(3));
|
|
// store to cache
|
|
addEntry(wordHash, wordEntry, startTime, false);
|
|
urlCount++;
|
|
// protect against memory shortage
|
|
//while (rt.freeMemory() < 1000000) {flushFromMem(); java.lang.System.gc();}
|
|
// write a log
|
|
if (System.currentTimeMillis() > messageTime) {
|
|
System.gc(); // for better statistic
|
|
urlsPerSecond = 1 + urlCount * 1000 / (1 + System.currentTimeMillis() - startTime);
|
|
log.logInfo("restoring status: " + urlCount + " urls done, " + ((dumpArray.size() - urlCount) / urlsPerSecond) + " seconds remaining, free mem = " + (Runtime.getRuntime().freeMemory() / 1024 / 1024) + "MB");
|
|
messageTime = System.currentTimeMillis() + 5000;
|
|
}
|
|
}
|
|
}
|
|
|
|
dumpArray.close();
|
|
log.logConfig("restored " + cache.size() + " words in " + ((System.currentTimeMillis() - startTime) / 1000) + " seconds");
|
|
} catch (kelondroException e) {
|
|
// restore failed
|
|
log.logSevere("restore of indexCache array dump failed: " + e.getMessage(), e);
|
|
} finally {
|
|
if (dumpArray != null) try {dumpArray.close();}catch(Exception e){}
|
|
}
|
|
return urlCount;
|
|
}
|
|
|
|
// cache settings
|
|
|
|
public int maxURLinCache() {
|
|
if (hashScore.size() == 0) return 0;
|
|
return hashScore.getMaxScore();
|
|
}
|
|
|
|
public long minAgeOfCache() {
|
|
if (hashDate.size() == 0) return 0;
|
|
return System.currentTimeMillis() - longEmit(hashDate.getMaxScore());
|
|
}
|
|
|
|
public long maxAgeOfCache() {
|
|
if (hashDate.size() == 0) return 0;
|
|
return System.currentTimeMillis() - longEmit(hashDate.getMinScore());
|
|
}
|
|
|
|
public void setMaxWordCount(int maxWords) {
|
|
this.cacheMaxCount = maxWords;
|
|
}
|
|
|
|
public int getMaxWordCount() {
|
|
return this.cacheMaxCount;
|
|
}
|
|
|
|
public synchronized int size() {
|
|
return cache.size();
|
|
}
|
|
|
|
public synchronized int indexSize(String wordHash) {
|
|
indexContainer cacheIndex = (indexContainer) cache.get(wordHash);
|
|
if (cacheIndex == null) return 0;
|
|
return cacheIndex.size();
|
|
}
|
|
|
|
public synchronized Iterator wordContainers(String startWordHash, boolean rot) {
|
|
// we return an iterator object that creates top-level-clones of the indexContainers
|
|
// in the cache, so that manipulations of the iterated objects do not change
|
|
// objects in the cache.
|
|
return new wordContainerIterator(startWordHash, rot);
|
|
}
|
|
|
|
public class wordContainerIterator implements Iterator {
|
|
|
|
// this class exists, because the wCache cannot be iterated with rotation
|
|
// and because every indeContainer Object that is iterated must be returned as top-level-clone
|
|
// so this class simulates wCache.tailMap(startWordHash).values().iterator()
|
|
// plus the mentioned features
|
|
|
|
private boolean rot;
|
|
private Iterator iterator;
|
|
|
|
public wordContainerIterator(String startWordHash, boolean rot) {
|
|
this.rot = rot;
|
|
this.iterator = (startWordHash == null) ? cache.values().iterator() : cache.tailMap(startWordHash).values().iterator();
|
|
// The collection's iterator will return the values in the order that their corresponding keys appear in the tree.
|
|
}
|
|
|
|
public boolean hasNext() {
|
|
if (rot) return true;
|
|
return iterator.hasNext();
|
|
}
|
|
|
|
public Object next() {
|
|
if (iterator.hasNext()) {
|
|
return ((indexContainer) iterator.next()).topLevelClone();
|
|
} else {
|
|
// rotation iteration
|
|
if (rot) {
|
|
iterator = cache.values().iterator();
|
|
return ((indexContainer) iterator.next()).topLevelClone();
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
}
|
|
|
|
public void remove() {
|
|
iterator.remove();
|
|
}
|
|
|
|
}
|
|
|
|
public synchronized String bestFlushWordHash() {
|
|
// select appropriate hash
|
|
// we have 2 different methods to find a good hash:
|
|
// - the oldest entry in the cache
|
|
// - the entry with maximum count
|
|
if (cache.size() == 0) return null;
|
|
try {
|
|
String hash = null;
|
|
int count = hashScore.getMaxScore();
|
|
if ((count >= cacheReferenceLimit) &&
|
|
((hash = (String) hashScore.getMaxObject()) != null)) {
|
|
// we MUST flush high-score entries, because a loop deletes entries in cache until this condition fails
|
|
// in this cache we MUST NOT check wCacheMinAge
|
|
return hash;
|
|
}
|
|
long oldestTime = longEmit(hashDate.getMinScore());
|
|
if (((System.currentTimeMillis() - oldestTime) > wCacheMaxAge) &&
|
|
((hash = (String) hashDate.getMinObject()) != null)) {
|
|
// flush out-dated entries
|
|
return hash;
|
|
}
|
|
// cases with respect to memory situation
|
|
if (Runtime.getRuntime().freeMemory() < 100000) {
|
|
// urgent low-memory case
|
|
hash = (String) hashScore.getMaxObject(); // flush high-score entries (saves RAM)
|
|
} else {
|
|
// not-efficient-so-far case. cleans up unnecessary cache slots
|
|
hash = (String) hashDate.getMinObject(); // flush oldest entries
|
|
}
|
|
return hash;
|
|
} catch (Exception e) {
|
|
log.logSevere("flushFromMem: " + e.getMessage(), e);
|
|
}
|
|
return null;
|
|
}
|
|
|
|
private int intTime(long longTime) {
|
|
return (int) Math.max(0, ((longTime - initTime) / 1000));
|
|
}
|
|
|
|
private long longEmit(int intTime) {
|
|
return (((long) intTime) * (long) 1000) + initTime;
|
|
}
|
|
|
|
public synchronized indexContainer getContainer(String wordHash, Set urlselection, boolean deleteIfEmpty, long maxtime_dummy) {
|
|
|
|
// retrieve container
|
|
indexContainer container = (indexContainer) cache.get(wordHash);
|
|
|
|
// We must not use the container from cache to store everything we find,
|
|
// as that container remains linked to in the cache and might be changed later
|
|
// while the returned container is still in use.
|
|
// create a clone from the container
|
|
if (container != null) container = container.topLevelClone();
|
|
|
|
// select the urlselection
|
|
if ((urlselection != null) && (container != null)) container.select(urlselection);
|
|
|
|
return container;
|
|
}
|
|
|
|
public synchronized indexContainer deleteContainer(String wordHash) {
|
|
// returns the index that had been deleted
|
|
indexContainer container = (indexContainer) cache.remove(wordHash);
|
|
hashScore.deleteScore(wordHash);
|
|
hashDate.deleteScore(wordHash);
|
|
return container;
|
|
}
|
|
|
|
public synchronized boolean removeEntry(String wordHash, String urlHash, boolean deleteComplete) {
|
|
indexContainer c = (indexContainer) cache.get(wordHash);
|
|
if ((c != null) && (c.removeEntry(wordHash, urlHash, deleteComplete))) {
|
|
// removal successful
|
|
if ((c.size() == 0) && (deleteComplete)) {
|
|
deleteContainer(wordHash);
|
|
} else {
|
|
cache.put(wordHash, c);
|
|
hashScore.decScore(wordHash);
|
|
hashDate.setScore(wordHash, intTime(System.currentTimeMillis()));
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
public synchronized int removeEntries(String wordHash, Set urlHashes, boolean deleteComplete) {
|
|
if (urlHashes.size() == 0) return 0;
|
|
indexContainer c = (indexContainer) cache.get(wordHash);
|
|
int count;
|
|
if ((c != null) && ((count = c.removeEntries(wordHash, urlHashes, deleteComplete)) > 0)) {
|
|
// removal successful
|
|
if ((c.size() == 0) && (deleteComplete)) {
|
|
deleteContainer(wordHash);
|
|
} else {
|
|
cache.put(wordHash, c);
|
|
hashScore.setScore(wordHash, c.size());
|
|
hashDate.setScore(wordHash, intTime(System.currentTimeMillis()));
|
|
}
|
|
return count;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
public synchronized int tryRemoveURLs(String urlHash) {
|
|
// this tries to delete an index from the cache that has this
|
|
// urlHash assigned. This can only work if the entry is really fresh
|
|
// Such entries must be searched in the latest entries
|
|
int delCount = 0;
|
|
Iterator i = cache.entrySet().iterator();
|
|
Map.Entry entry;
|
|
String wordhash;
|
|
indexContainer c;
|
|
while (i.hasNext()) {
|
|
entry = (Map.Entry) i.next();
|
|
wordhash = (String) entry.getKey();
|
|
|
|
// get container
|
|
c = (indexContainer) entry.getValue();
|
|
if (c.remove(urlHash) != null) {
|
|
if (c.size() == 0) {
|
|
i.remove();
|
|
} else {
|
|
cache.put(wordhash, c); // superfluous?
|
|
}
|
|
delCount++;
|
|
}
|
|
}
|
|
return delCount;
|
|
}
|
|
|
|
public synchronized void addEntries(indexContainer container, long updateTime, boolean dhtCase) {
|
|
// this puts the entries into the cache, not into the assortment directly
|
|
int added = 0;
|
|
if ((container == null) || (container.size() == 0)) return;
|
|
|
|
// put new words into cache
|
|
String wordHash = container.getWordHash();
|
|
indexContainer entries = (indexContainer) cache.get(wordHash); // null pointer exception? wordhash != null! must be cache==null
|
|
if (entries == null) {
|
|
entries = container.topLevelClone();
|
|
added = entries.size();
|
|
} else {
|
|
added = entries.add(container, -1);
|
|
}
|
|
if (added > 0) {
|
|
cache.put(wordHash, entries);
|
|
hashScore.addScore(wordHash, added);
|
|
hashDate.setScore(wordHash, intTime(updateTime));
|
|
}
|
|
entries = null;
|
|
}
|
|
|
|
public synchronized void addEntry(String wordHash, indexRWIEntry newEntry, long updateTime, boolean dhtCase) {
|
|
indexContainer container = (indexContainer) cache.get(wordHash);
|
|
if (container == null) container = new indexContainer(wordHash, this.payloadrow);
|
|
indexRWIEntry[] entries = new indexRWIEntry[] { newEntry };
|
|
if (container.add(entries, updateTime) > 0) {
|
|
cache.put(wordHash, container);
|
|
hashScore.incScore(wordHash);
|
|
hashDate.setScore(wordHash, intTime(updateTime));
|
|
return;
|
|
}
|
|
container = null;
|
|
entries = null;
|
|
}
|
|
|
|
public synchronized void close() {
|
|
// dump cache
|
|
try {
|
|
dump();
|
|
} catch (IOException e){
|
|
log.logSevere("unable to dump cache: " + e.getMessage(), e);
|
|
}
|
|
}
|
|
}
|