The design of dynamic data structures
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
156 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The design of dynamic data structures, Mark H. Overmars, Berlin, Springer-Verlag, 1983, 1 vol. (vii, 181 p.), Lecture notes in computer science, 3-540-12330-X • The Design of Dynamic Data Structures, Texte imprimé, 9783662167373 |
Sommario:
- A catalog of (multi-dimensional) searching problems
- Local rebuilding (balancing)
- Partial rebuilding
- Global rebuilding
- Order decomposable set problems
- Decomposable searching problems
- Batched dynamization
- Searching in the past
- Final comments and open problems.