Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

Efficiency in the loading of a sodium magneto-optical trap from alkali metal dispensers

We study the loading of sodium atoms into a magneto-optical trap from current-controlled sodium metal dispensers. Contrary to what was previously reported [V. Wippel, C. Binder, W. Huber, L Windholz, M. Allegrini, F. Fuso, E. Arimondo, Eur. Phys. J. D 17 (2001) 2851 we demonstrate a significantly higher number of trapped atoms that make Na dispensers a feasible source of atoms for cold-atom studies. The inherent rise in pressure that naturally arises from metal dispensers as they are heated to release atoms is partially controlled by placing the metal dispensers near the pumping port where an ion pump is connected. We also study the effects of placing the sodium dispensers at different distances from the main vacuum chamber where the atoms are trapped and the effectiveness of using a Zeeman slower to cool the atoms as they emerge from the dispensers. We observe trapping of up to 1.9 x 10(8) atoms, which is significantly higher by almost three orders of magnitude than previously reported experiments. (C) 2008 Elsevier B.V. All rights reserved.