Abstract

article Free Access Share on Ubiquitous B-Tree Author: Douglas Comer Computer Science Department, Purdue University, West Lafayette, Indiana Computer Science Department, Purdue University, West Lafayette, IndianaView Profile Authors Info & Claims ACM Computing SurveysVolume 11Issue 2pp 121–137https://doi.org/10.1145/356770.356776Published:01 June 1979Publication History 1,370citation14,426DownloadsMetricsTotal Citations1,370Total Downloads14,426Last 12 Months1,477Last 6 weeks122 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

Keywords

Computer scienceCitationTree (set theory)World Wide Web

Affiliated Institutions

Related Publications

Algorithm 630

article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 630: BBVSCG–a variable-storage algorithm for function minimization Authors: A. Buckley De...

1985 ACM Transactions on Mathematical Soft... 33 citations

Publication Info

Year
1979
Type
review
Volume
11
Issue
2
Pages
121-137
Citations
1814
Access
Closed

External Links

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

1814
OpenAlex

Cite This

Douglas E. Comer (1979). Ubiquitous B-Tree. ACM Computing Surveys , 11 (2) , 121-137. https://doi.org/10.1145/356770.356776

Identifiers

DOI
10.1145/356770.356776