Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Zeevi, Gal"'
In data exploration, executing complex non-aggregate queries over large databases can be time-consuming. Our paper introduces a novel approach to address this challenge, focusing on finding an optimized subset of data, referred to as the approximatio
Externí odkaz:
http://arxiv.org/abs/2401.17059
