Examples of org.apache.hadoop.hbase.client.Put

org.apache.hadoop.hbase.client.Put
Used to perform Put operations for a single row.
To perform a Put, instantiate a Put object with the row to insert to and for each column to be inserted, execute {@link #add(byte[],byte[],byte[]) add} or{@link #add(byte[],byte[],long,byte[]) add} if setting the timestamp.

        int num = sequence.getAndIncrement();
        if (num % 10 == 0) {
          System.out.printf("-- writing row %d\n", num);
        }
        if (num <= rows.length) {
          Put put = new Put(rows[num]);
          char[] chars = (FIXED_PART + num % 10).toCharArray();
          put.add(family, qualifier, Bytes.toBytes(chars));
          table.put(put);
        } else {
          return null;
        }
        //Thread.sleep(0L, 100000); // sleep .1 millis

View Full Code Here


    int numberOfRows = 10000;


    Random random = new Random(2112L);
    for (int row = 0; row < numberOfRows; row++) {
      Put put = new Put(Bytes.toBytes(random.nextLong()));
      put.add(FAMILY_1_NAME, INT_QUAL_NAME, Bytes.toBytes(row));
      final String str = String.format("%010d", row % 1000);
      put.add(FAMILY_1_NAME, BYTES_QUAL_NAME, str.getBytes());
      put.add(FAMILY_2_NAME, CHARS_QUAL_NAME, Bytes.toBytes(str.toCharArray()));
      region.put(put);
    }


    region.flushcache();

View Full Code Here

    initIdxRegion(tableName, method, new HBaseConfiguration(),
      Pair.of(family, new IdxIndexDescriptor[]{indexDescriptor}));


    for (long i = 1; i <= 100; i++) {
      byte[] row = Bytes.toBytes(i);
      Put put = new Put(row);
      put.add(family, qualLong, Bytes.toBytes(i));
      region.put(put);
    }


    region.flushcache();

View Full Code Here

    //Setting up region
    String method = "testIndexedScanWithOneRow";
    initIdxRegion(tableName, method, new HBaseConfiguration(),
      Pair.of(family, new IdxIndexDescriptor[]{indexDescriptor}));


    Put put = new Put(row1);
    put.add(family, qualLong, Bytes.toBytes(42L));
    region.put(put);


    checkScanWithOneRow(family, false);


    region.flushcache();

View Full Code Here

    //Setting up region
    String method = "testIndexedScanWithOneRow";
    initIdxRegion(tableName, method, new HBaseConfiguration(), Pair.of(family,
      new IdxIndexDescriptor[]{indexDescriptor}));
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      put.add(family, qualLong, Bytes.toBytes(i));
      region.put(put);
    }


    /**
     * Check when indexes are empty and memstore is full
     */
    checkScanWithOneIndexAndOneColumn(family, false, numRows, 1);


    region.flushcache();


    /**
     * Check when indexes are full and memstore is empty
     */
    checkScanWithOneIndexAndOneColumn(family, true, numRows, 1);




    for (long i = numRows; i < numRows + 1000; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      put.add(family, qualLong, Bytes.toBytes(i));
      region.put(put);
    }


    /**
     * check when both the index and the memstore contain entries

View Full Code Here

    //Setting up region
    String method = "testIndexedScanWithThreeColumns";
    initIdxRegion(tableName, method, new HBaseConfiguration(), Pair.of(family,
      new IdxIndexDescriptor[]{indexDescriptor1, indexDescriptor2, indexDescriptor3}));
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      put.add(family, qualLong, Bytes.toBytes(i));
      put.add(family, qualDouble, Bytes.toBytes((double) i));
      put.add(family, qualBytes, Bytes.toBytes("str" + (10 + (i % 50))));
      region.put(put);
    }


    /**
     * Check when indexes are empty and memstore is full
     */
    checkScanWithOneIndexAndOneColumn(family, false, numRows, 3);
    checkScanWithThreeColumns(family, false, numRows, 3);


    region.flushcache();


    /**
     * Check when indexes are full and memstore is empty
     */
    checkScanWithOneIndexAndOneColumn(family, true, numRows, 3);
    checkScanWithThreeColumns(family, true, numRows, 3);




    int numAdditionalRows = 1000;
    for (long i = numRows; i < numRows + numAdditionalRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      put.add(family, qualLong, Bytes.toBytes(i));
      put.add(family, qualDouble, Bytes.toBytes((double) i));
      put.add(family, qualBytes, Bytes.toBytes("str" + (10 + (i % 50))));
      region.put(put);
    }


    /**
     * check when both the index and the memstore contain entries

View Full Code Here


    int numberOfRows = 1000;


    Random random = new Random(3505L);
    for (int row = 0; row < numberOfRows; row++) {
      Put put = new Put(Bytes.toBytes(random.nextLong()));
      int val = row % 10;
      put.add(family1, qualLong, Bytes.toBytes((long) val));
      put.add(family1, qualDouble, Bytes.toBytes((double) val));
      put.add(family2, qualBytes, Bytes.toBytes(String.format("%04d", val)));
      region.put(put);
    }


    checkScanWithTwoFamilies(family1, family2, false, numberOfRows, 3);


    region.flushcache();


    checkScanWithTwoFamilies(family1, family2, true, numberOfRows, 3);


    /**
     * Add some more to have results both in the index and in memstore
     */
    for (int row = 0; row < numberOfRows; row++) {
      Put put = new Put(Bytes.toBytes(random.nextLong()));
      int val = row % 10;
      put.add(family1, qualLong, Bytes.toBytes((long) val));
      put.add(family1, qualDouble, Bytes.toBytes((double) val));
      put.add(family2, qualBytes, Bytes.toBytes(String.format("%04d", val)));
      region.put(put);
    }


    checkScanWithTwoFamilies(family1, family2, false, numberOfRows * 2, 3);

View Full Code Here

    //Setting up region
    String method = "testIndexedScanWithMultipleVersions";
    initIdxRegion(tableName, method, new HBaseConfiguration(), Pair.of(family,
      new IdxIndexDescriptor[]{indexDescriptor1, indexDescriptor2}));
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      long value = i % 10;
      put.add(family, qualLong, Bytes.toBytes(value));
      put.add(family, qualDouble, Bytes.toBytes((double) i));
      region.put(put);
    }


    /**
     * Check when indexes are empty and memstore is full
     */
    checkIndexedScanWithMultipleVersions(family, false, numRows, 1);




    random = new Random(27101973L);  // pseudo random order of row insertions
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      long value = 10 + i % 10;
      put.add(family, qualLong, Bytes.toBytes(value));
      put.add(family, qualDouble, Bytes.toBytes((double) i));
      region.put(put);
    }


    /**
     * Check when indexes are full and memstore is empty
     */
    checkIndexedScanWithMultipleVersions(family, false, numRows, 2);


    region.flushcache();


    /**
     * Check when indexes are full and memstore is empty
     */
    checkIndexedScanWithMultipleVersions(family, true, numRows, 2);


    random = new Random(27101973L);  // pseudo random order of row insertions
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      long value = 20 + i % 10;
      put.add(family, qualLong, Bytes.toBytes(value));
      put.add(family, qualDouble, Bytes.toBytes((double) i));
      region.put(put);
    }


    checkIndexedScanWithMultipleVersions(family, false, numRows, 3);
    region.flushcache();

View Full Code Here

    //Setting up region
    String method = "testIndexedScanWithDeletedRows";
    initIdxRegion(tableName, method, new HBaseConfiguration(), Pair.of(family,
      new IdxIndexDescriptor[]{indexDescriptor1, indexDescriptor2}));
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      long value = i % 10;
      put.add(family, qualLong, timestamp, Bytes.toBytes(value));
      put.add(family, qualDouble, timestamp, Bytes.toBytes((double) i));
      region.put(put);
    }


    checkIndexedScanWithDeletedRows(family, false, 7L, numRows / 5);
    checkIndexedScanWithDeletedRows(family, false, 6L, 8L, 3 * numRows / 5);


    timestamp++;


    // delete some rows
    random = new Random(10121986L);  // pseudo random order of row insertions
    for (long i = 0; i < numRows; i++) {
      byte[] rowId = Bytes.toBytes(random.nextLong() + "." + i);
      if (i % 10 == 7) {
        Delete delete = new Delete(rowId, timestamp, null);
        region.delete(delete, null, true);
      }
    }


    checkIndexedScanWithDeletedRows(family, false, 7L, 0);
    checkIndexedScanWithDeletedRows(family, false, 6L, 8L, 2 * numRows / 5);


    /**
     * Flush and verify
     */
    region.flushcache();


    checkIndexedScanWithDeletedRows(family, true, 7L, 0);
    checkIndexedScanWithDeletedRows(family, true, 6L, 8L, 2 * numRows / 5);


    /**
     * New check - now the index should find the 4's  and the memstore
     * should only contains deleted rows - override the index's findings
     */
    checkIndexedScanWithDeletedRows(family, true, 4L, numRows / 5);
    checkIndexedScanWithDeletedRows(family, true, 3L, 8L, numRows);


    timestamp++;


    random = new Random(10121986L);  // pseudo random order of row insertions
    for (long i = 0; i < numRows; i++) {
      byte[] rowId = Bytes.toBytes(random.nextLong() + "." + i);
      if (i % 10 == 4) {
        Delete delete = new Delete(rowId, timestamp, null);
        region.delete(delete, null, true);
      }
    }


    checkIndexedScanWithDeletedRows(family, false, 4L, 0);
    checkIndexedScanWithDeletedRows(family, false, 3L, 8L, 4 * numRows / 5);


    region.flushcache();
    checkIndexedScanWithDeletedRows(family, true, 4L, 0);
    checkIndexedScanWithDeletedRows(family, true, 3L, 8L, 4 * numRows / 5);


    timestamp++;
    /**
     * New check - put some records back and verify
     */
    for (long i = 0; i < numRows / 10; i++) {
      Put put = new Put(Bytes.toBytes(random.nextLong() + "." + i));
      long value = 7L;
      put.add(family, qualLong, timestamp, Bytes.toBytes(value));
      put.add(family, qualDouble, timestamp, Bytes.toBytes((double) i));
      region.put(put);
    }


    checkIndexedScanWithDeletedRows(family, false, 7L, numRows / 5);
    checkIndexedScanWithDeletedRows(family, false, 4L, 0);

View Full Code Here

    //Setting up region
    String method = "testIdxRegionSplit";
    initIdxRegion(tableName, method, new HBaseConfiguration(), Pair.of(family,
      new IdxIndexDescriptor[]{indexDescriptor}));
    for (long i = 0; i < numRows; i++) {
      Put put = new Put(Bytes.toBytes(String.format("%08d", i)));
      put.add(family, qualLong, Bytes.toBytes(i));
      region.put(put);
    }


    IdxScan idxScan = new IdxScan();
    idxScan.addFamily(family);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.hadoop.hbase.client.Put

cc.twittertools.hbase.WordCountDAO

co.cask.cdap.data2.dataset2.lib.table.hbase.HBaseMetricsTable

co.cask.cdap.data2.dataset2.lib.table.hbase.HBaseOrderedTable

co.cask.cdap.data2.transaction.queue.hbase.HBaseQueueAdmin

co.cask.cdap.data2.transaction.stream.hbase.HBaseStreamFileConsumer

com.alibaba.wasp.fserver.EntityGroup

com.alibaba.wasp.messagequeue.MessageQueueClient

com.alibaba.wasp.meta.FMetaServicesImplWithoutRetry

com.continuuity.tephra.hbase94.TransactionAwareHTable

com.continuuity.tephra.hbase98.TransactionAwareHTable

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.