Amanote Research

Amanote Research

    RegisterSign In

Performance of B-Tree Concurrency Control Algorithms

SIGMOD Record - United States
doi 10.1145/119995.115860
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsSoftware
Date

April 1, 1991

Authors
V. SrinivasanMichael J. Carey
Publisher

Association for Computing Machinery (ACM)


Related search

Concurrency Control: Methods, Performance, and Analysis

ACM Computing Surveys
Computer ScienceTheoretical Computer Science
1998English

MARK-OPT: A Concurrency Control Protocol for Parallel B-Tree Structures to Reduce the Cost of SMOs

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2007English

Formal Development of Basic Timestamp Concurrency Control Mechanism Using Event-B

International Journal of Computer Applications
2015English

On the Performance of the Immediate Restart Concurrency Control Policy

English

Coalgebra, Concurrency, and Control

2000English

Performance Analysis of Undergraduate Students Placement Selection Using Decision Tree Algorithms

International Journal of Computer Applications
2014English

Tree Editing Algorithms.

English

An Analysis on Performance of Decision Tree Algorithms Using Student’s Qualitative Data

International Journal of Modern Education and Computer Science
2013English

Concurrency Control in Asynchronous Computations

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy