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

Adam Wolbach

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

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

Computer networks · 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
Distributed and cloud data management · 50% Transaction processing and concurrency control · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
consistency
0.112007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Distributed and cloud data management › data replication
replica control
0.112007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Storage systems
content-addressable storage
0.012007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Storage systems › data reduction
data deduplication
0.012007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007

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

optimistic replica control · 0.1content addressable storage · 0.1
YearPublicationVenuePosition
2007 Improving mobile database access over wide-area networks without degrading consistency
abstract
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is accomplished without degrading consistency. Cedar exploits the disk storage and processing power of a mobile client to compensate for weak connectivity. Its central organizing principle is that even a stale client replica can be used to reduce data transmission volume from a database server. The reduction is achieved by using content addressable storage to discover and elide commonality between client and server results. This organizing principle allows Cedar to use an optimistic approach to solving the difficult problem of database replica control. For laptop-class clients, our experiments show that Cedar improves the throughput of read-write workloads by 39% to as much as 224% while reducing response time by 28% to as much as 79%.
Niraj Tolia, Mahadev Satyanarayanan, Adam Wolbach
MobiSys3