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

Greg D. Hill

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

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

Systems, architecture and hardware · 1Databases, 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
Graph data management · 67% Transaction processing and concurrency control · 33%
Computer networks
1 paper
Transport protocols and congestion control · 50% Internet of things and sensor networks · 50%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
congestion control evaluation
0.312018
Pantheon: the training ground for Internet congestion-control research · USENIX ATC 2018
Internet of things and sensor networks › wireless sensor network
testbed
0.312018
Pantheon: the training ground for Internet congestion-control research · USENIX ATC 2018
Graph data management › graph database
distributed graph database
0.212016
Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps · Proc. VLDB Endow. 2016
Graph data management
graph database
0.212016
Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps · Proc. VLDB Endow. 2016
Transaction processing and concurrency control › serializability
strict serializability
0.212016
Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps · Proc. VLDB Endow. 2016

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

testbed design · 0.3benchmarking · 0.3vector timestamps · 0.2timeline oracle · 0.2refinable timestamps · 0.2
YearPublicationVenuePosition
2018 Pantheon: the training ground for Internet congestion-control research
Francis Y. Yan, Jestin Ma, Greg D. Hill, Deepti Raghavan, Riad S. Wahby, Philip Alexander Levis, Keith Winstein
USENIX ATC3
2016 Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps
abstract
Graph databases have become a common infrastructure component. Yet existing systems either operate on offline snapshots, provide weak consistency guarantees, or use expensive concurrency control techniques that limit performance. In this paper, we introduce a new distributed graph database, called Weaver, which enables efficient, transactional graph analyses as well as strictly serializable ACID transactions on dynamic graphs. The key insight that allows Weaver to combine strict serializability with horizontal scalability and high performance is a novel request ordering mechanism called refinable timestamps. This technique couples coarse-grained vector timestamps with a fine-grained timeline oracle to pay the overhead of strong consistency only when needed. Experiments show that Weaver enables a Bitcoin blockchain explorer that is 8x faster than Blockchain.info, and achieves 10.9x higher throughput than the Titan graph database on social network workloads and 4x lower latency than GraphLab on offline graph traversal workloads.
Ayush Dubey, Greg D. Hill, Robert Escriva, Emin Gün Sirer
Proc. VLDB Endow.2