zoukankan      html  css  js  c++  java
  • 熟悉常用的HBase操作

    1. 以下关系型数据库中的表和数据,要求将其转换为适合于HBase存储的表并插入数据:

    学生表(Student)(不包括最后一列)

    学号(S_No)

    姓名(S_Name)

    性别(S_Sex)

    年龄(S_Age)

    课程(course)

    2015001

    Zhangsan

    male

    23

     

    2015003

    Mary

    female

    22

     

    2015003

    Lisi

    male

    24

    数学(Math)85

    create 'Student',{NAME=>'S_No',VERSIONS=>5},{NAME=>'S_Name',VERSIONS=>5},{NAME=>'S_Sex',VERSIONS=>5},{NAME=>'S_Age',VERSIONS=>5}
    put 'Student','2015001','sname','Zhangsan'
    put 'Student','2015001','ssex','male'
    put 'Student','2015001','sage','23'
    put 'Student','2015002','sname','Mary'
    put 'Student','2015002','ssex','female'
    put 'Student','2015002','sage','22'
    put 'Student','2015003','sname','Lisi'
    put 'Student','2015003','ssex','male'
    put 'Student','2015003','sage','24

      

    2. 用Hadoop提供的HBase Shell命令完成相同任务:

    • 列出HBase所有的表的相关信息;list
    • 在终端打印出学生表的所有记录数据;
    • scan 'Student'
    • 向学生表添加课程列族;
    • alter 'Student','NAME'=>'course'
    • 向课程列族添加数学列并登记成绩为85;
    • put 'Student','3','course:Math','85'
    • 统计表的行数;count 's1'
    • 清空指定的表的所有记录数据;truncate 's1'
    • truncate 'Student'

    3. 用Python编写WordCount程序任务

    程序

    WordCount

    输入

    一个包含大量单词的文本文件

    输出

    文件中每个单词及其出现次数(频数),并按照单词字母顺序排序,每个单词和其频数占一行,单词和频数之间有间隔

    1. 编写map函数,reduce函数
    2. #!/usr/bin/env python
      import sys
      for i in stdin:
          i = i.strip()
          words = i.split()
          for word in words:
          print '%s	%s' % (word,1)
      #!/usr/bin/env python
      from operator import itemgetter
      import sys
      
      current_word = None
      current_count = 0
      word = None
      
      for i in stdin:
          i = i.strip()
          word, count = i.split('	',1)
          try:
          count = int(count)
          except ValueError:
          continue
      
          if current_word == word:
          current_count += count 
          else:
          if current_word:
              print '%s	%s' % (current_word, current_count)
          current_count = count
          current_word = word
      
      if current_word == word:
          print '%s	%s' % (current_word, current_count)
    3. 将其权限作出相应修改
    4. 授予权限
    5. chmod a+x /home/hadoop/reduce.py
    6. 本机上测试运行代码
    7. echo "foo foo quux labs foo bar quux" | /home/hadoop/wc/mapper.py
      
      echo "foo foo quux labs foo bar quux" | /home/hadoop/wc/mapper.py | sort -k1,1 | /home/hadoop/wc/reducer.p
    8. 下载并上传文件到hdfs上
    9. cd  /home/hadoop/wc
      wget http://www.gutenberg.org/files/5000/5000-8.txt
      wget http://www.gutenberg.org/cache/epub/20417/pg20417.txt
      cd /usr/hadoop/wc
      hdfs dfs -put /home/hadoop/hadoop/gutenberg/*.txt /user/hadoop/input
  • 相关阅读:
    证明 O(n/1+n/2+…+n/n)=O(nlogn)
    ZOJ 3623 Battle Ships DP
    ZOJ 3631 Watashi's BG DFS
    ZOJ 3622 Magic Number 打表找规律
    poj 1088 滑雪 记忆化搜索
    poj 1273 Drainage Ditches 网络流最大流基础
    Codeforces Round #243 (Div. 1)A. Sereja and Swaps 暴力
    UVALive 5059 C
    Codeforces Round #295 (Div. 2)C
    Codeforces Round #295 (Div. 2)B
  • 原文地址:https://www.cnblogs.com/hhmk/p/8980512.html
Copyright © 2011-2022 走看看