Dynamic k-dimensional multiway search under time-varying access frequencies
A search for key ki can be performed in time 0(min(n,logd+1Wt/p i t )+(k−1)), i.e. the tree is always nearly optimal.
The time for updating after a search is at most proportional to search time.
Insertion of a new key with arbitrary frequency as well as deletion of a key with arbitrary frequency can be carried out in time 0(min(n,logd+1Wt)+(k−1)).
Unable to display preview. Download preview PDF.
- Bent, S.W., Sleator, D.D. and Tarjan, R.E. (1980), Biased 2–3 trees, Proc. 21st Annual Symposium on Foundations of Computer Science, 248–254.Google Scholar
- Güting, H. and Kriegel, H.P. (1980), Multidimensional B-tree: An efficient dynamic file structure for exact match queries, Computer Science Technical Report No. 105, Universität Dortmund, also in: GI — lo. Jahrestagung, Informatik Fachberichte Band 33, 375–388, Springer-Verlag, Berlin-Heidelberg-New York.Google Scholar
- Knuth, D.E. (1973), The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading, MA.Google Scholar
- Mehlhorn, K. (1978), Arbitrary weight changes in dynamic trees, Bericht 78/04, Fachbereich lo — Informatik, Universität des Saarlandes, Saarbrücken.Google Scholar