| /* |
| * Copyright 2009-2012 by The Regents of the University of California |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * you may obtain a copy of the License from |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| package edu.uci.ics.hyracks.storage.am.lsm.invertedindex.multithread; |
| |
| import java.util.ArrayList; |
| import java.util.List; |
| import java.util.Random; |
| |
| import edu.uci.ics.hyracks.api.exceptions.HyracksDataException; |
| import edu.uci.ics.hyracks.dataflow.common.data.accessors.ITupleReference; |
| import edu.uci.ics.hyracks.dataflow.common.util.TupleUtils; |
| import edu.uci.ics.hyracks.storage.am.btree.impls.RangePredicate; |
| import edu.uci.ics.hyracks.storage.am.common.AbstractIndexTestWorker; |
| import edu.uci.ics.hyracks.storage.am.common.TestOperationSelector; |
| import edu.uci.ics.hyracks.storage.am.common.TestOperationSelector.TestOperation; |
| import edu.uci.ics.hyracks.storage.am.common.api.IIndex; |
| import edu.uci.ics.hyracks.storage.am.common.api.IIndexCursor; |
| import edu.uci.ics.hyracks.storage.am.common.api.IndexException; |
| import edu.uci.ics.hyracks.storage.am.common.datagen.DataGenThread; |
| import edu.uci.ics.hyracks.storage.am.lsm.common.impls.NoOpIOOperationCallback; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.api.IInvertedIndexSearchModifier; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.exceptions.OccurrenceThresholdPanicException; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.impls.LSMInvertedIndex; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.impls.LSMInvertedIndexAccessor; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.search.ConjunctiveSearchModifier; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.search.InvertedIndexSearchPredicate; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.search.JaccardSearchModifier; |
| import edu.uci.ics.hyracks.storage.am.lsm.invertedindex.tokenizers.IBinaryTokenizerFactory; |
| |
| public class LSMInvertedIndexTestWorker extends AbstractIndexTestWorker { |
| |
| protected final LSMInvertedIndex invIndex; |
| protected final List<ITupleReference> documentCorpus = new ArrayList<ITupleReference>(); |
| protected final Random rnd = new Random(50); |
| |
| protected final IInvertedIndexSearchModifier[] TEST_SEARCH_MODIFIERS = new IInvertedIndexSearchModifier[] { |
| new ConjunctiveSearchModifier(), new JaccardSearchModifier(0.8f), new JaccardSearchModifier(0.5f) }; |
| |
| public LSMInvertedIndexTestWorker(DataGenThread dataGen, TestOperationSelector opSelector, IIndex index, |
| int numBatches) { |
| super(dataGen, opSelector, index, numBatches); |
| invIndex = (LSMInvertedIndex) index; |
| } |
| |
| @Override |
| public void performOp(ITupleReference tuple, TestOperation op) throws HyracksDataException, IndexException { |
| LSMInvertedIndexAccessor accessor = (LSMInvertedIndexAccessor) indexAccessor; |
| IIndexCursor searchCursor = accessor.createSearchCursor(); |
| IIndexCursor rangeSearchCursor = accessor.createRangeSearchCursor(); |
| RangePredicate rangePred = new RangePredicate(null, null, true, true, null, null); |
| IBinaryTokenizerFactory tokenizerFactory = invIndex.getTokenizerFactory(); |
| int searchModifierIndex = Math.abs(rnd.nextInt()) % TEST_SEARCH_MODIFIERS.length; |
| InvertedIndexSearchPredicate searchPred = new InvertedIndexSearchPredicate(tokenizerFactory.createTokenizer(), |
| TEST_SEARCH_MODIFIERS[searchModifierIndex]); |
| |
| switch (op) { |
| case INSERT: { |
| insert(accessor, tuple); |
| break; |
| } |
| |
| case DELETE: { |
| // Randomly pick a document from the corpus to delete. |
| if (!documentCorpus.isEmpty()) { |
| int docIndex = Math.abs(rnd.nextInt()) % documentCorpus.size(); |
| ITupleReference deleteTuple = documentCorpus.get(docIndex); |
| accessor.delete(deleteTuple); |
| // Swap tupleIndex with last element. |
| documentCorpus.set(docIndex, documentCorpus.get(documentCorpus.size() - 1)); |
| documentCorpus.remove(documentCorpus.size() - 1); |
| } else { |
| // No existing documents to delete, treat this case as an insert. |
| insert(accessor, tuple); |
| } |
| break; |
| } |
| |
| case POINT_SEARCH: { |
| searchCursor.reset(); |
| searchPred.setQueryTuple(tuple); |
| searchPred.setQueryFieldIndex(0); |
| try { |
| accessor.search(searchCursor, searchPred); |
| consumeCursorTuples(searchCursor); |
| } catch (OccurrenceThresholdPanicException e) { |
| // Ignore. |
| } |
| break; |
| } |
| |
| case SCAN: { |
| rangeSearchCursor.reset(); |
| accessor.rangeSearch(rangeSearchCursor, rangePred); |
| consumeCursorTuples(rangeSearchCursor); |
| break; |
| } |
| |
| case MERGE: { |
| accessor.scheduleMerge(NoOpIOOperationCallback.INSTANCE); |
| break; |
| } |
| |
| default: |
| throw new HyracksDataException("Op " + op.toString() + " not supported."); |
| } |
| } |
| |
| private void insert(LSMInvertedIndexAccessor accessor, ITupleReference tuple) throws HyracksDataException, |
| IndexException { |
| // Ignore ongoing merges. Do an insert instead. |
| accessor.insert(tuple); |
| // Add tuple to document corpus so we can delete it. |
| ITupleReference copyTuple = TupleUtils.copyTuple(tuple); |
| documentCorpus.add(copyTuple); |
| } |
| } |