1984 · 21 citations · 14 references
ComputingComputer ScienceComputer SystemsData StructuresDatabasesDistributed SystemsConcurrency AnalysisConcurrency ControlConcurrent ProgrammingDistributed TransactionsTransaction Processing SystemsConcurrency TheoryConcurrent Tree Data StructuresTree Algorithms
Article Free Access Share on Concurrency control mechanisms and the serializability of concurrent tree algorithms Authors: Ray Ford The University of Iowa, Iowa City, IA The University of Iowa, Iowa City, IAView Profile , Jim Calhoun The University of Iowa, Iowa City, IA The University of Iowa, Iowa City, IAView Profile Authors Info & Claims PODS '84: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systemsApril 1984 Pages 51–60https://doi.org/10.1145/588011.588020Online:02 April 1984Publication History 9citation387DownloadsMetricsTotal Citations9Total Downloads387Last 12 Months8Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
14
The notions of consistency and predicate locks in a database system
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie et al. · Communications of the ACM · 1976 · 2K citations · Full text
Concurrent search and insertion in 2?3 trees
Carla Schlatter Ellis · Acta Informatica · 1980 · 96 citations