Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Gatterbauer, Wolfgang"'
Autor:
Gatterbauer, Wolfgang
Query formulation is increasingly performed by systems that need to guess a user's intent (e.g. via spoken word interfaces). But how can a user know that the computational agent is returning answers to the "right" query? More generally, given that re
Externí odkaz:
http://arxiv.org/abs/2404.00007
Autor:
Gatterbauer, Wolfgang, Dunne, Cody
Comparing relational languages by their logical expressiveness is well understood. Less well understood is how to compare relational languages by their ability to represent relational query patterns. Indeed, what are query patterns other than "a cert
Externí odkaz:
http://arxiv.org/abs/2401.04758
We analyze a general problem in a crowd-sourced setting where one user asks a question (also called item) and other users return answers (also called labels) for this question. Different from existing crowd sourcing work which focuses on finding the
Externí odkaz:
http://arxiv.org/abs/2401.00013
Autor:
Gatterbauer, Wolfgang
Query formulation is increasingly performed by systems that need to guess a user's intent (e.g. via spoken word interfaces). But how can a user know that the computational agent is returning answers to the "right" query? More generally, given that re
Externí odkaz:
http://arxiv.org/abs/2308.10319
We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax as the final layer. We identify a bias phenomenon that can arise from
Externí odkaz:
http://arxiv.org/abs/2307.00465
Autor:
Tziavelis, Nikolaos, Carmeli, Nofar, Gatterbauer, Wolfgang, Kimelfeld, Benny, Riedewald, Mirek
We present efficient algorithms for Quantile Join Queries, abbreviated as %JQ. A %JQ asks for the answer at a specified relative position (e.g., 50% for the median) under some ordering over the answers to a Join Query (JQ). Our goal is to avoid mater
Externí odkaz:
http://arxiv.org/abs/2305.16525
Autor:
Makhija, Neha, Gatterbauer, Wolfgang
Publikováno v:
Proc. ACM Manag. Data 1, 4 (SIGMOD), Article 228 (December 2023), 43 pages
Resilience is one of the key algorithmic problems underlying various forms of reverse data management (such as view maintenance, deletion propagation, and various interventions for fairness): What is the minimal number of tuples to delete from a data
Externí odkaz:
http://arxiv.org/abs/2212.08898
Autor:
Khatiwada, Aamod, Fan, Grace, Shraga, Roee, Chen, Zixuan, Gatterbauer, Wolfgang, Miller, Renée J., Riedewald, Mirek
Existing techniques for unionable table search define unionability using metadata (tables must have the same or similar schemas) or column-based metrics (for example, the values in a table should be drawn from the same domain). In this work, we intro
Externí odkaz:
http://arxiv.org/abs/2209.13589
Query Visualization (QV) is the problem of transforming a given query into a graphical representation that helps humans understand its meaning. This task is notably different from designing a Visual Query Language (VQL) that helps a user compose a qu
Externí odkaz:
http://arxiv.org/abs/2208.01613
We study ranked enumeration for Conjunctive Queries (CQs) where the answers are ordered by a given ranking function (e.g., an ORDER BY clause in SQL). We develop "any-k" algorithms, which, without knowing the number k of desired answers, push down th
Externí odkaz:
http://arxiv.org/abs/2205.05649