Abstract: The invention refers to a method of creating, storing and retrieving data sets including many complex data elements comprising the steps of receiving multiple data elements to be stored from an input data structure, providing a transformed and normalized data structure for storage into an inverted index and storage data system and providing a inverted index based search engine that allows to retrieve those data elements using hierarchical and relational data queries. In particular, the invention refers to a method for providing an interface to an inverted index and storage by creating algorithmically a logical index schema and view from the structure of the received data elements, including hierarchical and other relational information. Moreover, the present invention also refers to a method for searching those hierarchical and relational searching data structures.

Abstract: The present invention relates to transgenic potato plants having an increased resistance against Phytophthora infestans and a comparable yield of potato tubers compared with the wildtype potato plants, wherein the blb1-gen and blb2-gen are integrated within a specific genetic background into the potato plant.

Abstract: The invention refers to a method creating a data structure including many data elements comprising the steps of receiving multiple data elements to be stored from an input data structure, providing a continuous array in memory, allocating memory space within the continuous array for the data elements and storing the data elements in the allocated memory space. In particular, the invention refers to a method for creating a tree based dictionary from data elements received from an input structure. Moreover, it refers to a method for searching data structures including tokens by means of a tree based dictionary and a method for annotating tokens in a data structure. The invention does also refer to corresponding computer systems, software and storage media.

Abstract: The invention refers to a method creating a data structure including many data elements comprising the steps of receiving multiple data elements to be stored from an input data structure, providing a continuous array in memory, allocating memory space within the continuous array for the data elements and storing the data elements in the allocated memory space. In particular, the invention refers to a method for creating a tree based dictionary from data elements received from an input structure. Moreover, it refers to a method for searching data structures including tokens by means of a tree based dictionary and a method for annotating tokens in a data structure. The invention does also refer to corresponding computer systems, software and storage media.