AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation.

arXiv: Data Structures and Algorithms, (2016)

被引用5|浏览32
EI
下载 PDF 全文
引用

摘要

We study the problem of estimating the value of sums of the form $S_p triangleq sum binom{x_i}{p}$ when one has the ability to sample $x_i geq 0$ with probability proportional to its magnitude. When $p=2$, this problem is equivalent to estimating the selectivity of a self-join query in database systems when one can sample rows randomly. W...更多

代码

数据

作者
Maryam Aliakbarpour
Maryam Aliakbarpour
Amartya Shankha Biswas
Amartya Shankha Biswas
Themistoklis Gouleakis
Themistoklis Gouleakis
您的评分 :
0

 

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科