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

Michael A. Olson

dblp:65/4721 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Databases, data management, data science and information retrieval · 4 · 1 first-author

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
3 papers
Distributed and cloud data management · 24% Query processing and optimization · 24% Data models and query languages · 21%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
distributed query optimization
0.011994
Mariposa: A New Architecture for Distributed Data · ICDE 1994
Indexing and storage engines
b+-tree
0.011992
An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System · ICDE 1992
Storage systems
shadow paging
0.011992
An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System · ICDE 1992
Storage systems
storage reliability
0.011992
An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System · ICDE 1992
Storage systems › storage performance
storage device performance
0.011993
Large Object Support in POSTGRES · ICDE 1993

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

rule-based design · 0.0autonomous local-knowledge decisions · 0.0user-defined operators · 0.0compression · 0.0abstract data types · 0.0two-phase page reorganization · 0.0shadow paging · 0.0logical logging · 0.0
YearPublicationVenuePosition
1995 Cover Your Assets
abstract
No abstract available.
Michael A. Olson
SIGMOD Conference1
1994 Mariposa: A New Architecture for Distributed Data
abstract
We describe the design of Mariposa, an experimental distributed data management system that provides high performance in an environment of high data mobility and heterogeneous host capabilities. The Mariposa design unifies the approaches taken by distributed file systems and distributed databases. In addition, Mariposa provides a general, flexible platform for the development of new algorithms for distributed query optimization, storage management, and scalable data storage structures. This flexibility is primarily due to a unique rule-based design that permits autonomous, local-knowledge decisions to be made regarding data placement, query execution location, and storage management.>
Michael Stonebraker, Paul M. Aoki, Robert Devine, Witold Litwin, Michael A. Olson
ICDE5
1993 Large Object Support in POSTGRES
abstract
Four implementations that support large objects in the POSTGRES database system are presented. The four implementations offer varying levels of support for security, transactions, compression, and time travel. All are implemented using the POSTGRES abstract data type paradigm, support user-defined operators and functions, and allow file-oriented access to large objects in the database. The support for user-defined storage managers available in POSTGRES is also detailed. The performance of all four large object implementations on two different storage devices is described.>
Michael Stonebraker, Michael A. Olson
ICDE2
1992 An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System
abstract
The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but improves performance by integrating shadow meta-data with index meta-data. The other algorithm uses a two-phase page reorganization scheme to reduce the space overhead caused by shadow paging. Although designed for the POSTGRES storage system, these algorithms should also be useful in a WAL-based storage system, as support for logical logging. Measurements and analysis of a prototype implementation suggest that the algorithms will have little impact on data manager performance.>
Mark Sullivan, Michael A. Olson
ICDE2