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

Lawrence You

dblp:92/144 · also Lawrence L. You · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2025
0009-0006-4556-6587ORCID · verified

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

Systems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 since 2021

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.

Network and information security
1 paper
Usable security · 77% Privacy and data protection · 23%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Usable security
at-risk users
0.912025
Supporting the Digital Safety of At-Risk Users: Lessons Learned from 9+ Years of Research and Training · ACM Trans. Comput. Hum. Interact. 2025
Privacy and data protection
vulnerable populations
0.312025
Supporting the Digital Safety of At-Risk Users: Lessons Learned from 9+ Years of Research and Training · ACM Trans. Comput. Hum. Interact. 2025
Storage systems
archival storage
0.222011
PRESIDIO: A Framework for Efficient Archival Data Storage · ACM Trans. Storage 2011
Deep Store: an Archival Storage System Architecture · ICDE 2005
Storage systems
data compression
0.112011
PRESIDIO: A Framework for Efficient Archival Data Storage · ACM Trans. Storage 2011
Storage systems › data reduction
data deduplication
0.112011
PRESIDIO: A Framework for Efficient Archival Data Storage · ACM Trans. Storage 2011
Storage systems › data compression
delta compression
0.112011
PRESIDIO: A Framework for Efficient Archival Data Storage · ACM Trans. Storage 2011
Storage systems
similarity detection
0.112011
PRESIDIO: A Framework for Efficient Archival Data Storage · ACM Trans. Storage 2011
Storage systems
content-addressable storage
0.012005
Deep Store: an Archival Storage System Architecture · ICDE 2005
Storage systems › data reduction
deduplication and compression
0.012005
Deep Store: an Archival Storage System Architecture · ICDE 2005

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

framework development · 0.9design principles · 0.9harmonic super-fingerprinting · 0.1content addressable storage · 0.1virtual content-addressable storage · 0.1variable-degree replication · 0.1
YearPublicationVenuePosition
2025 Supporting the Digital Safety of At-Risk Users: Lessons Learned from 9+ Years of Research and Training
abstract
Creating information technologies intended for broad use that allow everyone to participate safely online—which we refer to as inclusive digital safety —requires understanding and addressing the digital-safety needs of a diverse range of users who face elevated risk of technology-facilitated attacks or disproportionate harm from such attacks—i.e., at-risk users . This article draws from more than 9 years of our work at Google to understand and support the digital safety of at-risk users—including survivors of intimate partner abuse, people involved with political campaigns, content creators, youth, and more—in technology intended for broad use. Among our learnings is that designing for inclusive digital safety across widely varied user needs and dynamic contexts is a wicked problem with no “correct” solution. Given this, we describe frameworks and design principles we have developed to help make at-risk research findings practically applicable to technologies intended for broad use and lessons we have learned about communicating them to practitioners.
Tara Matthews, Elie Bursztein, Patrick Gage Kelley, Lea Kissner, Andreas Kramm, Andrew Oplinger, Andreas Schou, Manya Sleeper, Stephan Somogyi, Dalila Szostak, Kurt Thomas, Anna Turner, Jill Palzkill Woelfer, Lawrence You, Izzie Zahorian, Sunny Consolvo
ACM Trans. Comput. Hum. Interact.14
2011 PRESIDIO: A Framework for Efficient Archival Data Storage
abstract
The ever-increasing volume of archival data that needs to be reliably retained for long periods of time and the decreasing costs of disk storage, memory, and processing have motivated the design of low-cost, high-efficiency disk-based storage systems. However, managed disk storage is still expensive. To further lower the cost, redundancy can be eliminated with the use of interfile and intrafile data compression. However, it is not clear what the optimal strategy for compressing data is, given the diverse collections of data. To create a scalable archival storage system that efficiently stores diverse data, we present PRESIDIO, a framework that selects from different space-reduction efficent storage methods (ESMs) to detect similarity and reduce or eliminate redundancy when storing objects. In addition, the framework uses a virtualized content addressable store (VCAS) that hides from the user the complexity of knowing which space-efficient techniques are used, including chunk-based deduplication or delta compression. Storing and retrieving objects are polymorphic operations independent of their content-based address. A new technique, harmonic super-fingerprinting, is also used for obtaining successively more accurate (but also more costly) measures of similarity to identify the existing objects in a very large data set that are most similar to an incoming new object. The PRESIDIO design, when reported earlier, had comprehensively introduced for the first time the notion of deduplication, which is now being offered as a service in storage systems by major vendors. As an aid to the design of such systems, we evaluate and present various parameters that affect the efficiency of a storage system using empirical data.
Lawrence You, Kristal T. Pollack, Darrell D. E. Long, K. Gopinath
ACM Trans. Storage1
2005 Deep Store: an Archival Storage System Architecture
abstract
We present the Deep Store archival storage architecture, a large-scale storage system that stores immutable data efficiently and reliably for long periods of time. Archived data is stored across a cluster of nodes and recorded to hard disk. The design differentiates itself from traditional file systems by eliminating redundancy within and across files, distributing content for scalability, associating rich metadata with content, and using variable levels of replication based on the importance or degree of dependency of each piece of stored data. We evaluate the foundations of our design, including PRESIDIO, a virtual content-addressable storage framework with multiple methods for interfile and intra-file compression that effectively addresses the data-dependent variability of data compression. We measure content and metadata storage efficiency, demonstrate the need for a variable-degree replication model, and provide preliminary results for storage performance.
Lawrence You, Kristal T. Pollack, Darrell D. E. Long
ICDE1
2004 Evaluation of Efficient Archival Storage Techniques
Lawrence You, Christos T. Karamanolis
MSST1