diff --git a/README.md b/README.md
index a4824db960c0b967c036e1929d37e41838804e2c..f44346b93a996aa6b9edf90816cbdbe09008e0f1 100644
--- a/README.md
+++ b/README.md
@@ -1,39 +1,19 @@
 # 大数据存储系统与管理作业2022
 
-本仓库用于提交**大数据存储系统与管理作业2022**。
+U201914987-CS1903-陆云龙
 
-# 使用方法
+	--课程
 
-1. 开启Github账号，用上Git
+		---BloomFilter代码
 
-    * Git入门可参考 <https://github.com/cs-course/git-tutorial>
-    * git - 简明指南 <http://rogerdudler.github.io/git-guide/index.zh.html>
-    * 未来自学
-        * 如何高效利用GitHub <http://www.yangzhiping.com/tech/github.html>
-        * Github简明教程 <http://www.runoob.com/w3cnote/git-guide.html>
-        * 图解Git <http://marklodato.github.io/visual-git-guide/index-zh-cn.html>
+		---课程报告.doc
 
-2. Fork此仓库至自己账号
+		---课程报告.pdf
 
-    * Fork功能位于页面右上角
-    * Fork操作将自动跳转进自己账号中"克隆"仓库
+	--实验
 
-3. 将仓库抓取至本地
+		---测试数据data.xlsx
 
-    * 选择一个工作目录用于存放本地仓库，开终端窗口进入目录   
-    * 使用命令 `git clone git@github.com:(用户名)/iot-storage-experiment-assignment-2022.git`
+		---课程报告.doc
 
-4. 在本地仓库中，用 :point_right: **_自己学号_** :exclamation: 建立文件夹
-
-    * 在这个文件夹里面编写报告，保存
-    * 用`git commit`操作来提交，`git push`操作来推送进自己Fork之仓库
-
-5. 基本完稿即可发起Pull请求
-
-    * Pull请求即为向原始仓库要求合并，即**交作业**
-    * 教师完成合并后作业将呈现于原始作业仓库中，完成提交
-    * 后续如果有更新，还可以提交、推送后再次发起Pull请求
-
-6. 作业提交样式参考
-
-    * <https://github.com/cs-course/iot-storage-experiment-assignment-2019/tree/master/U201614890>
+		---课程报告.pdf
diff --git "a/U201914987/\345\256\236\351\252\214/data.xlsx" "b/U201914987/\345\256\236\351\252\214/data.xlsx"
new file mode 100644
index 0000000000000000000000000000000000000000..cdc5b899cb242198aef5146ce776f83a30357302
Binary files /dev/null and "b/U201914987/\345\256\236\351\252\214/data.xlsx" differ
diff --git "a/U201914987/\345\256\236\351\252\214/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206\345\256\236\351\252\214.doc" "b/U201914987/\345\256\236\351\252\214/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206\345\256\236\351\252\214.doc"
new file mode 100644
index 0000000000000000000000000000000000000000..358eb5ee98db29840e15fd65fdfc0fcf792a2fdf
Binary files /dev/null and "b/U201914987/\345\256\236\351\252\214/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206\345\256\236\351\252\214.doc" differ
diff --git "a/U201914987/\345\256\236\351\252\214/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206\345\256\236\351\252\214.pdf" "b/U201914987/\345\256\236\351\252\214/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206\345\256\236\351\252\214.pdf"
new file mode 100644
index 0000000000000000000000000000000000000000..24b4aa8ec420649c993aa1896cd47be0f033ee9d
Binary files /dev/null and "b/U201914987/\345\256\236\351\252\214/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206\345\256\236\351\252\214.pdf" differ
diff --git "a/U201914987/\350\257\276\347\250\213/BloomFilter/MultiBloomFilter.java" "b/U201914987/\350\257\276\347\250\213/BloomFilter/MultiBloomFilter.java"
new file mode 100644
index 0000000000000000000000000000000000000000..3f5fe7be45eda965d488abca13fdc2ea9bb5dfb2
--- /dev/null
+++ "b/U201914987/\350\257\276\347\250\213/BloomFilter/MultiBloomFilter.java"
@@ -0,0 +1,85 @@
+package BloomFilter;
+
+import java.util.BitSet;
+
+public class MultiBloomFilter {
+    //设置容量
+    private static final int SIZE=32;
+    //各个hash函数的应当有不同的seed，选取素数2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,91,101,103
+    private static final int[][] seeds={{3,7,13},
+            {5,11,11},{1,2,3}};
+
+    private BitSet[] bits=new BitSet[seeds.length];
+    private MultiSimpleHash[][] func=new MultiSimpleHash[seeds.length][seeds[0].length];
+
+    public MultiBloomFilter(){
+        for(int i=0;i<seeds.length;++i){
+            bits[i]=new BitSet();
+        }
+
+        //建立各个hash函数
+        for(int i=0;i<seeds.length;++i){
+            for(int j=0;j<seeds[0].length;++j){
+                func[i][j]=new MultiSimpleHash(SIZE,seeds[i][j]);
+            }
+        }
+    }
+
+    //添加
+    public void add(String[] val){
+        int n=val.length;
+        for(int i=0;i<n;++i){
+            //第i维数据hash存储到第i个BitSet
+            for(MultiSimpleHash f:func[i]){
+                bits[i].set(f.hash(val[i]),true);
+            }
+        }
+    }
+
+    //判断是否存在
+    public boolean contains(String[] val){
+        boolean ans=true;
+        int n=val.length;
+        for(int i=0;i<n;++i) {
+            for (MultiSimpleHash f : func[i]) {
+                ans = ans && bits[i].get(f.hash(val[i]));
+            }
+        }
+        return ans;
+    }
+
+    public static void main(String []args){
+        String[] test={"123","456"};
+        MultiBloomFilter bloomFilter=new MultiBloomFilter();
+        System.out.println(bloomFilter.contains(test));
+        bloomFilter.add(test);
+        System.out.println(bloomFilter.contains(test));
+        String[] notIn={"abc","def"};
+        System.out.println(bloomFilter.contains(notIn));
+        return;
+    }
+}
+
+class MultiSimpleHash{
+    //过滤器容量
+    private int space;
+    private int seed;
+
+    public MultiSimpleHash(int space,int seed){
+        this.space=space;
+        this.seed=seed;
+    }
+
+    public int hash(String val){
+        int result=0;
+        int len=val.length();
+        for(int i=0;i<len;++i){
+            result=seed*result+val.charAt(i);
+        }
+
+        //与运算两位同时为1，结果才为1。确保计算出来的结果不会超过size
+        return (space-1)&result;
+    }
+}
+
+docker build -t openstack-swift-docker .
\ No newline at end of file
diff --git "a/U201914987/\350\257\276\347\250\213/BloomFilter/SingleBloomFilter.java" "b/U201914987/\350\257\276\347\250\213/BloomFilter/SingleBloomFilter.java"
new file mode 100644
index 0000000000000000000000000000000000000000..be189090d431fad4d52ab9478579308f954240f3
--- /dev/null
+++ "b/U201914987/\350\257\276\347\250\213/BloomFilter/SingleBloomFilter.java"
@@ -0,0 +1,70 @@
+package BloomFilter;
+
+import java.util.BitSet;
+
+public class SingleBloomFilter {
+
+    //设置容量
+    private static final int SIZE=32;
+    //各个hash函数的应当有不同的seed，选取素数
+    private static final int[] seeds={3,5,7,11,13};
+
+    private BitSet bits=new BitSet(SIZE);
+    private SingleSimpleHash[] func=new SingleSimpleHash[seeds.length];
+
+    public SingleBloomFilter(){
+        //建立各个hash函数
+        for(int i=0;i<seeds.length;++i){
+            func[i]=new SingleSimpleHash(SIZE,seeds[i]);
+        }
+    }
+
+    //添加
+    public void add(String val){
+        for(SingleSimpleHash f:func){
+            bits.set(f.hash(val),true);
+        }
+    }
+
+    //判断是否存在
+    public boolean contains(String val){
+        boolean ans=true;
+        for(SingleSimpleHash f:func){
+            ans=ans&&bits.get(f.hash(val));
+        }
+        return ans;
+    }
+
+    public static void main(String []args){
+        String test="this is a test";
+        SingleBloomFilter bloomFilter=new SingleBloomFilter();
+        System.out.println(bloomFilter.contains(test));
+        bloomFilter.add(test);
+        System.out.println(bloomFilter.contains(test));
+        System.out.println(bloomFilter.contains("this is test2"));
+        return;
+    }
+}
+
+class SingleSimpleHash{
+
+    //过滤器容量
+    private int space;
+    private int seed;
+
+    public SingleSimpleHash(int space,int seed){
+        this.space=space;
+        this.seed=seed;
+    }
+
+    public int hash(String val){
+        int result=0;
+        int len=val.length();
+        for(int i=0;i<len;++i){
+            result=seed*result+val.charAt(i);
+        }
+
+        //与运算两位同时为1，结果才为1。确保计算出来的结果不会超过size
+        return (space-1)&result;
+    }
+}
diff --git "a/U201914987/\350\257\276\347\250\213/BloomFilter/Test.java" "b/U201914987/\350\257\276\347\250\213/BloomFilter/Test.java"
new file mode 100644
index 0000000000000000000000000000000000000000..cb551dd0119c19d7eb11fb1984959522337be2ef
--- /dev/null
+++ "b/U201914987/\350\257\276\347\250\213/BloomFilter/Test.java"
@@ -0,0 +1,73 @@
+package BloomFilter;
+
+import java.io.BufferedReader;
+import java.io.FileReader;
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.List;
+
+public class Test {
+    public static void main(String []args){
+        BufferedReader br1=null;
+        BufferedReader br2=null;
+        List input=new ArrayList<String>();
+        List test=new ArrayList<String>();
+        try{
+            br1=new BufferedReader(new FileReader("D:\\java\\BloomFilter\\src\\BloomFilter\\input.txt"));
+            br2=new BufferedReader(new FileReader("D:\\java\\BloomFilter\\src\\BloomFilter\\test.txt"));
+            String line=br1.readLine();
+            while(line!=null){
+                input.add(line);
+                line= br1.readLine();
+            }
+            String cur= br2.readLine();
+            while(cur!=null){
+                test.add(cur);
+                cur=br2.readLine();
+            }
+        }catch (IOException e) {
+            e.printStackTrace();
+        }
+        finally {
+            try {
+                if (br1 != null) {
+                    br1.close();
+                }
+                if (br2 != null) {
+                    br2.close();
+                }
+            }catch (IOException f){
+                f.printStackTrace();
+            }
+        }
+        int n=input.size();
+        MultiBloomFilter bloomFilter=new MultiBloomFilter();
+        String[] temp=new String[2];
+        for(int i=0;i<n;i+=2){
+            temp[0]=input.get(i).toString();
+            temp[1]=input.get(i+1).toString();
+            bloomFilter.add(temp);
+        }
+
+        n=test.size();
+        boolean judge;
+        String ans;
+        int wrong=0;
+        float total=n/3;
+        for(int i=0;i<n;i+=3){
+            temp[0]=test.get(i).toString();
+            temp[1]=test.get(i+1).toString();
+            ans=test.get(i+2).toString();
+            judge=bloomFilter.contains(temp);
+            if(Boolean.parseBoolean(ans)==judge){
+                System.out.printf("input: [[%-16s],[%-16s]]     expect: %-5s      ans: %-5s\n",temp[0],temp[1],ans,judge);
+            }
+            else{
+                System.out.printf("input: [[%-16s],[%-16s]]     expect: %-5s      ans: %-5s\n",temp[0],temp[1],ans,judge);
+                ++wrong;
+            }
+        }
+        System.out.printf("error: %f\n",wrong/total);
+        return;
+    }
+}
diff --git "a/U201914987/\350\257\276\347\250\213/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206.docx" "b/U201914987/\350\257\276\347\250\213/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206.docx"
new file mode 100644
index 0000000000000000000000000000000000000000..9cdb54c96ad5ffcd11e58ff2641c019572d7eb41
Binary files /dev/null and "b/U201914987/\350\257\276\347\250\213/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206.docx" differ
diff --git "a/U201914987/\350\257\276\347\250\213/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206.pdf" "b/U201914987/\350\257\276\347\250\213/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206.pdf"
new file mode 100644
index 0000000000000000000000000000000000000000..538217991bda3d1c07840c6c5354e83ac041750d
Binary files /dev/null and "b/U201914987/\350\257\276\347\250\213/\345\244\247\346\225\260\346\215\256\345\255\230\345\202\250\347\263\273\347\273\237\344\270\216\347\256\241\347\220\206.pdf" differ