[go: up one dir, main page]
Scribd
Upload
280 views18 pages

Organization of Large Ordered Indices

The document describes a 1972 paper by Rudolf Bayer and E. McCreight on organizing and maintaining large ordered indexes. The paper discusses techniques for efficiently storing and accessing ordered indexes to support operations like searching, inserting, and deleting records. It proposes a balanced tree data structure called an R-tree that allows for fast lookups and updates of records in large ordered indexes.

Uploaded by

Chinar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
280 views18 pages

Organization of Large Ordered Indices

The document describes a 1972 paper by Rudolf Bayer and E. McCreight on organizing and maintaining large ordered indexes. The paper discusses techniques for efficiently storing and accessing ordered indexes to support operations like searching, inserting, and deleting records. It proposes a balanced tree data structure called an R-tree that allows for fast lookups and updates of records in large ordered indexes.

Uploaded by

Chinar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Original Historic Documents 245

Rudolf Bayer

R. Bayer, E. McCreight
Organization and Maintenance
of Large Ordered Indexes

Acta Informatica, Vol. 1, Fasc. 3, 1972


pp. 173-189
246 Rudolf Bayer
Original Historic Documents 247
248 Rudolf Bayer
Original Historic Documents 249
250 Rudolf Bayer
Original Historic Documents 251
252 Rudolf Bayer
Original Historic Documents 253
254 Rudolf Bayer
Original Historic Documents 255
256 Rudolf Bayer
Original Historic Documents 257
258 Rudolf Bayer
Original Historic Documents 259
260 Rudolf Bayer
Original Historic Documents 261
262 Rudolf Bayer

You might also like