Near-Optimal Approximate Duplicate-Detection in Data Streams Over Sliding Windows for the Uniform Query Frequency or Membership Likelihood.
Xiujun WangXiao ZhengZhe DangXuangou WuBaohua ZhaoPublished in: CBD (2014)
Keyphrases
- sliding window
- duplicate detection
- data streams
- heavy hitters
- data cleaning
- streaming data
- response time
- fixed size
- space efficient
- stream data
- query processing
- continuous queries
- record linkage
- outlier detection
- graph search
- query evaluation
- database
- concept drift
- limited memory
- sensor networks
- variable size
- data sets
- query execution
- data sources
- range queries
- data processing
- data structure
- database systems
- high speed data streams
- privacy preserving
- databases
- walsh hadamard transform