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

Ravi Gummadi

dblp:21/2971 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning › dependency discovery
approximate functional dependency
0.112010
SMARTINT: A system for answering queries over web databases using attribute dependencies · ICDE 2010
Data integration and cleaning › web data management
web database querying
0.112010
SMARTINT: A system for answering queries over web databases using attribute dependencies · ICDE 2010

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

tree-based join · 0.1approximate functional dependencies · 0.1
YearPublicationVenuePosition
2012 SMARTINT: using mined attribute dependencies to integrate fragmented web databases
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, Sanil Salvi, Subbarao Kambhampati
J. Intell. Inf. Syst.1
2010 SMARTINT: A system for answering queries over web databases using attribute dependencies
abstract
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. At first blush this is just the inverse of traditional database normalization problem - rather than go from a universal relation to normalized tables, we want to reconstruct the universal relation given the tables (sources). The standard way of reconstructing the entities will involve joining the tables. Unfortunately, because of the autonomous and decentralized way in which the sources are populated, they often do not have Primary Key - Foreign Key relations. While tables do share attributes, naive joins over these shared attributes can result in reconstruction of many spurious entities thus seriously compromising precision. Our system, SMARTINT is aimed at addressing the problem of data integration in such scenarios. Given a query, our system uses the Approximate Functional Dependencies(AFDs) to piece together a tree of relevant tables and schemas for joining them. The result tuples produced by our system are able to strike a favorable balance between precision and recall.
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, Sanil Salvi, Subbarao Kambhampati
ICDE1
2004 Algorithms for Satisfiability using Independent Sets of Variables
Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy
SAT1