Author:
Soisalon-Soininen Eljas,Widmayer Peter
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. G.M. Adel’son-Vel’skii and Landis. An algorithm for the organisation of information. Dokl. Akad. Nauk SSSR
146 (1962), 263–266 (in Russian); English Translation in Soviet. Math.
3, 1259–1262.
2. L. Arge, K.H. Hinrichs, J. Vahrenhold, and J.S. Vitter. Efficient bulk operations on dynamic R-trees. Algorithmica
33 (2002), 104–128.
3. A. Gärtner, A. Kemper, D. Kossmann, B. Zeller. Efficient bulk deletes in relational databases. In: Proceedings of the 17th International Conference on Data Engineering. IEEE Computer Society, 2001, pp. 183–192.
4. Lect Notes Comput Sci;H. S,2000
5. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica
17 (1982), 157–184.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献