.png){kind=icon}
返回
A distributed incremental in; mation acquisition model; large-scale text data
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-017-1498-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Timely discovering and acquiring in;
mation from incremental data on the Internet is a hot topic in a big data era. This paper presents a distributed incremental in;
mation acquisition model;
large-scale text data. To obtain a lower false positive rate and higher efficiency of the traditional Bloom filter, a distributed multidimensional Bloom filter is designed and proposed to cope with the deduplication of large-scale Web URL text data. Three methods related to Bloom filter were compared based on the false positive rate and response efficiency. The results show that the distributed incremental in;
mation acquisition model;
large-scale text data can achieve a high duplicate removal rate with a lower false positive rate.
Keyword:
Big data analytics
Deduplication of large-scale text data
Distributed incremental in
mation acquisition model
Distributed multidimensional bloom filter
False positive rate
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.1
论文数:
5.1K
被引数:
7.5K
机构
引用论文
.png){kind=icon}
Efficient top-k similarity document search utilizing distributed file systems and cosine similarity
PREAI
分享收藏Scatter-Gather-Merge: An efficient star-join query processing algorithm for data-parallel frameworks
PREAI
分享收藏A distributed frequent itemset mining algorithm using Spark for Big Data analytics基于Spark的大数据分布式频繁项集挖掘算法
PREAI
分享收藏分享收藏分享收藏
查看更多内容