An incremental algorithm for computing ranked full disjunctions-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An incremental algorithm for computing ranked full disjunctions

Published:2007-06 Issue:4 Volume:73 Page:648-668
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Cohen Sara,Sagiv Yehoshua

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference16 articles.

1. Outerjoins as disjunctions;Galindo-Legaria,1994

2. Integrating information by outerjoins and full disjunctions;Rajaraman,1996

3. Computing full disjunctions;Kanza,2003

4. Optimal aggregation algorithms for middleware;Fagin,2001

5. Evaluating top-k queries over web-accessible databases;Marian;ACM Trans. Database Systems,2004

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integrating Data Lake Tables;Proceedings of the VLDB Endowment;2022-12

2. (Almost) all of entity resolution;Science Advances;2022-03-25

3. A Practical Approach to Proper Inference with Linked Data;The American Statistician;2022-03-23

4. Parallelizing Computations of Full Disjunctions;Big Data Research;2019-09

5. Combined geo-social search: computing top-k join queries over incomplete information;GeoInformatica;2017-03-25

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP