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

Artur Galiullin

dblp:117/3804 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0002-4872-1486ORCID · corroborated

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

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

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 · 78% Database theory · 22%

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

TopicWeightPapersLastEvidence papers
Database theory › integrity constraints
conditional functional dependencies
0.212014
Sampling from repairs of conditional functional dependency violations · VLDB J. 2014
Data integration and cleaning › data preprocessing › data cleaning
data repair
0.212014
Sampling from repairs of conditional functional dependency violations · VLDB J. 2014
Data integration and cleaning › data preprocessing › data cleaning › data repair
constraint-based data repair
0.212013
On the relative trust between inconsistent data and inaccurate constraints · ICDE 2013
Data integration and cleaning › data preprocessing
data cleaning
0.212013
On the relative trust between inconsistent data and inaccurate constraints · ICDE 2013
Data integration and cleaning › data preprocessing › data cleaning › data repair
functional dependency repair
0.212013
On the relative trust between inconsistent data and inaccurate constraints · ICDE 2013
YearPublicationVenuePosition
2014 Sampling from repairs of conditional functional dependency violations
George Beskales, Ihab F. Ilyas, Lukasz Golab, Artur Galiullin
VLDB J.4
2013 On the relative trust between inconsistent data and inaccurate constraints
abstract
Functional dependencies (FDs) specify the intended data semantics while violations of FDs indicate deviation from these semantics. In this paper, we study a data cleaning problem in which the FDs may not be completely correct, e.g., due to data evolution or incomplete knowledge of the data semantics. We argue that the notion of relative trust is a crucial aspect of this problem: if the FDs are outdated, we should modify them to fit the data, but if we suspect that there are problems with the data, we should modify the data to fit the FDs. In practice, it is usually unclear how much to trust the data versus the FDs. To address this problem, we propose an algorithm for generating non-redundant solutions (i.e., simultaneous modifications of the data and the FDs) corresponding to various levels of relative trust. This can help users determine the best way to modify their data and/or FDs to achieve consistency.
George Beskales, Ihab F. Ilyas, Lukasz Golab, Artur Galiullin
ICDE4