Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package com.bigdata.search;
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import org.apache.log4j.Logger;
import com.bigdata.btree.IRangeQuery;
import com.bigdata.btree.ISimpleSplitHandler;
import com.bigdata.btree.ITuple;
import com.bigdata.btree.ITupleIterator;
import com.bigdata.util.BytesUtil;
/**
* Procedure reads on the terms index, aggregating data on a per-{@link Hit}
* basis.
*
* The procedure uses an {@link IRangeQuery#rangeIterator(byte[], byte[])} to
* perform a key range scan for a specific term. The range iterator will
* automatically issue queries, obtaining a "chunk" of results at a time. Those
* results are aggregated on the {@link Hit} collection, which is maintained in
* a thread-safe hash map.
*
* Note: An {@link ISimpleSplitHandler} imposes the constraint that index
* partitions may only fall on a term boundary, hence all tuples for any given
* term will always be found on the same index partition.
*
* @param
* The generic type of the document identifier.
*
* @author Bryan Thompson
* @version $Id$
*/
public class ReadIndexTask> extends AbstractIndexTask
implements Callable