Abstract: In one aspect, a method of storing data includes setting a first data node in a first storage area and setting a second data node in a second storage area. The second data node is an element of a plurality of elements forming a first flat table of at least one flat table in the second storage area. The step of setting a first data node includes storing in the first data node a two-tuple linker which comprises a first identifier indicating the first flat table and a second identifier indicating the row of the element in the first flat table. In another aspect a corresponding data storage structure is further provided.

Abstract: A data storage method and a data storage structure are provided. In one aspect, a method of storing data includes setting a first data node in a first storage area; setting a second data node in a second storage area; wherein said second data node is an element of a plurality of elements forming a first flat table of at least one flat table in the second storage area; and said step of setting a first data node includes storing in the first data node a two-tuple linker which comprises a first identifier indicating said first flat table and a second identifier indicating the row of said element in the first flat table. In another aspect a corresponding data storage structure is further provided. According to the present invention, it is able to achieve easily data chaining via a two-tuple linker in a special-purpose processor that does not support a pointer of memory address, thereby reducing requirements on space needed for data storage and enhancing efficiency of chaining each data segment.