On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms-Reference-Cited by-同舟云学术

On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms

Published:2023-06-18 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Deng Shiyuan¹^ORCID,Lu Shangqi¹^ORCID,Tao Yufei²^ORCID

Affiliation:

1. Chinese University of Hong Kong, Hong Kong, China

2. Chinese University of Hong Kong, Hong Kong, Hong Kong

Funder

HKRGC

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3584372.3588666

Reference59 articles.

1. If the Current Clique Algorithms are Optimal, So is Valiant's Parser

2. Amir Abboud , Loukas Georgiadis , Giuseppe F. Italiano , Robert Krauthgamer , Nikos Parotsidis , Ohad Trabelsi , Przemyslaw Uznanski , and Daniel Wolleb-Graf . Faster algorithms for all-pairs bounded min-cuts . In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP) , pages 7: 1 -- 7 :15, 2019 . Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, and Daniel Wolleb-Graf. Faster algorithms for all-pairs bounded min-cuts. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 7:1--7:15, 2019.

3. Join synopses for approximate query answering

4. Range Searching

5. BlinkDB

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

1. Reservoir Sampling over Joins;Proceedings of the ACM on Management of Data;2024-05-29

2. Data distribution tailoring revisited: cost-efficient integration of representative data;The VLDB Journal;2024-04-12

3. Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18