Memory-efficient techniques are disclosed for the dynamic retrieval of assignments concerning, for example, the transportation of goods or information between discrete transportation states (such as coordinates of geographical sites or IP addresses of different computers) is described. Embodiments of the invention allow to dynamically determine from the master data, for an element g of the input set G (e.g., transportation states), an application assignment set A(g) of elements (m,p) of the Cartesian product of the condition set M (e.g., transportation constraints) and the value set P (data associations), taking into account the hierarchical organization of the input set G and the condition set M. The data assignment set A(g) may be processed by transportation path optimization mechanisms.