Redian新闻
>
有没有这方面的Application?
avatar
有没有这方面的Application?# CS - 计算机科学
t*t
1
Top-k queries are popular in data stream processing. For example, in a system
with multiple data streams, the users may ask "return the 10 streams with the
highest readings". Now we figured out a way to handle a relaxed version of the
above query: "return the top 10 streams with an error bound of 2", meaning
that the true rank of the 10 returned streams can be as high as 10 + 2 = 12.
My question is: are there any real-world applications for this kind of
queries?
One paper mentioned that some of
avatar
f*h
2
Indeed, I am even curious of the applications of streams.
There are some, but not large, seems to me.

system
the
the

【在 t******t 的大作中提到】
: Top-k queries are popular in data stream processing. For example, in a system
: with multiple data streams, the users may ask "return the 10 streams with the
: highest readings". Now we figured out a way to handle a relaxed version of the
: above query: "return the top 10 streams with an error bound of 2", meaning
: that the true rank of the 10 returned streams can be as high as 10 + 2 = 12.
: My question is: are there any real-world applications for this kind of
: queries?
: One paper mentioned that some of

avatar
i*y
3
What do you mean "readings"?
Are you ranking streams or ranking the records in streams?
It seems that you are ranking the streams among multiple streams, which
doesn't appear to be very real to me.
However, if you want to rank the records in a stream, I believe top-k query is
useful, but can be very hard.

system
the
the

【在 t******t 的大作中提到】
: Top-k queries are popular in data stream processing. For example, in a system
: with multiple data streams, the users may ask "return the 10 streams with the
: highest readings". Now we figured out a way to handle a relaxed version of the
: above query: "return the top 10 streams with an error bound of 2", meaning
: that the true rank of the 10 returned streams can be as high as 10 + 2 = 12.
: My question is: are there any real-world applications for this kind of
: queries?
: One paper mentioned that some of

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。