<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>Approximate Query Answering over Open Data</dc:title><dc:creator>Zhang, Mengqi; Mundra, Pranay; Chikweze, Chukwubuikem; Nargesian, Fatemeh; Weikum, Gerhard</dc:creator><dc:corporate_author/><dc:editor/><dc:description>Open knowledge, including open data and publicly available knowledge bases, offers a rich opportunity for data scientists for analysis and query answering, but comes with big obstacles due to the diverse, noisy, and incomplete nature of its data eco-system. This paper proposes a vision for enabling approximate QUery answering over Open Knowledge (Quok), with a focus on supporting analytic tasks that involve identifying relevant data and computing aggregations. We define the problem, outline a system architecture, and discuss challenges and approaches to taming the uncertainty and incompleteness of open knowledge.</dc:description><dc:publisher/><dc:date>2023-06-18</dc:date><dc:nsf_par_id>10465859</dc:nsf_par_id><dc:journal_name>HILDA'23: The SIGMOD 2023 Workshop on Human-in-the-Loop Data Analytics</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation>1 to 3</dc:page_range_or_elocation><dc:issn/><dc:isbn/><dc:doi>https://doi.org/10.1145/3597465.3605227</dc:doi><dcq:identifierAwardId>2107050</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>