An analytical model for the performance of concurrent B tree algorithms

Vladimir Lanin, J. Schmidt, Dennis Shasha

Research output: Book/ReportOther report

Original languageEnglish (US)
PublisherDepartment of Computer Science, New York University
StatePublished - 1987

Publication series

NameUltracomputer Note
No.124
NameComputer Science Technical Report
No.311

Cite this

Lanin, V., Schmidt, J., & Shasha, D. (1987). An analytical model for the performance of concurrent B tree algorithms. (Ultracomputer Note; No. 124), (Computer Science Technical Report; No. 311). Department of Computer Science, New York University.

An analytical model for the performance of concurrent B tree algorithms. / Lanin, Vladimir; Schmidt, J.; Shasha, Dennis.

Department of Computer Science, New York University, 1987. (Ultracomputer Note; No. 124), (Computer Science Technical Report; No. 311).

Research output: Book/ReportOther report

Lanin, V, Schmidt, J & Shasha, D 1987, An analytical model for the performance of concurrent B tree algorithms. Ultracomputer Note, no. 124, Computer Science Technical Report, no. 311, Department of Computer Science, New York University.
Lanin V, Schmidt J, Shasha D. An analytical model for the performance of concurrent B tree algorithms. Department of Computer Science, New York University, 1987. (Ultracomputer Note; 124). (Computer Science Technical Report; 311).
Lanin, Vladimir ; Schmidt, J. ; Shasha, Dennis. / An analytical model for the performance of concurrent B tree algorithms. Department of Computer Science, New York University, 1987. (Ultracomputer Note; 124). (Computer Science Technical Report; 311).
@book{a8808a1033b549059b2f115f36cee9a6,
title = "An analytical model for the performance of concurrent B tree algorithms",
author = "Vladimir Lanin and J. Schmidt and Dennis Shasha",
year = "1987",
language = "English (US)",
series = "Ultracomputer Note",
publisher = "Department of Computer Science, New York University",
number = "124",

}

TY - BOOK

T1 - An analytical model for the performance of concurrent B tree algorithms

AU - Lanin, Vladimir

AU - Schmidt, J.

AU - Shasha, Dennis

PY - 1987

Y1 - 1987

M3 - Other report

T3 - Ultracomputer Note

BT - An analytical model for the performance of concurrent B tree algorithms

PB - Department of Computer Science, New York University

ER -