Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andrew Pavlo

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Subramanya Dulloor

> Home > Persons > Andrew Pavlo

Publications

2016
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/damon/MaAZPDGPGDZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/damon/MaAZPDGPGDZ16
Lin Ma, Joy Arulraj, Sam Zhao, Andrew Pavlo, Subramanya R. Dulloor, Michael J. Giardino, Jeff Parkhurst, Jason L. Gardner, Kshitij A. Doshi, Stanley B. Zdonik:
Larger-than-memory data management on modern storage hardware for in-memory OLTP database systems. DaMoN 2016: 9:1-9:7
2015
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/sigmod/ArulrajPD15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/ArulrajPD15
Joy Arulraj, Andrew Pavlo, Subramanya Dulloor:
Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems. SIGMOD Conference 2015: 707-722
2014
[c7]
- view
  - electronic edition @ adms-conf.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/vldb/DeBrabantAPSZD14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vldb/DeBrabantAPSZD14
Justin A. DeBrabant, Joy Arulraj, Andrew Pavlo, Michael Stonebraker, Stanley B. Zdonik, Subramanya Dulloor:
A Prolegomenon on OLTP Database Systems for Non-Volatile Memory. ADMS@VLDB 2014: 57-63

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.