"B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Theodore Johnson, Dennis E. Shasha (1993)

> Home

Details and statistics

DOI: 10.1016/0022-0000(93)90020-W

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/JohnsonS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/JohnsonS93
Theodore Johnson, Dennis E. Shasha:
B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. J. Comput. Syst. Sci. 47(1): 45-76 (1993)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.