Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matanya Freiman

dblp:328/5882 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-9998-4403ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data integration and cleaning · 46% Data models and query languages · 37% Database theory · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages
uncertain data management
1.222023
Query-Guided Resolution in Uncertain Databases · Proc. ACM Manag. Data 2023
ActivePDB: Active Probabilistic Databases · Proc. VLDB Endow. 2022
Data integration and cleaning › data preprocessing
data cleaning
0.712023
Query-Guided Resolution in Uncertain Databases · Proc. ACM Manag. Data 2023
Data integration and cleaning › data preprocessing › data cleaning
query-driven data cleaning
0.712023
Query-Guided Resolution in Uncertain Databases · Proc. ACM Manag. Data 2023
Database theory
probabilistic databases
0.612022
ActivePDB: Active Probabilistic Databases · Proc. VLDB Endow. 2022
Data integration and cleaning
data provenance
0.212023
Query-Guided Resolution in Uncertain Databases · Proc. ACM Manag. Data 2023

Methods — techniques the papers use, named apart from their topics

active learning · 1.2
YearPublicationVenuePosition
2023 Query-Guided Resolution in Uncertain Databases
abstract
We present a novel framework for uncertain data management. We start with a database whose tuple correctness is uncertain and an oracle that can resolve the uncertainty, i.e., decide if a tuple is correct or not. Such an oracle may correspond, e.g., to a data expert or to a crowdsourcing platform. We wish to use the oracle to clean the database with the goal of ensuring the correct answer for specific mission-critical queries. To avoid the prohibitive cost of cleaning the entire database and to minimize the expected number of calls to the oracle, we must carefully select tuples whose resolution would suffice to resolve the uncertainty in query results. In other words, we need a query-guided process for the resolution of uncertain data. We develop an end-to-end solution to this problem, based on the derivation of query answers and on correctness probabilities for the uncertain data. At a high level, we first track Boolean provenance to identify which input tuples contribute to the derivation of each output tuple, and in what ways. We then design an active learning solution for iteratively choosing tuples to resolve, based on the provenance structure and on an evolving estimation of tuple correctness probabilities. We conduct an extensive experimental study to validate our framework in different use cases.
Osnat Drien, Matanya Freiman, Antoine Amarilli, Yael Amsterdamer
Proc. ACM Manag. Data2
2022 ActivePDB: Active Probabilistic Databases
abstract
We present a novel framework for uncertain data management, called ActivePDB. We are given a relational probabilistic database, where each tuple is correct with some probability; e.g., a database constructed from textual data using information extraction. We are now given a query and we want to determine the correctness of its results. Unlike probabilistic databases, we have an oracle that can resolve the uncertainty, such as a domain expert that can verify data against their sources. Since verification may be costly, our goal is to determine the correct output of the query, while asking the oracle to verify as few tuples as possible. ActivePDB provides an end-to-end solution to this problem. In a nutshell, we first track provenance to identify which input tuples contribute to the derivation of each output tuple, and in what ways. We then design an active learning solution to iteratively choose tuples to be verified based on the provenance structure and on an evolving estimation of the probability of the tuples correctness. We will demonstrate ActivePDB in the context of the NELL database of extracted facts, allowing participants to both pose queries and play the role of oracles.
Osnat Drien, Matanya Freiman, Yael Amsterdamer
Proc. VLDB Endow.2