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

Sean Quinlan

dblp:60/6154 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Distributed systems · 89% Storage systems · 6% Cloud and datacenter computing · 5%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed database
0.322013
Spanner: Google's Globally Distributed Database · ACM Trans. Comput. Syst. 2013
Spanner: Google's Globally-Distributed Database · OSDI 2012
Distributed systems
consensus
0.212013
Spanner: Google's Globally Distributed Database · ACM Trans. Comput. Syst. 2013
Distributed systems
replication
0.212013
Spanner: Google's Globally Distributed Database · ACM Trans. Comput. Syst. 2013
Distributed systems › replication › update propagation
synchronous replication
0.212013
Spanner: Google's Globally Distributed Database · ACM Trans. Comput. Syst. 2013
Distributed systems
fault tolerance
0.112010
Availability in Globally Distributed Storage Systems · OSDI 2010
Bioinformatics and computational biology
biological database
0.112005
PACdb: PolyA Cleavage Site and 3'-UTR Database · Bioinform. 2005
Distributed systems › distributed coordination and fault tolerance
consensus and replication
0.012012
Spanner: Google's Globally-Distributed Database · OSDI 2012
Systems and software security
operating system security
0.012002
Security in Plan 9 · USENIX Security Symposium 2002
Storage systems
archival storage
0.012002
Venti: A New Approach to Archival Storage · FAST 2002
Storage systems
distributed storage
0.012010
Availability in Globally Distributed Storage Systems · OSDI 2010
Bioinformatics and computational biology
genome annotation
0.012005
PACdb: PolyA Cleavage Site and 3'-UTR Database · Bioinform. 2005
Geometric modeling and processing
collision detection
0.011994
Efficient Distance Computation Between Non-Convex Objects · ICRA 1994
Geometric modeling and processing › shape decomposition
convex decomposition
0.011994
Efficient Distance Computation Between Non-Convex Objects · ICRA 1994
Geometric modeling and processing › collision detection
distance computation
0.011994
Efficient Distance Computation Between Non-Convex Objects · ICRA 1994
Operating systems › distributed systems
distributed operating system
0.012002
Security in Plan 9 · USENIX Security Symposium 2002
Robotics › Motion planning and robot control
collision avoidance
0.011994
Efficient Distance Computation Between Non-Convex Objects · ICRA 1994

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

truetime · 0.2capability-based security · 0.1expressed sequence tag alignment · 0.1hierarchical bounding representation · 0.0convex component decomposition · 0.0
YearPublicationVenuePosition
2013 Spanner: Google's Globally Distributed Database
abstract
Spanner is Google’s scalable, multiversion, globally distributed, and synchronously replicated database. It is the first system to distribute data at global scale and support externally-consistent distributed transactions. This article describes how Spanner is structured, its feature set, the rationale underlying various design decisions, and a novel time API that exposes clock uncertainty. This API and its implementation are critical to supporting external consistency and a variety of powerful features: nonblocking reads in the past, lock-free snapshot transactions, and atomic schema changes, across all of Spanner.
James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost 0001, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson C. Hsieh, Sebastian Kanthak, Eugene Kogan, Alexander Lloyd, Sergey Melnik 0001, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymaniak, Ruth Wang, Dale Woodford
ACM Trans. Comput. Syst.19
2012 Spanner: Google's Globally-Distributed Database
James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost 0001, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson C. Hsieh, Sebastian Kanthak, Eugene Kogan, Alexander Lloyd, Sergey Melnik 0001, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymaniak, Ruth Wang, Dale Woodford
OSDI19
2010 Availability in Globally Distributed Storage Systems
Daniel Ford, François Labelle, Florentina I. Popovici, Murray Stokely, Van-Anh Truong, Luiz Barroso, Carrie Grimes, Sean Quinlan
OSDI8
2005 PACdb: PolyA Cleavage Site and 3'-UTR Database
abstract
UNLABELLED: The PolyA Cleavage Site and 3'-UTR Database (PACdb) is a web-accessible database that catalogs putative 3'-processing sites and 3'-UTR sequences for multiple organisms. Sites have been identified primarily via expressed sequence tag-genome alignments, enabling delineation of both the specificities and heterogeneity of 3'-processing events. AVAILABILITY: By web browser or CGI: PACdb: http://harlequin.jax.org/pacdb/; AtPACdb: http://harlequin.jax.org/atpacdb/. SUPPLEMENTARY INFORMATION: Available online at http://harlequin.jax.org/pacdb/supplemental.php.
J. Michael Brockman, Priyam Singh, Sean Quinlan, Jesse Salisbury, Joel H. Graber
Bioinform.4
2002 Venti: A New Approach to Archival Storage
Sean Quinlan, Sean Dorward
FAST1
2002 Security in Plan 9
Russ Cox, Eric Grosse, Rob Pike, David L. Presotto, Sean Quinlan
USENIX Security Symposium5
1994 Efficient Distance Computation Between Non-Convex Objects
abstract
This paper describes an efficient algorithm for computing the distance between nonconvex objects. Objects are modeled as the union of a set of convex components. From this model we construct a hierarchical bounding representation based on spheres. The distance between objects is determined by computing the distance between pairs of convex components using preexisting techniques. The key to efficiency is a simple search routine that uses the bounding representation to ignore most of the possible pairs of components. The efficiency can further be improved by accepting a relative error in the returned result. Several empirical trials are presented to examine the performance of the algorithm.>
Sean Quinlan
ICRA1
1991 A Cached WORM File System
abstract
Abstract This paper describes a general‐purpose file system that uses a write‐once‐read‐many (WORM) optical disk accessed via a magnetic disk cache. The cache enables blocks to be modified a number of times before they are written to the WORM and increases performance. Snapshots of the file system can be made at any time without limiting the users' access to files. These snapshots reside entirely on the WORM, are accessible to the user via a second read‐only file system, do not contain multiple copies of unchanged data, and can be used to rebuild the file system in the event that the disk cache is destroyed. The file system has been implemented as part of Plan 9, an experimental operating system under development at AT&T Bell Laboratories.
Sean Quinlan
Softw. Pract. Exp.1