Pat Helland

dblp:h/PatHelland · also Patrick Helland · DBLP profile ↗
← Back
14ranked-venue papers
9as first author
3since 2021 · last 2026
—ORCID · none

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

Databases, data management, data science and information retrieval · 12 · 9 first-author · 3 since 2021Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1
YearPublicationVenuePosition
2026 A Multi-tenant Relational OLTP Database at Salesforce
Vaibhav Arora, Subho Chatterjee, Terry Chong, Thomas Fanghaenel, Pat Helland, Jamie Martin, Kaushal Mittal, Nat Wyatt
CIDR5
2024 Scalable OLTP in the Cloud: What's the BIG DEAL?
Pat Helland
CIDR1
2022 Decoupled Transactions: Low Tail Latency Online Transactions Atop Jittery Servers
Pat Helland
CIDR1
2019 The I's Have It: Identity, Immutability, Idempotence, and Interchangeability Form the Backbone of Distributed Computing
Pat Helland
CIDR1
2015 Immutability Changes Everything
Pat Helland
CIDR1
2015 Heisenberg Was on the Write Track
Pat Helland
CIDR1
2013 Engagements: Building Eventually ACiD Business Transactions
Pat Helland, Don Haderle
CIDR1
2009 Building on Quicksand
Pat Helland, David Campbell
CIDR1
2007 Life beyond Distributed Transactions: an Apostate's Opinion
Pat Helland
CIDR1
2007 The End of an Architectural Era (It's Time for a Complete Rewrite)
Michael Stonebraker, Samuel Madden 0001, Daniel J. Abadi, Stavros Harizopoulos, Nabil Hachem, Pat Helland
VLDB6
2005 Data on the Outside Versus Data on the Inside
Pat Helland
CIDR1
1997 The Mercury Interconnect Architecture: A Cost-effective Infrastructure for High-performance Servers
abstract
This paper presents HAL's Mercury Interconnect Architecture, an interconnect infrastructure designed to link commodity microprocessors, memory, and I/O components into high-performance multiprocessing servers. Both shared-memory and message-passing systems, as well as hybrid systems are supported by the interconnect. The key attributes of the Mercury Interconnect Architecture are: low latency, high bandwidth, a modular and flexible design, reliability/availability/serviceability (RAS) features, and a simplicity that enables very cost-effective implementations. The first implementation of the architecture links multiple 4-processor Pentium™ Pro based nodes. In a 4-node (16-processor) shared-memory configuration, this system achieves a remote read latency of just over 1 µs, and a maximum interconnect bandwidth of 6.4 GByte/s. Both of these parameters far outpace comparable SCI-based solutions, while utilizing much fewer hardware components.
Wolf-Dietrich Weber, Stephen Gold, Pat Helland, Takeshi Shimizu, Thomas Wicki, Winfried W. Wilcke
ISCA3
1996 The Dangers of Replication and a Solution
abstract
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up: a ten-fold increase in nodes and traffic gives a thousand fold increase in deadlocks or reconciliations. Master copy replication (primary copy) schemes reduce this problem. A simple analytic model demonstrates these results. A new two-tier replication algorithm is proposed that allows mobile (disconnected) applications to propose tentative update transactions that are later applied to a master copy. Commutative update transactions avoid the instability of other replication schemes.
Jim Gray 0001, Pat Helland, Patrick E. O'Neil, Dennis E. Shasha
SIGMOD Conference2
1995 Fault-Tolerant Features in the HaL Memory Management Unit
abstract
This paper describes fault-tolerant and error detection features in HaL's memory management unit (MMU). The proposed fault-tolerant features allow recovery from transient errors in the MMU. It is shown that these features were natural choices considering the architectural and implementation constraints in the MMU's design environment. Three concurrent error detection and correction methods employed in address translation and coherence tables in the MMU are described. Virtually-indexed and virtually-tagged cache architecture is exploited to provide an almost fault-secure hardware coherence mechanism in the MMU, with very small performance overhead (less than 0.01% in the instruction throughput). Low overhead linear polynomial codes have been chosen in these designs to minimize both the hardware and software instrumentation impact.>
Nirmal Saxena, David Chih-Wei Chang, Kevin Dawallu, Jaspal Kohli, Pat Helland
IEEE Trans. Computers5