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

Roman Averbukh

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

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

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

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 · 54% Graph data management · 23% Distributed and cloud data management · 23%

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

TopicWeightPapersLastEvidence papers
Graph data management › graph database
distributed graph database
0.312018
Partial Update: Efficient Materialized View Maintenance in a Distributed Graph Database · ICDE 2018
Distributed and cloud data management
eventual consistency
0.312018
Partial Update: Efficient Materialized View Maintenance in a Distributed Graph Database · ICDE 2018
Query processing and optimization › view maintenance
incremental view maintenance
0.312018
Partial Update: Efficient Materialized View Maintenance in a Distributed Graph Database · ICDE 2018
Query processing and optimization
view maintenance
0.312018
Partial Update: Efficient Materialized View Maintenance in a Distributed Graph Database · ICDE 2018

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

partial update · 0.3delta change computation · 0.3
YearPublicationVenuePosition
2018 Partial Update: Efficient Materialized View Maintenance in a Distributed Graph Database
abstract
In order to efficiently serve a high volume of queries, LinkedIn's distributed graph service caches computationally-expensive materialized views. Despite this, even basic view maintenance has been a scalability bottleneck. In this paper, we introduce Partial Update, which efficiently applies incremental view maintenance in the absence of deletions in a materialized view. Without expensive transaction handling, Partial Update guarantees eventual consistency across source of truth databases, materialized views and base relations stores. By design, its delta change computation logic only produces lightweight queries, reducing any need to augment the underlying data storage systems. This allows Partial Update to seamlessly integrate on top of traditional eventually consistent systems. In LinkedIn's production systems, Partial Update achieves up to a 50% reduction in both maintenance time and network bandwidth utilization. The improved view maintenance scalability allows us to improve the quality of cached data by a factor of 20. We consider that Partial Update is general enough to be applicable to the majority of select-project-join view maintenance strategies in eventually consistent distributed data stores.
SungJu Cho, Roman Averbukh, Andrew Carter, Jane Alam Jan
ICDE2