2019 28th International Conference on Computer Communication and Networks (ICCCN) 2019
DOI: 10.1109/icccn.2019.8847153
|View full text |Cite
|
Sign up to set email alerts
|

Approximate Range Emptiness in Constant Time for IoT Data Streams over Sliding Windows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…Then, it is easy to see that at most 192 × n log 2 (N ) comparisons are needed for finding the filter-string that is shared by the largest number of tags of P in Step-11. 7 Obviously, at most n filter-strings are needed for picking P from S. Therefore, the second stage of TagSP needs at most 192 × n log 2 (N ) × n = O(n 2 log 2 (N )) comparisons.…”
Section: Solving the Tag-selection Problem By Using Multiple Selecmentioning
confidence: 99%
“…Then, it is easy to see that at most 192 × n log 2 (N ) comparisons are needed for finding the filter-string that is shared by the largest number of tags of P in Step-11. 7 Obviously, at most n filter-strings are needed for picking P from S. Therefore, the second stage of TagSP needs at most 192 × n log 2 (N ) × n = O(n 2 log 2 (N )) comparisons.…”
Section: Solving the Tag-selection Problem By Using Multiple Selecmentioning
confidence: 99%