A computer-implemented data query method, characterized in that the method comprises: obtaining a hash code of content to be queried; obtaining data units corresponding to the hash code and brief information of the content to be queried; wherein each of the data units is used to store content having a same hash code; comparing, in parallel, the brief information with a plurality of brief information in the data units to determine whether they are the same; according to the content to be queried and stored content which is stored in the data units and has the same brief information as the content to be queried, determining whether the content to be queried is stored in the data units, wherein the content to be queried and the stored content are a key respectively; the data units are hash buckets in a separate chaining hash table; wherein each of the hash buckets comprises a data block and a brief information sequence which is implemented with an array structure, the brief information sequence comprising the brief information respectively corresponding to respective stored contents in the data block, wherein the obtaining data units corresponding to the hash code and brief information of the content to be queried comprises: obtaining only those hash buckets corresponding to the hash code and the brief information of the key to be queried, based on the key to be queried and a preset hash algorithm employed to obtain the hash code of the key to be queried, wherein high N bits of the hash code are taken as the brief information of the key to be queried, where N is an integer greater than 0, wherein the comparing, in parallel, the brief information with a plurality of brief information in the data units to determine whether they are the same comprises: using a Single Instruction Multiple Data (SIMD) instruction to compare, in parallel, the brief information of the key to be queried with the plurality of brief information in the brief information sequence to determine whether they are the same. obtaining a hash code of content to be queried; obtaining data units corresponding to the hash code and brief information of the content to be queried; wherein each of the data units is used to store content having a same hash code; comparing, in parallel, the brief information with a plurality of brief information in the data units to determine whether they are the same; according to the content to be queried and stored content which is stored in the data units and has the same brief information as the content to be queried, determining whether the content to be queried is stored in the data units, wherein the content to be queried and the stored content are a key respectively; the data units are hash buckets in a separate chaining hash table; wherein each of the hash buckets comprises a data block and a brief information sequence which is implemented with an array structure, the brief information sequence comprising the brief information respectively corresponding to respective stored contents in the data block, wherein the obtaining data units corresponding to the hash code and brief information of the content to be queried comprises: obtaining only those hash buckets corresponding to the hash code and the brief information of the key to be queried, based on the key to be queried and a preset hash algorithm employed to obtain the hash code of the key to be queried, wherein high N bits of the hash code are taken as the brief information of the key to be queried, where N is an integer greater than 0, wherein the comparing, in parallel, the brief information with a plurality of brief information in the data units to determine whether they are the same comprises: using a Single Instruction Multiple Data (SIMD) instruction to compare, in parallel, the brief information of the key to be queried with the plurality of brief information in the brief information sequence to determine whether they are the same. obtaining only those hash buckets corresponding to the hash code and the brief information of the key to be queried, based on the key to be queried and a preset hash algorithm employed to obtain the hash code of the key to be queried, wherein high N bits of the hash code are taken as the brief information of the key to be queried, where N is an integer greater than 0, wherein the comparing, in parallel, the brief information with a plurality of brief information in the data units to determine whether they are the same comprises: using a Single Instruction Multiple Data (SIMD) instruction to compare, in parallel, the brief information of the key to be queried with the plurality of brief information in the brief information sequence to determine whether they are the same.