Publication | Open Access
Fully persistent B+-trees
81
Citations
6
References
1991
Year
Unknown Venue
University ParkCluster ComputingTree LanguageData-driven ScienceEngineeringGraph TheoryData ScienceScientific Data ManagementPaview ProfileVery Large DatabaseAlert PreferencesStorage StructureComputer ScienceTree AutomatonDiscrete MathematicsCitation AnalysisData ManagementPersistent B+-trees
article Free Access Share on Fully persistent B+-trees Authors: Sitaram Lanka Computer Science Department, The Pennsylvania State University, University Park, PA Computer Science Department, The Pennsylvania State University, University Park, PAView Profile , Eric Mays IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NYView Profile Authors Info & Claims ACM SIGMOD RecordVolume 20Issue 2June 1991 pp 426–435https://doi.org/10.1145/119995.115861Online:01 April 1991Publication History 59citation978DownloadsMetricsTotal Citations59Total Downloads978Last 12 Months28Last 6 weeks5 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
| Year | Citations | |
|---|---|---|
Page 1
Page 1