@article {16850,
	title = {Execution time analysis of a top-down R-tree construction algorithm},
	journal = {Information Processing Letters},
	volume = {101},
	year = {2007},
	month = {2007/01/16/},
	pages = {6 - 12},
	abstract = {A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to Garc{\'\i}a et al. [Y.J. Garc{\'\i}a, M.A. L{\'o}pez, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS{\textquoteright}98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163{\textendash}164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.},
	keywords = {Bulk loading, Data structures, Packing, R-trees, Spatial databases},
	isbn = {0020-0190},
	doi = {10.1016/j.ipl.2006.07.010},
	url = {http://www.sciencedirect.com/science/article/pii/S002001900600233X},
	author = {Alborzi,Houman and Samet, Hanan}
}
