13. The data storage and query method, as recited in claim 5 , wherein the Key server has three kernel data structures of: (1) a B+ tree, for storing corresponding relations between the Keys and address codes; (2) an address translating table, for storing corresponding relations between the address codes and IP addresses, and between the address codes and the port numbers; and (3) a MiniTable server monitoring table, for storing for storing loading conditions of the MiniTable servers corresponding to each address code; wherein when the Key server receives a primitive request, the Key server checks whether the primitive request is a valid Query primitive; if yes, the Key server queries an address code corresponding to a Key in the B+ tree; if no existing Key, the Key server returns information of no existing Key; if the Key exists, the Key server queries an IP address and a port number corresponding to the address code in the address translating table; if no existing IP address and no existing port number, the Key server returns to error; if the IP address and the port number exist, the Key server transfers the request to the MiniTable server corresponding to the IP address and the port number; if the request is not a valid Query primitive, the Key server checks whether the request is a valid Create primitive; if yes, the Key server queries whether a designated Key exists in the B+ tree; if the designated Key exists, the Key server returns information that the designated Key has existed; if no existing designated Key, the Key server allocates an address code according to a dispatch algorithm and the MiniTable server monitoring table, updates the MiniTable server monitoring table, queries an IP address and a port number corresponding to the address code and transfers the request to the corresponding MiniTable server; if the request is not a valid Create primitive, the Key server checks whether the request is a valid Delete primitive; if yes, the Key server queries whether a designated Key exists in the B+ tree; If no existing designated Key, the Key server returns information of no existing designated Key; if the designated Key exists, the Key server queries an IP address and a port number corresponding to an address code in the address translating table, deletes the corresponding Key in the B+ tree, updates the MiniTable server monitoring table, queries the IP address and the port number and transfers the request to the corresponding MiniTable server.
13. The data storage and query method, as recited in claim 5 , wherein the Key server has three kernel data structures of: (1) a B+ tree, for storing corresponding relations between the Keys and address codes; (2) an address translating table, for storing corresponding relations between the address codes and IP addresses, and between the address codes and the port numbers; and (3) a MiniTable server monitoring table, for storing for storing loading conditions of the MiniTable servers corresponding to each address code; wherein when the Key server receives a primitive request, the Key server checks whether the primitive request is a valid Query primitive; if yes, the Key server queries an address code corresponding to a Key in the B+ tree; if no existing Key, the Key server returns information of no existing Key; if the Key exists, the Key server queries an IP address and a port number corresponding to the address code in the address translating table; if no existing IP address and no existing port number, the Key server returns to error; if the IP address and the port number exist, the Key server transfers the request to the MiniTable server corresponding to the IP address and the port number; if the request is not a valid Query primitive, the Key server checks whether the request is a valid Create primitive; if yes, the Key server queries whether a designated Key exists in the B+ tree; if the designated Key exists, the Key server returns information that the designated Key has existed; if no existing designated Key, the Key server allocates an address code according to a dispatch algorithm and the MiniTable server monitoring table, updates the MiniTable server monitoring table, queries an IP address and a port number corresponding to the address code and transfers the request to the corresponding MiniTable server; if the request is not a valid Create primitive, the Key server checks whether the request is a valid Delete primitive; if yes, the Key server queries whether a designated Key exists in the B+ tree; If no existing designated Key, the Key server returns information of no existing designated Key; if the designated Key exists, the Key server queries an IP address and a port number corresponding to an address code in the address translating table, deletes the corresponding Key in the B+ tree, updates the MiniTable server monitoring table, queries the IP address and the port number and transfers the request to the corresponding MiniTable server. 19. The data storage and query method, as recited in claim 13 , wherein each MiniTable server has two kernel data structures of: (1) a memory table, for storing a partial MiniTable in memory according to a cache policy; and (2) a MiniTable lock, for recording locked MiniTable; wherein when the MiniTable server receives the request transferred by the Key server, the MiniTable server semantically parses the request and judges whether the MiniTable which requests an operation is locked or not; if yes, the MiniTable server adds the request into a waiting queue; if no, the MiniTable server locks up the MiniTable and generates an executive plan; thereafter, the MiniTable server judges whether the MiniTable is located in the memory table; if yes, the MiniTable server directly executes the request; if no, the MiniTable server further judges whether there is enough memory space or not; if no, the MiniTable server writes a partial MiniTable into a distributed file system according to the dispatch policy, comprising comparing a memory version of the MiniTable with a file version of the MiniTable and then only writing updated parts in in a log compressed format; after obtaining enough memory space, the MiniTable server reads the MiniTable file from the distributed file system and decompresses; the MiniTable server transforms the log files of the MiniTable into a format of data and stores the log files in the format of data into the memory table; then the MiniTable server executes the request, unlocks the MiniTable and returns a result.