| Home > Lernmodule > Modul 10 |
Indexierung
| · | R. Bayer, E. McCreight, Organization and maintenance of large ordered indexes, in: Acta Informatica, Vol. 1, Seite 173-189, 1972 |
| · | D. Comer, The ubiquitous B-Tree, ACM Computing Surveys, Vol. 11(2), Seite 121-137, 1979 |
| · | D. E. Knuth, The Art of Computer Programming/Sorting and Searching, Bd3, Addison-Wesley, Reading, 1973 |
| · | A. Guttman, R-Trees: A Dynamic Index Structure for Spatial Searching, In: Proc. ACM SIGMOD Intl. Symp. on the Management of Data, 1984, Seiten 45-57 |
| · | N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger, The R*-Tree: An Eficient and Robust Access Method for Points and Rectangles, In: Proc ACM SIGMOD Intl. Symp. on the Management of Data, 1990, Seiten 322-331 |