Home > Computer Engineering > Quizzes > Big Data: Mining Data Streams
Big Data: Mining Data Streams
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 50% Most missed: “Which query operator is unable to produce an answer until it has seen its entire…”
Big Data: Mining Data Streams
Time left 00:00
17 Questions

1. ______________query is one that is supplied to the Dsms before any relevant data arrived
2. Which query operator is unable to produce an answer until it has seen its entire input:
3. Flajolet-Martin algorithm approximates the number of unique objects in a stream or a database in how many passes?
4. Flajolet-Martin algorithm approximates the number of unique objects in a stream or a database in how many passes?
5. Bloom filter was proposed by
6. Probability of a false positive in Bloom Filters  depends on
7. The files on disks or records in databases need to be stored in Bloom filter as
8. Sorting used for query processing  is an example of :
9. ______________query is one that is supplied to the Dsms before any relevant data arrived
10. It is an array of bits, together with a number of hash functions
11. If the stream contains n elements with m of them unique, the FM algorithm needs a  memory of .
12. Calculate h(3) , given   S=1,3,2,1,2,3,4,3,1,2,3,1 and h(x)=(6x+1) mod 5
13. Bloom filter was proposed by
14. Which query operator is unable to produce an answer until it has seen its entire input:
15. Sorting used for query processing  is an example of :
16. A simple space-efficient randomized data structure for representing a set in order to support membership queries
17. What is important when the input rate of facebook data is controlled externally: