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

Shailesh Agarwal

dblp:53/6318 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-author

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
1 paper
Data integration and cleaning · 50% Data models and query languages · 50%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning › data quality
inconsistent data
0.011995
Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases · ICDE 1995
Data models and query languages
relational model
0.011995
Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases · ICDE 1995

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

query optimization · 0.0flexible relation algebra · 0.0
YearPublicationVenuePosition
1995 Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases
abstract
In this work we address the problem of dealing with data inconsistencies while integrating data sets derived from multiple autonomous relational databases. The fundamental assumption in the classical relational model is that data is consistent and hence no support is provided for dealing with inconsistent data. Due to this limitation of the classical relational model, the semantics for detecting, representing, and manipulating inconsistent data have to be explicitly encoded in the applications by the application developer. In this paper, we propose the flexible relational model, which extends the classical relational model by providing support for inconsistent data. We present a flexible relation algebra, which provides semantics for database operations in the presence of potentially inconsistent data. Finally, we discuss issues raised for query optimization when the data may be inconsistent.>
Shailesh Agarwal, Arthur M. Keller, Gio Wiederhold, Krishna Saraswat
ICDE1