Hi Jakub, Thank you for reaching out. The sketch we suggest for set operations is typically the Theta Sketch as described in reference [8] of your linked paper. To help our understanding, could you write a brief list indicating similarities / differences between your proposed sketch and the theta sketch - i can't find a direct comparison in your paper? Such a list will help guide this discussion. For example, we often prioritise mergeability of sketches, is your sketch mergeable?
Cheers, Charlie On Fri, 29 Dec 2023 at 16:52, Jakub Lemiesz <[email protected]> wrote: > > Hi, > I'm wondering if my FastExpSketch algorithm described in the paper > > https://www.vldb.org/pvldb/vol16/p1967-lemiesz.pdf > <https://urldefense.com/v3/__https://www.vldb.org/pvldb/vol16/p1967-lemiesz.pdf__;!!Op6eflyXZCqGR5I!GSIoMjgCRa4VqXYdYvKgy5CAo8xQUnjxswj3Kk_DO2j3jVhvLHchamBZiM9tzGnrfPcWJqrsb4dCz4d4Rqadap_6CNFF6QF-JHMw$> > > would be of interest to this community? > > The algorithm is > 1) fast and memory efficient, > 2) can take into account the weights of the elements, > 3) allows for any sequence of set-theoretic operations. > > Best regards, > Jakub Lemiesz >
