Package org.apache.pig.piggybank.storage.IndexedStorage.IndexedStorageInputFormat

Examples of org.apache.pig.piggybank.storage.IndexedStorage.IndexedStorageInputFormat.IndexedStorageRecordReader

124
125
126
127
128
129
130
131
132
133
134
135
         * (faster than doing a Utils sort).
     */
    private void sortReader(int startIndex) {
        int idx = startIndex;
        while (idx < this.readers.length - 1) {
            IndexedStorageRecordReader reader1 = this.readers[idx];
            IndexedStorageRecordReader reader2 = this.readers[idx+1];
            if (this.readerComparator.compare(reader1, reader2) <= 0) {
                return;
            }
            this.readers[idx] = reader2;
            this.readers[idx+1] = reader1;
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
        if (this.readers == null) {
            return super.getNext();
        }

        while (currentReaderIndexStart < this.readers.length) {
            IndexedStorageRecordReader r = this.readers[currentReaderIndexStart];

            this.prepareToRead(r, null);
            Tuple tuple = super.getNext();
            if (tuple == null) {
                currentReaderIndexStart++;
                r.close();
                continue; //next Reader
            }

            //if we haven't yet initialized the indexManager (by reading the first index key)
            if (r.indexManager.lastIndexKeyTuple == null) {

                //initialize the indexManager
                if (r.indexManager.ReadIndex() == null) {
                    //There should never be a case where there is a non-null record - but no corresponding index.
                    throw new IOException("Missing Index for Tuple: " + tuple);
                }
            }

            r.indexManager.numberOfTuples--;

            if (r.indexManager.numberOfTuples == 0) {
                if (r.indexManager.ReadIndex() == null) {
                    r.close();
                    currentReaderIndexStart++;
                } else {
                    //Since the index of the current reader was increased, we may need to push the
                    //current reader back in the sorted list of readers.
                    sortReader(currentReaderIndexStart);
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
301
            int idx = 0;
            Iterator<FileSplit> it = fileSplits.iterator();
            while (it.hasNext()) {
                FileSplit fileSplit = it.next();
                TaskAttemptContext context = HadoopShims.createTaskAttemptContext(conf, id);
                IndexedStorageRecordReader r = (IndexedStorageRecordReader) inputFormat.createRecordReader(fileSplit, context);
                r.initialize(fileSplit, context);
                this.readers[idx] = r;
                idx++;
            }

            Arrays.sort(this.readers, this.readerComparator);
View Full Code Here
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
        /* Keeps track of the last (if any) reader where seekNear was called */
        int lastIndexModified = -1;

        int idx = currentReaderIndexStart;
        while (idx < this.readers.length) {
            IndexedStorageRecordReader r = this.readers[idx];

            /* The key falls within the range of the reader index */
            if (keys.compareTo(r.indexManager.maxIndexKeyTuple) <= 0 && keys.compareTo(r.indexManager.minIndexKeyTuple) >= 0) {
                r.seekNear(keys);
                lastIndexModified = idx;

            /* The key is greater than the current range of the reader index */
            } else if (keys.compareTo(r.indexManager.maxIndexKeyTuple) > 0) {
                currentReaderIndexStart++;
View Full Code Here
685
686
687
688
689
690
691
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }

            return new IndexedStorageRecordReader(im);
        }
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
134
         * (faster than doing a Utils sort).
   */
  private void sortReader(int startIndex) {
    int idx = startIndex;
    while (idx < this.readers.length - 1) {
      IndexedStorageRecordReader reader1 = this.readers[idx];
      IndexedStorageRecordReader reader2 = this.readers[idx+1];
      if (this.readerComparator.compare(reader1, reader2) <= 0) {
        return;
      }
      this.readers[idx] = reader2;
      this.readers[idx+1] = reader1;
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
    if (this.readers == null) {
      return super.getNext();
    }

    while (currentReaderIndexStart < this.readers.length) {
      IndexedStorageRecordReader r = this.readers[currentReaderIndexStart];

      this.prepareToRead(r, null);
      Tuple tuple = super.getNext();
      if (tuple == null) {
        currentReaderIndexStart++;
        r.close();
        continue; //next Reader
      }
   
      //if we haven't yet initialized the indexManager (by reading the first index key) 
      if (r.indexManager.lastIndexKeyTuple == null) {

        //initialize the indexManager
        if (r.indexManager.ReadIndex() == null) {
          //There should never be a case where there is a non-null record - but no corresponding index.
          throw new IOException("Missing Index for Tuple: " + tuple);
        }
      }

      r.indexManager.numberOfTuples--;

      if (r.indexManager.numberOfTuples == 0) {
        if (r.indexManager.ReadIndex() == null) {
          r.close();
          currentReaderIndexStart++;
        } else {
          //Since the index of the current reader was increased, we may need to push the
          //current reader back in the sorted list of readers.
          sortReader(currentReaderIndexStart);
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
301
      int idx = 0;
      Iterator<FileSplit> it = fileSplits.iterator();
      while (it.hasNext()) {
        FileSplit fileSplit = it.next();
        TaskAttemptContext context = HadoopShims.createTaskAttemptContext(conf, id);
        IndexedStorageRecordReader r = (IndexedStorageRecordReader) inputFormat.createRecordReader(fileSplit, context);
        r.initialize(fileSplit, context);
        this.readers[idx] = r;
        idx++;
      }

      Arrays.sort(this.readers, this.readerComparator);
View Full Code Here
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
    /* Keeps track of the last (if any) reader where seekNear was called */
    int lastIndexModified = -1;

    int idx = currentReaderIndexStart;
    while (idx < this.readers.length) {
      IndexedStorageRecordReader r = this.readers[idx];

      /* The key falls within the range of the reader index */
      if (keys.compareTo(r.indexManager.maxIndexKeyTuple) <= 0 && keys.compareTo(r.indexManager.minIndexKeyTuple) >= 0) {
        r.seekNear(keys);
        lastIndexModified = idx;

      /* The key is greater than the current range of the reader index */
      } else if (keys.compareTo(r.indexManager.maxIndexKeyTuple) > 0) {
        currentReaderIndexStart++;
View Full Code Here
687
688
689
690
691
692
693
      } catch (IOException e) {
        // TODO Auto-generated catch block
        e.printStackTrace();
      }

      return new IndexedStorageRecordReader(im);
    }
View Full Code Here
TOP

Related Classes of org.apache.pig.piggybank.storage.IndexedStorage.IndexedStorageInputFormat.IndexedStorageRecordReader

  • org.apache.pig.piggybank.storage.IndexedStorage
  • org.apache.pig.piggybank.storage.IndexedStorage$IndexedStorageInputFormat
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.