Data Storage method and data storage structure

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.

1 . A method of storing data, comprising the steps of: 
 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 the first data node includes storing in the first node a two-tuple linker which comprises a first identifier indicating said first flat table and a second identifier indicating a row of said element in the first flat table.    
   
   
       2 . The method as claimed in  claim 1 , further comprising: storing in the first data node a piece of data together with said two-tuple linker.  
   
   
       3 . The method as claimed in  claim 1  or  2 , wherein said step of setting the second data node further includes: 
 storing in the second data node at least one two-tuple linker each comprising a first identifier indicating a second flat table of at least one flat table and a second identifier indicating an element of a plurality of elements in the second flat table.    
   
   
       4 . The method as claimed in  claim 1 , wherein said step of setting the second data node further includes: 
 storing in the second data node a piece of data.    
   
   
       5 . The method as claimed in  claim 3 , wherein the second flat table and the first flat table are the same flat table.  
   
   
       6 . The method as claimed in  claim 3 , wherein the second flat table and the first flat table are different flat tables.  
   
   
       7 . A data storage structure, comprising: 
 a first data node set in a first storage area;    a second data node set 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 first data node includes a two-tuple linker which comprises a first identifier indicating said first flat table and a second identifier indicating a row of said element in the first flat table.    
   
   
       8 . The data storage structure as claimed in  claim 7 , wherein a piece of data is stored in the first data node.  
   
   
       9 . The data storage structure as claimed in  claim 7 , wherein said second data node includes one or more two-tuple linkers, each of which includes a first identifier indicating a second flat table of the at least one flat table and a second identifier indicating an element of a plurality of elements in the second flat table.  
   
   
       10 . The data storage structure as claimed in any one of claims  7 , wherein said second data node includes a piece of data.  
   
   
       11 . The data storage structure as claimed in  claim 9 , wherein the second flat table and the first flat table are the same flat table.  
   
   
       12 . The data storage structure as claimed in  claim 9 , wherein the second flat table and the first flat table are different flat tables.  
   
   
       13 . The data storage structure as claimed in  claim 7 , wherein the first data node is a leaf node of tree-type storage architecture.