Model Counting Meets Distinct Elements in a Data Stream-Reference-Cited by-同舟云学术

Model Counting Meets Distinct Elements in a Data Stream

Published:2022-05-31 Issue:1 Volume:51 Page:87-94
ISSN:0163-5808
Container-title:ACM SIGMOD Record
language:en
Short-container-title:SIGMOD Rec.

Author:

Pavan A.¹,Vinodchandran N. V.²,Bhattacharyya Arnab³,Meel Kuldeep S.³

Affiliation:

1. Iowa State University

2. University of Nebraska, Lincoln

3. National University of Singapore

Abstract

Constraint satisfaction problems (CSPs) and data stream models are two powerful abstractions to capture a wide variety of problems arising in different domains of computer science. Developments in the two communities have mostly occurred independently and with little interaction between them. In this work, we seek to investigate whether bridging the seeming communication gap between the two communities may pave the way to richer fundamental insights. To this end, we focus on two foundational problems: model counting for CSPs and computation of zeroth frequency moments (F0) for data streams.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems,Software

Link

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

Reference33 articles.

1. The Space Complexity of Approximating the Frequency Moments

2. Counting Distinct Elements in a Data Stream

3. Z. Bar-Yossef , R. Kumar , and D. Sivakumar . Reductions in streaming algorithms, with an application to counting triangles in graphs . In Proc. of SODA , pages 623 -- 632 . ACM/SIAM , 2002 . Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. of SODA, pages 623--632. ACM/SIAM, 2002.

4. J. L. Carter and M. N. Wegman . Universal classes of hash functions . In Proceedings of the ninth annual ACM symposium on Theory of computing , pages 106 -- 112 . ACM, 1977 . J. L. Carter and M. N. Wegman. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 106--112. ACM, 1977.

5. S. Chakraborty , K. S. Meel , and M. Y. Vardi . Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls . In Proc. of IJCAI , 2016 . S. Chakraborty, K. S. Meel, and M. Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls. In Proc. of IJCAI, 2016.