Technique for dynamic assignment retrieval

摘要

A memory-efficient technique 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. The invention includes providing master data comprising an input set G of hierarchically organized data g (e.g., transportation states), a condition set M of hierarchically organized data constraints m (e.g., transportation constraints), for each element g of the input set G a static condition assignment set IM(g) with elements m of the condition set M, and for each element (g,m) of the Cartesian product of the input set G and the condition set M a static value assignment set IP(g,m) with data associations included in a value set P. The invention allows to dynamically determine from the master data for an element g of the input set G an application assignment set A(g) with of elements (m,p) of the Cartesian product of the condition set M and the value set P, 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.