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

Dhanya R. Krishnan

dblp:178/3696 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—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-authorApplied, interdisciplinary, general and emerging computing · 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
Query processing and optimization · 67% Data mining · 33%

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

TopicWeightPapersLastEvidence papers
Data mining
approximate computation
0.212016
IncApprox: A Data Analytics System for Incremental Approximate Computing · WWW 2016
Query processing and optimization
incremental computation
0.212016
IncApprox: A Data Analytics System for Incremental Approximate Computing · WWW 2016
Query processing and optimization › approximate query processing
sampling-based approximate query processing
0.212016
IncApprox: A Data Analytics System for Incremental Approximate Computing · WWW 2016

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

sampling · 0.2memoization · 0.2
YearPublicationVenuePosition
2016 IncApprox: A Data Analytics System for Incremental Approximate Computing
abstract
Incremental and approximate computations are increasingly being adopted for data analytics to achieve low-latency execution and efficient utilization of computing resources. Incremental computation updates the output incrementally instead of re-computing everything from scratch for successive runs of a job with input changes. Approximate computation returns an approximate output for a job instead of the exact output. Both paradigms rely on computing over a subset of data items instead of computing over the entire dataset, but they differ in their means for skipping parts of the computation. Incremental computing relies on the memoization of intermediate results of sub-computations, and reusing these memoized results across jobs. Approximate computing relies on representative sampling of the entire dataset to compute over a subset of data items.
Dhanya R. Krishnan, Do Le Quoc, Pramod Bhatotia, Christof Fetzer, Rodrigo Rodrigues 0001
WWW1