CN108196796A - A kind of method, apparatus of data processing, electronic equipment, program and medium - Google Patents
A kind of method, apparatus of data processing, electronic equipment, program and medium Download PDFInfo
- Publication number
- CN108196796A CN108196796A CN201711498719.2A CN201711498719A CN108196796A CN 108196796 A CN108196796 A CN 108196796A CN 201711498719 A CN201711498719 A CN 201711498719A CN 108196796 A CN108196796 A CN 108196796A
- Authority
- CN
- China
- Prior art keywords
- hash value
- redis
- nodes
- storage cluster
- hash
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
- G06F3/0611—Improving I/O performance in relation to response time
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
Abstract
The invention discloses a kind of method, apparatus of data processing, electronic equipment, program and medium, wherein, method includes：It obtains target user and identifies UID；Target UID is calculated by Hash hash algorithm, obtains the first hash value；By storage cluster digital rings, the first Redis nodes corresponding with the first hash value are searched, storage cluster digital rings are to prestore the set of hash value and Redis node correspondences；Data processing is carried out on the first Redis nodes.The data of same user can be stored in same Redis nodes by the above method, and then avoid the problem of needing to connect multiple Redis nodes when transferring a variety of data of same user in the prior art query time is long caused by.
Description
Technical field
The present invention relates to Internet technology, especially a kind of method, apparatus of data processing, electronic equipment, program and Jie
Matter.
Background technology
With the continuous development of the communication technology, present more and more people selection by internet platform come reading information,
Such as video information is watched, read text information etc..The information content stored required for internet platform therewith is being continuously increased,
Therefore how the big data in access internet platform is urgent problem now.
At present, the huge data in storage internet platform may be used hard disk and be stored or be carried out by memory
Storage.The advantage of hard-disc storage is that memory space is big, and read-write data time is longer, although and memory can shorten data
Access time, but memory space more limits, in order to meet this feature, it now is possible to using Redis storage clusters come with
Data in internet platform are associated.Wherein, storage cluster is that the memory space in more storage devices is aggregated into one
A storage pool that unified access interface and administration interface can be provided to server, can give full play to storage device performance and
Memory usage.Data are stored and read from more storage devices according to certain rule by server, higher to obtain
Concurrent access performance.And user can on the internet by access interface will needs data storage in storage cluster.
However, personalization is generally nowadays carried out when using internet platform now for user in order to improve user experience
Recommend and for the proprietary of user data.And existing Redis storage clusters only store mass data, therefore
When transferring the data related with user or same type, the time for leading to searching data is longer, and then influences user experience.
Invention content
A technical problem to be solved of the embodiment of the present invention is：A kind of method, apparatus of data processing, electronics are provided
Equipment, program and medium can solve the problems, such as relatively low in read-write data age rate in storage cluster.
One side according to embodiments of the present invention, a kind of method of data processing provided, the method includes：
It obtains target user and identifies UID；
The target UID is calculated by Hash hash algorithm, obtains the first hash value；
By storage cluster digital rings, the first Redis nodes corresponding with first hash value, the storage collection are searched
Group's digital rings are to prestore the set of hash value and Redis node correspondences；
Data processing is carried out on the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, described by storage cluster digital rings,
Before searching the first Redis nodes corresponding with first hash value, the method further includes：
Each Redis node identifications are calculated by the hash algorithm, obtain the corresponding Hash of each Redis nodes
Value；
Each Redis nodes and its corresponding hash value are sorted according to pre-defined rule to obtain the storage cluster number
Ring.
Optionally, in another embodiment based on the above method of the present invention, it is described by the hash algorithm to every
A Redis node identifications are calculated, and obtain the corresponding hash value of each Redis nodes, including：
Each Redis node identifications are identified compiling, obtain Redis node identification coding and decodings, wherein, one
Redis node identifications correspond at least one Redis node identifications coding and decoding；
Each Redis node identifications coding and decoding is calculated by the hash algorithm, obtains each Redis node identifications
The corresponding hash value of coding and decoding, wherein, a Redis node identifications coding and decoding corresponds to a hash value.
Optionally, it is described by storage cluster digital rings in another embodiment based on the above method of the present invention, it looks into
The first Redis nodes corresponding with first hash value are looked for, including：
The magnitude relationship of each hash value in first hash value and the storage cluster digital rings, obtains institute
State the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, it is described according to first hash value with
And the magnitude relationship of each hash value in the storage cluster digital rings, the first Redis nodes are obtained, including：
It is checked in the hash value included in the storage cluster digital rings same or similar with first hash value
Hash value；
When there is the hash value identical with first hash value, determine described identical with first hash value
The corresponding Redis nodes of hash value are the first Redis nodes；
When there is no during the hash value identical with first hash value, determine to be more than institute in the storage cluster digital rings
State minimum hash value in the first hash value be with hash value similar in first hash value, determine described with described first
The corresponding Redis nodes of hash value similar in hash value are the first Redis nodes；
When there is no the hash value identical with first hash value, and the hash value in the storage cluster digital rings is equal
During less than first hash value, the corresponding Redis nodes of hash value of numerical value minimum in the storage cluster digital rings are determined
For the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, it is described according to first hash value with
And the magnitude relationship of each hash value in the storage cluster digital rings, the first Redis nodes are obtained, including：
It is checked in the hash value included in the storage cluster digital rings same or similar with first hash value
Hash value；
When there is the hash value identical with first hash value, determine described identical with first hash value
The corresponding Redis nodes of hash value are the first Redis nodes；
When there is no during the hash value identical with first hash value, determine to be less than institute in the storage cluster digital rings
State maximum hash value in the first hash value be with hash value similar in first hash value, determine described with described first
The corresponding Redis nodes of hash value similar in hash value are the first Redis nodes；
When there is no the hash value identical with first hash value, and the hash value in the storage cluster digital rings is equal
During more than first hash value, the corresponding Redis nodes of hash value of numerical value maximum in the storage cluster digital rings are determined
For the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, it is described by each Redis nodes and
Its corresponding hash value is sorted according to pre-defined rule after obtaining the storage cluster digital rings, is further included：
Obtain newly-increased Redis nodes；
The newly-increased Redis nodes are calculated by hash algorithm, obtain the second hash value；
The correspondence of second hash value and the newly-increased Redis nodes is stored in the storage cluster digital rings
In.
Optionally, it is described on the first Redis nodes in another embodiment based on the above method of the present invention
Data manipulation is carried out, including：
Data storage operations are carried out on the first Redis nodes；And/or
Data read operation is carried out on the first Redis nodes.
Other side according to embodiments of the present invention, the device of a kind of data processing provided, described device include：
Acquisition module identifies UID for obtaining target user；
Computing module calculates the target UID for passing through Hash hash algorithm, obtains the first hash value；
Searching module was used for storage cluster digital rings, searched the first Redis sections corresponding with first hash value
Point, the storage cluster digital rings are to prestore the set of hash value and Redis node correspondences；
Module for reading and writing, for carrying out data processing on the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, described device further includes：Sorting module；
The computing module is additionally operable to calculate each Redis node identifications by the hash algorithm, obtains each
The corresponding hash value of Redis nodes；
The sorting module, for each Redis nodes and its corresponding hash value to be sorted according to pre-defined rule
To the storage cluster digital rings.
Optionally, in another embodiment based on the above method of the present invention, the computing module, including：
Compilation unit is identified, for each Redis node identifications to be identified compiling, obtains Redis node identifications volume
Decoding, wherein, a Redis node identification corresponds at least one Redis node identifications coding and decoding；
Computing unit for being calculated by the hash algorithm each Redis node identifications coding and decoding, obtains each
The corresponding hash value of Redis node identification coding and decodings, wherein, a Redis node identifications coding and decoding corresponds to a hash value.
Optionally, in another embodiment based on the above method of the present invention, the searching module, for according to
The magnitude relationship of first hash value and each hash value in the storage cluster digital rings obtains the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, the searching module, including：
Unit is checked, for being checked and the first hash value phase in the hash value that includes in the storage cluster digital rings
Same or similar hash value；
Determination unit, it is described with described first for when there is the hash value identical with first hash value, determining
The corresponding Redis nodes of the identical hash value of hash value are the first Redis nodes；When there is no with first hash value
During identical hash value, determine the minimum hash value being more than in the storage cluster digital rings in first hash value for institute
Hash value similar in the first hash value is stated, determines the corresponding Redis nodes of the hash value similar in first hash value
For the first Redis nodes；When there is no the hash value identical with first hash value, and the storage cluster digital rings
In hash value when being respectively less than first hash value, determine that the hash value of numerical value minimum in the storage cluster digital rings corresponds to
Redis nodes be the first Redis nodes.
Optionally, it is described to check unit in another embodiment based on the above method of the present invention, it is additionally operable to described
The hash value same or similar with first hash value is checked in the hash value that storage cluster digital rings include；
The determination unit is additionally operable to, when there is the hash value identical with first hash value, determine described and institute
The corresponding Redis nodes of the identical hash value of the first hash value are stated as the first Redis nodes；When there is no with described first
During the identical hash value of hash value, the maximum hash value being less than in the storage cluster digital rings in first hash value is determined
For with first hash value similar in hash value, determine that the hash value similar in first hash value is corresponding
Redis nodes are the first Redis nodes；When there is no the hash value identical with first hash value, and the storage
When hash value in cluster digital rings is all higher than first hash value, numerical value maximum in the storage cluster digital rings is determined
The corresponding Redis nodes of hash value are the first Redis nodes.
Optionally, in another embodiment based on the above method of the present invention, it is described by each Redis nodes and
Its corresponding hash value is sorted according to pre-defined rule after obtaining the storage cluster digital rings, and described device further includes：Storage
Module；
The acquisition module is additionally operable to obtain newly-increased Redis nodes；
The computing module is additionally operable to calculate the newly-increased Redis nodes by hash algorithm, obtains second
Hash value；
The memory module, for the correspondence of second hash value and the newly-increased Redis nodes to be stored in
In the storage cluster digital rings.
Optionally, in another embodiment based on the above method of the present invention, the module for reading and writing, for described
Data storage operations are carried out on one Redis nodes；And/or carry out data read operation on the first Redis nodes.
Another aspect according to embodiments of the present invention, a kind of electronic equipment provided, the electronic equipment include：
Memory, for storing executable instruction；And
Processor, for communicating to perform the executable instruction so as to complete described in foregoing description with the memory
The operation of the method for data processing.
Another aspect according to embodiments of the present invention, a kind of computer program provided, including computer-readable code,
It is characterized in that, when the computer-readable code in equipment when running, the processor execution in the equipment is used to implement
The operation of the method for the data processing of foregoing description.
Still another aspect according to embodiments of the present invention, a kind of computer readable storage medium provided, based on storing
The instruction that calculation machine can be read, which is characterized in that described instruction is performed the data processing of execution foregoing description
The operation of method.
The method, apparatus and electronic equipment of a kind of data processing provided in an embodiment of the present invention, by according to target UID with
And the obtained hash value of hash algorithm be compared with the hash value in storage cluster digital rings it is corresponding so as to obtain UID
Redis nodes.The data of same user can be stored into same Redis nodes, and then avoided existing by the above method
Have in technology need to connect multiple Redis nodes query times caused by when transferring a variety of data of same user it is long
Problem.
Below by drawings and examples, technical scheme of the present invention is described in further detail.
Description of the drawings
The attached drawing of a part for constitution instruction describes the embodiment of the present invention, and is used to explain together with description
The principle of the present invention.
With reference to attached drawing, according to following detailed description, the present invention can be more clearly understood, wherein：
Fig. 1 is the flow chart of method one embodiment of data processing of the present invention.
Fig. 2 is the flow chart of another embodiment of the method for data processing of the present invention.
Fig. 3 is the flow chart of another embodiment of the method for data processing of the present invention.
Fig. 4 is the structure diagram of device one embodiment of data processing of the present invention.
Fig. 5 is the structure diagram of another embodiment of the device of data processing of the present invention.
Fig. 6 is the structure diagram of another embodiment of the device of data processing of the present invention.
Fig. 7 is the structure diagram of electronic equipment one embodiment of the present invention.
Specific embodiment
Carry out the various exemplary embodiments of detailed description of the present invention now with reference to attached drawing.It should be noted that：Unless in addition have
Body illustrates that the unlimited system of component and the positioned opposite of step, numerical expression and the numerical value otherwise illustrated in these embodiments is originally
The range of invention.
Simultaneously, it should be appreciated that for ease of description, the size of the various pieces shown in attached drawing is not according to reality
Proportionate relationship draw.
It is illustrative to the description only actually of at least one exemplary embodiment below, is never used as to the present invention
And its application or any restrictions that use.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as part of specification.
It should be noted that：Similar label and letter represents similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, then in subsequent attached drawing does not need to that it is further discussed.
The embodiment of the present invention can be applied to the electronic equipments such as terminal device, computer system, server, can with it is numerous
Other general or specialized computing system environments or configuration operate together.Suitable for electric with terminal device, computer system, server etc.
The example of well-known terminal device, computing system, environment and/or configuration that sub- equipment is used together includes but not limited to：
Personal computer system, server computer system, thin client, thick client computer, hand-held or laptop devices, based on microprocessor
System, set-top box, programmable consumer electronics, NetPC Network PC, little types Ji calculate machine Xi Tong ﹑ large computer systems and
Distributed cloud computing technology environment including any of the above described system, etc..
The electronic equipments such as terminal device, computer system, server can be in the department of computer science performed by computer system
It is described under the general linguistic context of system executable instruction (such as program module).In general, program module can include routine, program, mesh
Beacon course sequence, component, logic, data structure etc., they perform specific task or realize specific abstract data type.Meter
Calculation machine systems/servers can be implemented in distributed cloud computing environment, and in distributed cloud computing environment, task is by by logical
What the remote processing devices of communication network link performed.In distributed cloud computing environment, program module can be located at and include storage
On the Local or Remote computing system storage medium of equipment.
The side for being used to carry out data processing according to exemplary embodiment of the invention is described with reference to Fig. 1 to Fig. 3
Method.Understand spirit and principles of the present invention it should be noted that above application scene is for only for ease of and show, it is of the invention
Embodiment is unrestricted in this regard.On the contrary, embodiments of the present invention can be applied to applicable any scene.This
Invention is applied to cluster user equipment, such as background server, recommendation server etc..
Fig. 1 schematically shows a kind of flow diagram of the method for data processing according to embodiment of the present invention.
As shown in Figure 1, this method includes：
S101 obtains target UID (user identifier, User Identity).
It should be noted that target UID needs to read and write the corresponding UID of data to be current.The present invention does not limit the class of UID
Type, for example be user account number, it can be used as UID as long as the data of user's exclusive identification code can be represented.
S102 calculates target UID by Hash hash algorithm, obtains the first hash value.
The binary value of random length can be mapped as the binary value of shorter regular length by hash algorithm.It is optional
, the hash algorithm in the present invention can be FlexiHash algorithms.
Due to Redis storage clusters be based on key assignments (key-value) to form, that is to say, that provide a key
(key), it can store/read a value.For example, UID be 123456 user xx (such as：Comedy movie) data are stored in
Key：xx:uid:In 123456, yy is (such as：Action movies) data are stored in key：yy:uid:In 123456, it can use at this time
UID (123456) is as Hash Key (Hash keys), due to Hash Key identical (being all 123456), such two kinds of data (xx
Data, yy data) hash value that calculates must be identical；If original key (xx is used without using UID:uid:
123456 and yy:uid:123456) as Hash Key, the result calculated is possible to different, and which results in a use
The data at family are stored on different Redis clustered nodes.Therefore when accessing data, made using UID using user as classification
Hash value is obtained for the object of hash algorithm, it is ensured that the data of same user are stored in a Redis node.
S103 by storage cluster digital rings, searches the first Redis nodes corresponding with the first hash value.
Wherein, the storage cluster digital rings in the present invention are pre-stored hash value and Redis node correspondences
Set.
Redis nodes are the node in storage cluster, can determine Redis nodes according to physical equipment and dividing mode
Quantity.It should be noted that safety in order to protect data and integrality, can be divided into Redis master by Redis nodes
Node and Redis are from node.Wherein, Redis host nodes for receive user content (such as：Character string related to user, row
Table, the data structures such as set, hash data) and it is stored, and in Redis is used to receiving Redis host nodes from node
Appearance is backed up.And the mode present invention for dividing main and subordinate node is also not particularly limited.Such as in the middle part of a physical store machine
Point Redis nodes are as Redis host nodes, and remaining another part Redis nodes are as Redis from node；It can also part object
Whole Redis nodes in reason storage machine are as Redis host nodes, the whole in another part physical store machine
Redis nodes are used as Redis from node.
Such as when storage cluster is 16 physical store machines, every physical store machine runs 4 Redis nodes.
Can there are 2 Redis host nodes and 2 Redis in every physical store machine from node；Can also be wherein 8 physics
32 Redis nodes in machine are stored as Redis host nodes, in addition 32 Redis nodes in 8 physical store machines
As Redis from node.
And Redis host nodes are not limited with Redis from the communication mode present invention of node, in Redis host nodes
Data be periodically transmitted backup to its corresponding Redis from node；Or when the data in Redis host nodes update
When, you can it is transmitted backup to its corresponding Redis from node.
Further, the present invention does not limit the Redis nodes in storage cluster digital rings, you can with selection storage collection
All Redis host nodes and all Redis also may be used from the Redis nodes that node is in storage cluster digital rings in group
In selecting all Redis host nodes in storage cluster or all Redis from node as storage cluster digital rings
Redis nodes.It is described for convenience, below using Redis host nodes all in storage cluster as storage cluster digital rings
In Redis nodes for be illustrated.
S104 carries out data processing on the first Redis nodes.
Wherein, the first Redis nodes are target UID corresponding Redis sections for carrying out data processing in storage cluster
Point.
Hash value of the present invention by being obtained according to target UID and hash algorithm and the Hash in storage cluster digital rings
Value is compared to obtain the corresponding Redis nodes of UID.The data of same user can be stored by the above method to same
In one Redis nodes, and then avoid and need to connect multiple Redis sections in the prior art when transferring a variety of data of same user
The problem of query time is long caused by click-through.
Optionally, data processing is carried out on the first Redis nodes to specifically include：In the first enterprising line number of Redis nodes
It is operated according to storage；And/or carry out data read operation on the first Redis nodes.
The data stored on Redis nodes are all data related with user (UID), i.e., deposit the data of same user
Storage realizes the higher purpose of read-write data efficiency, can also facilitate number on the line of tracking single user on same Redis nodes
According to.
There are many data wherein related with user, and present invention citing is several but is not limited to content described in the present invention.
Such as the behavioural characteristic including user.
Wherein, the behavioural characteristic of user includes but not limited to following several data：1st, user tag data：It is used for stating
The information of family type.2nd, user's it has been recommended that data：It specially has shown that the data of user.This data is written by server-side
Redis storage clusters determine to be given to the data that user did not show.3rd, the continued broadcasting data of user：Specially user stores
The information having already viewed recently is put into recommendation results foremost, for user is guided to continue to watch.4th, the browsing record of user：
The partial data that specially user has read/watched.5th, the exposure data of user：App shows the data of user, this data
Redis storage clusters are written by server-side, recommended user reads this data filtering recommendation results, and guarantee is given to user and has not pushed away
The repeated data recommended.
When the server corresponding applied to video platform of the method in the present invention, the relevant data of UID can also include
Movie feature of user etc..
Wherein, the movie feature of user includes but not limited to following several data：1st, film label data：User states shadow
The information of sheet type.2nd, film offline feature data：The corresponding characteristic value of film.3rd, film CF data：Film is most like with it
N portions film, can be used for recommending.
Optionally, S103 (by storage cluster digital rings, searching the first Redis nodes corresponding with the first hash value)
Before, generation storage cluster digital rings are further included.Specifically, the invention also includes a kind of method of data processing, such as Fig. 2 institutes
Show, the method further includes：
S201 calculates each Redis node identifications by hash algorithm, it is corresponding to obtain each Redis nodes
Hash value.
Redis node identifications are used to identify the identity code of Redis nodes in the present invention, which can be
Nodename.Such as cluster01, cluster02 character string.
Specifically, a number can be calculated, therefore can incite somebody to action each by character string by CRC32 algorithms
Redis node identifications carry out CRC32 algorithm calculating, so as to obtain the corresponding numerical value of each Redis nodes.
When up to ten million keys (key) is stored in storage cluster, the number of key is preserved in each Redis nodes is
Determined by above-mentioned algorithm, due to the numerical value calculated by Redis nodenames may be spaced it is uneven (namely by 32
After number sorts from small to large, two neighboring interdigital difference differs greatly, this is possible to that certain Redis nodes is caused to be protected
The data number deposited is excessive).
In order to solve this problem, optionally, each Redis node identifications are calculated by hash algorithm, obtained
The corresponding hash value of each Redis nodes, including：
First, each Redis node identifications are identified compiling, obtain Redis node identification coding and decodings, wherein, one
A Redis node identifications correspond at least one Redis node identifications coding and decoding.
Specifically, the present invention can further be spliced each Redis nodenames, obtain multiple corresponding
Redis nodenames.For example, the present invention can will splice 32 numbers behind Redis nodenames cluster01.I.e.
Cluster01 corresponds to 32 mark coding and decodings：(cluster011~cluster0132).By Redis nodenames
Equally splice 32 numbers behind cluster02.That is cluster02 corresponds to 32 mark coding and decodings：(cluster021-
cluster0232).And so on, until all Redis nodenames correspond to same amount of mark coding and decoding.It needs
Illustrate, the present invention does not limit the quantity for identifying coding and decoding, i.e., the corresponding mark coding and decoding of each Redis nodes can be with
It is 32 or 64.
Secondly, each Redis node identifications coding and decoding is calculated by hash algorithm, obtains each Redis nodes mark
Know the corresponding hash value of coding and decoding.
Wherein, a Redis node identifications coding and decoding corresponds to a hash value.
After obtaining to the Redis node identifications extension of Redis nodes, the Redis of each Redis nodes can be saved
Point identification coding and decoding carries out CRC32 algorithm calculating, obtains each Redis node identifications and compiles corresponding hash value.
S202 sorts according to pre-defined rule each Redis nodes and its corresponding hash value to obtain storage cluster digital rings.
Specifically, the present invention can be ranked up to obtain storage cluster digital rings according to the size of each Redis nodenames；
Or it can be ranked up to obtain storage cluster digital rings etc. according to the size of the corresponding hash value of each Redis nodes.It for example, will
Cluster01 and its corresponding hash value are as the first place in storage cluster digital rings, by cluster02 and its corresponding Hash
It is worth as the secondary position in storage cluster digital rings, and so on, until using cluster32 and its corresponding hash value as storage
During last position in cluster digital rings, storage cluster digital rings are obtained.Explanation is also needed, the present invention does not do pre-defined rule
It limits.
Therefore, it by being compiled (splicing number) again to Redis node identifications, can be obtained for each Redis nodes
To corresponding multiple Redis node identifications coding and decodings, so as to solve the numerical value possibility calculated by Redis nodenames
It is spaced the problem of data number uneven and that certain Redis nodes is caused to preserve is excessive.
Further alternative, S103 shown in FIG. 1 (by storage cluster digital rings, is searched corresponding with the first hash value
First Redis nodes) can specifically it include：The size of each hash value in the first hash value and storage cluster digital rings
Relationship obtains the first Redis nodes.
The determining method of the above-mentioned hash value for having described storage cluster digital rings and having included and corresponding with Redis nodes
Relationship.The hash value so obtained by UID can carry out the comparison of magnitude relationship with the hash value in storage cluster digital rings,
So as to obtain the corresponding Redis nodes of UID.
The hash value wherein obtained by UID can carry out the ratio of magnitude relationship with the hash value in storage cluster digital rings
Compared with the mode present invention be not particularly limited, for example can include：
First way：
The hash value same or similar with the first hash value is checked in the hash value included in storage cluster digital rings；When
During in the presence of the hash value identical with the first hash value, determine that the hash value corresponding Redis node identical with the first hash value is
First Redis nodes；When there is no during the hash value identical with the first hash value, determine to be more than first in storage cluster digital rings
Minimum hash value in hash value is the hash value pair similar in determining and the first hash value with hash value similar in the first hash value
The Redis nodes answered are the first Redis nodes；When there is no the hash value identical with the first hash value, and storage cluster number
When hash value in ring is respectively less than the first hash value, determine that the hash value of numerical value minimum in storage cluster digital rings is corresponding
Redis nodes are the first Redis nodes.
For example, when the first hash value is 158520161, the number of each hash value in storage cluster digital rings is obtained first
Value, when in storage cluster digital rings there are numerical value be 158520161 hash value when, by numerical value be 158520161 hash value
Corresponding Redis nodes are as the first Redis nodes.It is 158520161 when numerical value is not present in storage cluster digital rings
Hash value and there are numerical value be more than 158520161 hash value when, obtain numerical value in all storage cluster digital rings and be more than
158520161 hash value.At this point, the hash value of the minimum value in hash value of the selection numerical value more than 158520161 corresponds to
Redis nodes as the first Redis nodes.Likewise, it is 158520161 when numerical value is not present in storage cluster digital rings
Hash value and there is no numerical value be more than 158520161 hash value when, obtain all Hash in all storage cluster digital rings
Value, at this point, selecting the corresponding Redis nodes of hash value of numerical value minimum in storage cluster digital rings as the first Redis nodes.
The second way：
The hash value same or similar with the first hash value is checked in the hash value included in storage cluster digital rings；When
During in the presence of the hash value identical with the first hash value, determine that the hash value corresponding Redis node identical with the first hash value is
First Redis nodes；When there is no during the hash value identical with the first hash value, determine to be less than first in storage cluster digital rings
Maximum hash value in hash value is the hash value pair similar in determining and the first hash value with hash value similar in the first hash value
The Redis nodes answered are the first Redis nodes；When there is no the hash value identical with the first hash value, and storage cluster number
When hash value in ring is all higher than the first hash value, determine that the hash value of numerical value maximum in storage cluster digital rings is corresponding
Redis nodes are the first Redis nodes.
It can be seen that the first determines the mode that the mode of the first Redis nodes determines the first Redis nodes with second
It is roughly the same, when being present in the identical hash value of the first hash value in storage cluster digital rings, determine and first hash value
The corresponding Redis nodes of identical hash value are the first Redis nodes.
When the hash value identical with the first hash value is not present in storage cluster digital rings, the first Redis is selected
Node is then that selection storage cluster digital rings (are slightly larger than the first hash value with the most similar hash value of the first hash value
Hash value；Or it is slightly less than the hash value of the first hash value)；When in storage cluster digital rings both be not present and the first hash value
Identical hash value also there is no the hash value for be slightly larger than/being slightly less than the first hash value, is directly selected in storage cluster digital rings
Minimum hash value/maximum the corresponding Redis nodes of hash value as the first Redis nodes, therefore also show hash value
With the form for occurring annular when being integrated into and realizing and search Redis nodes and searching of Redis node correspondences.
So after storage cluster digital rings are determined, however it remains data volume is continuously increased, and results in the need for collecting storage
Group carries out the problem of dilatation, that is, needs the storage of newly-increased Redis node sharing datas.Therefore, the invention also includes a kind of data
The method of processing, as shown in figure 3, this method further includes：
S301 obtains newly-increased Redis nodes.
S302 calculates newly-increased Redis nodes by hash algorithm, obtains the second hash value.
To increasing computational methods of the computational methods with the Redis nodes of foregoing description of Redis nodes newly, herein no longer one by one
It repeats.
The correspondence of second hash value and newly-increased Redis nodes is stored in storage cluster digital rings by S303.
Pass through the expansion method described in Fig. 3, it is ensured that the legacy data in original storage cluster digital rings is not done
Change, therefore can achieve the effect that reduce workload.
After the method for exemplary embodiment of the invention is described, next, with reference to figure 4 to the exemplary reality of the present invention
The computer implemented identification device based on image for applying mode illustrates.
Referring to Fig. 4, it is schematically shown that the device of computer implemented data processing according to an embodiment of the invention
Structure diagram, which, which is generally disposed at, to run in the equipment of computer program, for example, in the embodiment of the present invention
The device can be set in the equipment such as desktop computer or server, and certainly, which can also be set to notes type meter
In the calculation machine even equipment such as tablet computer.
The device of embodiment of the present invention mainly includes：Acquisition module 401, computing module 402, searching module 403, read-write
Module 404.The modules included by the device and unit are illustrated respectively below.
Acquisition module 401 identifies UID for obtaining target user.
Computing module 402 calculates target UID for passing through Hash hash algorithm, obtains the first hash value.
Searching module 403 was used for storage cluster digital rings, searched the first Redis nodes corresponding with the first hash value,
Storage cluster digital rings are to prestore the set of hash value and Redis node correspondences.
Module for reading and writing 404, for carrying out data processing on the first Redis nodes.
The device of a kind of data processing provided in an embodiment of the present invention, by being obtained according to target UID and hash algorithm
Hash value be compared to obtain the corresponding Redis nodes of UID with the hash value in storage cluster digital rings.By above-mentioned
Method can store the data of same user in same Redis nodes, so avoid in the prior art transfer it is same
The problem of needing to connect multiple Redis nodes during a variety of data of user query time be long caused by.
It is further to note that：Module for reading and writing 404, specifically for carrying out data storage behaviour on the first Redis nodes
Make；And/or carry out data read operation on the first Redis nodes.
As an example, the invention also includes a kind of device of data processing, as shown in figure 5, the device further includes sequence mould
Block 405.
Wherein, in searching module 403 first Redis corresponding with the first hash value is searched by storage cluster digital rings
Before node, computing module 402 calculates each Redis node identifications by hash algorithm, obtains each Redis nodes pair
The hash value answered；And then each Redis nodes and its corresponding hash value according to pre-defined rule are sorted and are deposited by sorting module 405
Accumulation digital rings.
As an example, the invention also includes a kind of device of data processing, the computing module 402 in the device includes：Mark
Know compilation unit and computing unit.
Compilation unit is identified, for each Redis node identifications to be identified compiling, obtains Redis node identifications volume
Decoding.
Wherein, a Redis node identification corresponds at least one Redis node identifications coding and decoding.
Computing unit calculates each Redis node identifications coding and decoding for passing through hash algorithm, obtains each
The corresponding hash value of Redis node identification coding and decodings.
Wherein, a Redis node identifications coding and decoding corresponds to a hash value.
As an example, the searching module 403 in the present invention, for according in the first hash value and storage cluster digital rings
Each hash value magnitude relationship, obtain the first Redis nodes.Then the searching module 403 in the device include check unit and
Determination unit.
It is wherein optional, unit is checked, for being checked and the first Hash in the hash value that includes in storage cluster digital rings
It is worth same or similar hash value.
Determination unit, for when there is the hash value identical with the first hash value, determining identical with the first hash value
The corresponding Redis nodes of hash value are the first Redis nodes；When there is no during the hash value identical with the first hash value, determining
In storage cluster digital rings be more than the first hash value in minimum hash value be with the first hash value similar in hash value, determine with
The corresponding Redis nodes of hash value similar in first hash value are the first Redis nodes；When there is no identical with the first hash value
Hash value, and when the hash value in storage cluster digital rings is respectively less than the first hash value, determine number in storage cluster digital rings
The minimum corresponding Redis nodes of hash value of value are the first Redis nodes.
It is further alternative, it checks unit, is additionally operable to check in the hash value included in storage cluster digital rings and first
The same or similar hash value of hash value.
Determination unit is additionally operable to, when there is the hash value identical with the first hash value, determine identical with the first hash value
The corresponding Redis nodes of hash value be the first Redis nodes；When there is no during the hash value identical with the first hash value, really
Determine in storage cluster digital rings be less than the first hash value in maximum hash value be with the first hash value similar in hash value, determine
With the first hash value similar in the corresponding Redis nodes of hash value be the first Redis nodes；When there is no with the first hash value phase
With hash value, and when the hash value in storage cluster digital rings is all higher than the first hash value, determine in storage cluster digital rings
The corresponding Redis nodes of hash value of numerical value maximum are the first Redis nodes.
As an example, the invention also includes a kind of device of data processing, as shown in fig. 6, the device further includes storage mould
Block 406.
Each Redis nodes and its corresponding hash value are sorted to obtain according to pre-defined rule in sorting module 405 and store collection
After group's digital rings, acquisition module 401 obtains newly-increased Redis nodes；Computing module 402 is by hash algorithm to increasing Redis newly
Node is calculated, and obtains the second hash value；Then memory module 406 is corresponding with newly-increased Redis nodes by the second hash value
Relationship is stored in storage cluster digital rings.
It may refer to the description of above method embodiment for the datail description that operation is performed in modules, herein not
Repeat explanation.
Certain Fig. 4, Fig. 5, the module that Fig. 6 includes are a kind of embodiment therein, and the present invention can also include one
The device of kind data processing, the device include acquisition module 401, computing module 402, searching module 403, module for reading and writing 404, row
Sequence module 405, memory module 406.
After the method and apparatus of exemplary embodiment of the invention are described, next, showing with reference to figure 7 present invention
Example property embodiment, be used to implement in the above method embodiment electronic equipment of recorded each step and illustrate.Fig. 7
The computer system/server 70 of display is only an example, should not be to the function of the embodiment of the present invention and use scope band
Carry out any restrictions.
As shown in fig. 7, computer system/server 70 is showed in the form of universal computing device.Computer system/service
The component of device 70 can include but is not limited to：One or more processor or processing unit 701, system storage 702, even
Connect the bus 703 of different system component (including system storage 702 and processing unit 701).
Computer system/server 70 typically comprises a variety of computer system readable media.These media can be appointed
What usable medium that can be accessed by computer system/server 70, including volatile and non-volatile medium, it is moveable and
Immovable medium.
System storage 702 can include the computer system readable media of form of volatile memory, such as deposit at random
Access to memory (RAM) 7021 and/or cache memory 7022.Computer system/server 70 may further include it
It is removable/nonremovable, volatile/non-volatile computer system storage medium.Only as an example, ROM 7023 can be with
For reading and writing immovable, non-volatile magnetic media (not shown in Fig. 7, commonly referred to as " hard disk drive ").Although do not exist
It shows, can be provided for the disc driver and right to moving non-volatile magnetic disk (such as " floppy disk ") read-write in Fig. 7
The CD drive of removable anonvolatile optical disk (such as CD-ROM, DVD-ROM or other optical mediums) read-write.In these feelings
Under condition, each driver can be connected by one or more data media interfaces with bus 703.In system storage 702
It can include at least one program product, which has one group of (for example, at least one) program module, these program moulds
Block is configured to perform the function of various embodiments of the present invention.
Program/utility 7025 with one group of (at least one) program module 7024, can be stored in such as system
In memory 702, and such program module 7024 includes but not limited to：Operating system, one or more application program, its
Its program module and program data may include the realization of network environment in each or certain combination in these examples.
Program module 7024 usually performs function and/or method in embodiment described in the invention.
Computer system/server 70 can also be with one or more external equipment 704 (such as keyboard, sensing equipment, displays
Device etc.) communication.This communication can be carried out by input/output (I/O) interface 705.Also, computer system/server 70
Can also by network adapter 707 and one or more network (such as LAN (LAN), wide area network (WAN) and/or
Public network, such as internet) communication.As shown in fig. 7, network adapter 707 passes through bus 703 and computer system/service
Other modules (such as processing unit 701) communication of device 70.It should be understood that although being not shown in Fig. 7, department of computer science can be combined
System/server 70 uses other hardware and/or software module.
Processing unit 701 is stored in the computer program in system storage 702 by operation, so as to perform various functions
Using and data processing, for example, performing the instruction for being used to implement each step in above method embodiment；Specifically, place
Reason unit 701 can perform the computer program stored in system storage 702, and the computer program is performed, following
Instruction is run：
It obtains target user and identifies UID；
Target UID is calculated by Hash hash algorithm, obtains the first hash value；
By storage cluster digital rings, the first Redis nodes corresponding with the first hash value, storage cluster digital rings are searched
To prestore the set of hash value and Redis node correspondences；
Data processing is carried out on the first Redis nodes.
Certainly, other the also included contents of instruction as described in the device side of method side of electronic equipment, no longer go to live in the household of one's in-laws on getting married one by one herein
It states.
A kind of electronic equipment provided in an embodiment of the present invention passes through the Hash obtained according to target UID and hash algorithm
Value is compared to obtain the corresponding Redis nodes of UID with the hash value in storage cluster digital rings.It can by the above method
The storage of the data of same user in same Redis nodes, and then is avoided in the prior art to transfer same user more
The problem of needing to connect multiple Redis nodes during kind of data query time be long caused by.
The embodiment of the present invention also provides a kind of computer program, including computer-readable code, when described computer-readable
For code when being run in equipment, the processor execution in the equipment is used to implement the data that above-mentioned Fig. 1 to Fig. 3 includes
The operation of the method for processing.Content described in the method for the data processing, this is no longer going to repeat them.
The embodiment of the present invention also provides a kind of computer readable storage medium, for storing computer-readable instruction,
Described instruction, which is performed, performs the operation of the method for the data processing that above-mentioned Fig. 1 to Fig. 3 includes.The data processing
Method described in content, this is no longer going to repeat them.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above method embodiment can pass through
The relevant hardware of program instruction is completed, and aforementioned program can be stored in a computer read/write memory medium, the program
When being executed, step including the steps of the foregoing method embodiments is performed；And aforementioned storage medium includes：ROM, RAM, magnetic disc or light
The various media that can store program code such as disk.
Each embodiment is described by the way of progressive in this specification, the highlights of each of the examples are with its
The difference of its embodiment, the same or similar part cross-reference between each embodiment.For system embodiment
For, since it is substantially corresponding with embodiment of the method, so description is fairly simple, referring to the portion of embodiment of the method in place of correlation
It defends oneself bright.
Methods and apparatus of the present invention may be achieved in many ways.For example, can by software, hardware, firmware or
Software, hardware, firmware any combinations realize methods and apparatus of the present invention.The said sequence of the step of for the method
Merely to illustrate, the step of method of the invention, is not limited to sequence described in detail above, special unless otherwise
It does not mentionlet alone bright.In addition, in some embodiments, the present invention can be also embodied as recording program in the recording medium, these programs
Including being used to implement machine readable instructions according to the method for the present invention.Thus, the present invention also covering stores to perform basis
The recording medium of the program of the method for the present invention.
Description of the invention provides for the sake of example and description, and is not exhaustively or will be of the invention
It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.It selects and retouches
It states embodiment and is to more preferably illustrate the principle of the present invention and practical application, and those of ordinary skill in the art is enable to manage
The solution present invention is so as to design the various embodiments with various modifications suitable for special-purpose.
Claims (19)
- A kind of 1. method of data processing, which is characterized in that including：It obtains target user and identifies UID；The target UID is calculated by Hash hash algorithm, obtains the first hash value；By storage cluster digital rings, the first Redis nodes corresponding with first hash value, the storage cluster number are searched Word ring is the set for prestoring hash value and Redis node correspondences；Data processing is carried out on the first Redis nodes.
- 2. according to the method described in claim 1, it is characterized in that, described by storage cluster digital rings, search with it is described Before the corresponding first Redis nodes of first hash value, the method further includes：Each Redis node identifications are calculated by the hash algorithm, obtain the corresponding hash value of each Redis nodes；Each Redis nodes and its corresponding hash value are sorted according to pre-defined rule to obtain the storage cluster digital rings.
- 3. according to the method described in claim 2, it is characterized in that, it is described by the hash algorithm to each Redis nodes Mark is calculated, and obtains the corresponding hash value of each Redis nodes, including：Each Redis node identifications are identified compiling, obtain Redis node identification coding and decodings, wherein, a Redis section Point identification corresponds at least one Redis node identifications coding and decoding；Each Redis node identifications coding and decoding is calculated by the hash algorithm, obtains each Redis node identifications compiling The corresponding hash value of code, wherein, a Redis node identifications coding and decoding corresponds to a hash value.
- 4. according to the method in any one of claims 1 to 3, which is characterized in that it is described by storage cluster digital rings, it looks into The first Redis nodes corresponding with first hash value are looked for, including：The magnitude relationship of each hash value in first hash value and the storage cluster digital rings obtains described One Redis nodes.
- 5. according to the method described in claim 4, it is characterized in that, it is described according to first hash value and it is described storage collection The magnitude relationship of each hash value in group's digital rings, obtains the first Redis nodes, including：The Hash same or similar with first hash value is checked in the hash value included in the storage cluster digital rings Value；When there is the hash value identical with first hash value, the hash value identical with first hash value is determined Corresponding Redis nodes are the first Redis nodes；When there is no during the hash value identical with first hash value, determine to be more than described the in the storage cluster digital rings Minimum hash value in one hash value be and first hash value similar in hash value, determine described with first hash value The corresponding Redis nodes of similar hash value are the first Redis nodes；When there is no the hash value identical with first hash value, and the hash value in the storage cluster digital rings is respectively less than During first hash value, the corresponding Redis nodes of hash value for determining numerical value minimum in the storage cluster digital rings are institute State the first Redis nodes.
- 6. according to the method described in claim 4, it is characterized in that, it is described according to first hash value and it is described storage collection The magnitude relationship of each hash value in group's digital rings, obtains the first Redis nodes, including：The Hash same or similar with first hash value is checked in the hash value included in the storage cluster digital rings Value；When there is the hash value identical with first hash value, the hash value identical with first hash value is determined Corresponding Redis nodes are the first Redis nodes；When there is no during the hash value identical with first hash value, determine to be less than described the in the storage cluster digital rings Maximum hash value in one hash value be and first hash value similar in hash value, determine described with first hash value The corresponding Redis nodes of similar hash value are the first Redis nodes；When there is no the hash value identical with first hash value, and the hash value in the storage cluster digital rings is all higher than During first hash value, the corresponding Redis nodes of hash value for determining numerical value maximum in the storage cluster digital rings are institute State the first Redis nodes.
- 7. according to the method described in claim 2, which is characterized in that described by each Redis nodes and its corresponding Hash value is sorted according to pre-defined rule after obtaining the storage cluster digital rings, is further included：Obtain newly-increased Redis nodes；The newly-increased Redis nodes are calculated by hash algorithm, obtain the second hash value；The correspondence of second hash value and the newly-increased Redis nodes is stored in the storage cluster digital rings.
- 8. according to the method described in claim 1, it is characterized in that, described carry out data behaviour on the first Redis nodes Make, including：Data storage operations are carried out on the first Redis nodes；And/orData read operation is carried out on the first Redis nodes.
- 9. a kind of device of data processing, which is characterized in that including：Acquisition module identifies UID for obtaining target user；Computing module calculates the target UID for passing through Hash hash algorithm, obtains the first hash value；Searching module was used for storage cluster digital rings, searched the first Redis nodes corresponding with first hash value, institute It is to prestore the set of hash value and Redis node correspondences to state storage cluster digital rings；Module for reading and writing, for carrying out data processing on the first Redis nodes.
- 10. device according to claim 9, which is characterized in that described device further includes：Sorting module；The computing module is additionally operable to calculate each Redis node identifications by the hash algorithm, obtains each The corresponding hash value of Redis nodes；The sorting module, for sorting each Redis nodes and its corresponding hash value according to pre-defined rule to obtain institute State storage cluster digital rings.
- 11. device according to claim 10, which is characterized in that the computing module, including：Compilation unit is identified, for each Redis node identifications to be identified compiling, obtains Redis node identification coding and decodings, Wherein, a Redis node identification corresponds at least one Redis node identifications coding and decoding；Computing unit for being calculated by the hash algorithm each Redis node identifications coding and decoding, obtains each The corresponding hash value of Redis node identification coding and decodings, wherein, a Redis node identifications coding and decoding corresponds to a hash value.
- 12. the device according to any one of claim 9 to 11, which is characterized in thatThe searching module, for the big of each hash value in first hash value and the storage cluster digital rings Small relationship obtains the first Redis nodes.
- 13. device according to claim 12, which is characterized in that the searching module, including：Check unit, for checked in the hash value that includes in the storage cluster digital rings it is identical with first hash value or Hash value similar in person；Determination unit, for when there is the hash value identical with first hash value, determining described and the first Hash It is worth the corresponding Redis nodes of identical hash value for the first Redis nodes；When there is no identical with first hash value Hash value when, the minimum hash value for determining in the storage cluster digital rings to be more than in first hash value is and described the Hash value similar in one hash value determines that the corresponding Redis nodes of the hash value similar in first hash value are institute State the first Redis nodes；When there is no the hash value identical with first hash value, and in the storage cluster digital rings When hash value is respectively less than first hash value, determine that the hash value of numerical value minimum in the storage cluster digital rings is corresponding Redis nodes are the first Redis nodes.
- 14. device according to claim 13, which is characterized in thatIt is described to check unit, it is additionally operable to check in the hash value included in the storage cluster digital rings and first hash value Same or similar hash value；The determination unit is additionally operable to when there is the hash value identical with first hash value, is determined described with described the The corresponding Redis nodes of the identical hash value of one hash value are the first Redis nodes；When there is no with the first Hash When being worth identical hash value, determine in the storage cluster digital rings be less than first hash value in maximum hash value be with Hash value similar in first hash value determines the corresponding Redis sections of the hash value similar in first hash value Point is the first Redis nodes；When there is no the hash value identical with first hash value, and storage cluster number When hash value in ring is all higher than first hash value, the hash value pair of numerical value maximum in the storage cluster digital rings is determined The Redis nodes answered are the first Redis nodes.
- 15. according to the device described in claim 10, which is characterized in that described by each Redis nodes and its correspondence Hash value sorted after obtaining the storage cluster digital rings according to pre-defined rule, described device further includes：Memory module；The acquisition module is additionally operable to obtain newly-increased Redis nodes；The computing module is additionally operable to calculate the newly-increased Redis nodes by hash algorithm, obtains the 2nd Hash Value；The memory module, it is described for the correspondence of second hash value and the newly-increased Redis nodes to be stored in In storage cluster digital rings.
- 16. device according to claim 9, which is characterized in that the module for reading and writing, for being saved in the first Redis Data storage operations are carried out on point；And/or carry out data read operation on the first Redis nodes.
- 17. a kind of electronic equipment, which is characterized in that including：Memory, for storing executable instruction；AndProcessor completes any institutes of claim 1-8 for communicating with the memory to perform the executable instruction State the operation of the method for data processing.
- 18. a kind of computer program, including computer-readable code, which is characterized in that when the computer-readable code is being set During standby upper operation, the processor execution in the equipment is used to implement the method for any data processings of claim 1-8 Operation.
- 19. a kind of computer readable storage medium, for storing computer-readable instruction, which is characterized in that described instruction It is performed the operation of the method for the perform claim requirement any data processings of 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711498719.2A CN108196796A (en) | 2017-12-29 | 2017-12-29 | A kind of method, apparatus of data processing, electronic equipment, program and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711498719.2A CN108196796A (en) | 2017-12-29 | 2017-12-29 | A kind of method, apparatus of data processing, electronic equipment, program and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108196796A true CN108196796A (en) | 2018-06-22 |
Family
ID=62587783
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711498719.2A Pending CN108196796A (en) | 2017-12-29 | 2017-12-29 | A kind of method, apparatus of data processing, electronic equipment, program and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108196796A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109271391A (en) * | 2018-09-29 | 2019-01-25 | 武汉极意网络科技有限公司 | Date storage method, server, storage medium and device |
| CN109739723A (en) * | 2018-12-28 | 2019-05-10 | 深圳市网心科技有限公司 | Approaches to IM, device, computer installation and storage medium |
| CN110245191A (en) * | 2019-06-18 | 2019-09-17 | 政采云有限公司 | Data processing method and device |
| CN110837499A (en) * | 2018-08-16 | 2020-02-25 | 阿里巴巴集团控股有限公司 | Data access processing method and device, electronic equipment and storage medium |
| CN111708607A (en) * | 2020-06-18 | 2020-09-25 | 哈工大机器人（合肥）国际创新研究院 | Web-based online simulation intelligent agv simulation scheduling method and device |
| CN112181974A (en) * | 2019-07-01 | 2021-01-05 | 上海宏路数据技术股份有限公司 | Identification information distribution method, system and storage equipment |
| CN113127521A (en) * | 2021-05-19 | 2021-07-16 | 福建天晴在线互动科技有限公司 | Full-amount cache scheme and system under distributed system |
| CN113157695A (en) * | 2021-03-29 | 2021-07-23 | 北京字节跳动网络技术有限公司 | Data processing method and device, readable medium and electronic equipment |
-
2017
- 2017-12-29 CN CN201711498719.2A patent/CN108196796A/en active Pending
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110837499A (en) * | 2018-08-16 | 2020-02-25 | 阿里巴巴集团控股有限公司 | Data access processing method and device, electronic equipment and storage medium |
| CN110837499B (en) * | 2018-08-16 | 2023-08-22 | 阿里巴巴集团控股有限公司 | Data access processing method, device, electronic equipment and storage medium |
| CN109271391B (en) * | 2018-09-29 | 2021-05-28 | 武汉极意网络科技有限公司 | Data storage method, server, storage medium and device |
| CN109271391A (en) * | 2018-09-29 | 2019-01-25 | 武汉极意网络科技有限公司 | Date storage method, server, storage medium and device |
| CN109739723A (en) * | 2018-12-28 | 2019-05-10 | 深圳市网心科技有限公司 | Approaches to IM, device, computer installation and storage medium |
| CN110245191A (en) * | 2019-06-18 | 2019-09-17 | 政采云有限公司 | Data processing method and device |
| CN110245191B (en) * | 2019-06-18 | 2021-07-02 | 政采云有限公司 | Data processing method and device |
| CN112181974A (en) * | 2019-07-01 | 2021-01-05 | 上海宏路数据技术股份有限公司 | Identification information distribution method, system and storage equipment |
| CN112181974B (en) * | 2019-07-01 | 2023-06-02 | 上海嗨普智能信息科技股份有限公司 | Identification information distribution method, system and storage device |
| CN111708607A (en) * | 2020-06-18 | 2020-09-25 | 哈工大机器人（合肥）国际创新研究院 | Web-based online simulation intelligent agv simulation scheduling method and device |
| CN113157695A (en) * | 2021-03-29 | 2021-07-23 | 北京字节跳动网络技术有限公司 | Data processing method and device, readable medium and electronic equipment |
| CN113157695B (en) * | 2021-03-29 | 2023-06-06 | 抖音视界有限公司 | Data processing method and device, readable medium and electronic equipment |
| CN113127521A (en) * | 2021-05-19 | 2021-07-16 | 福建天晴在线互动科技有限公司 | Full-amount cache scheme and system under distributed system |
| CN113127521B (en) * | 2021-05-19 | 2023-04-28 | 福建天晴在线互动科技有限公司 | Full cache scheme and system under distributed system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108196796A (en) | A kind of method, apparatus of data processing, electronic equipment, program and medium | |
| KR102240557B1 (en) | Method, device and system for storing data | |
| Vossen | Big data as the new enabler in business and other intelligence | |
| US9158843B1 (en) | Addressing mechanism for data at world wide scale | |
| EP3371714A1 (en) | Techniques for digital entity correlation | |
| Liu et al. | Pre-train, Prompt, and Recommendation: A Comprehensive Survey of Language Modeling Paradigm Adaptations in Recommender Systems | |
| CN107408114B (en) | Identifying join relationships based on transactional access patterns | |
| US20160299906A1 (en) | Content Item Recommendations Based On Content Attribute Sequence | |
| Dhyani et al. | Big data analytics using Hadoop | |
| CN105530272A (en) | Method and device for application data synchronization | |
| US20140324965A1 (en) | Recommending media items based on purchase history | |
| CN104182508A (en) | Data processing method and data processing device | |
| WO2015054780A1 (en) | Utilizing social information for recommending an application | |
| US10936640B2 (en) | Intelligent visualization of unstructured data in column-oriented data tables | |
| US11175993B2 (en) | Managing data storage system | |
| CN115516441A (en) | Multi-valued primary keys for multiple unique identifiers of entities | |
| CN103970813A (en) | Multimedia content searching method and system | |
| Li et al. | Building a scientific workflow framework to enable real‐time machine learning and visualization | |
| US9286349B2 (en) | Dynamic search system | |
| US10572926B1 (en) | Using artificial intelligence to efficiently identify significant items in a database | |
| Pellegrini | The economics of big data: A value perspective on state of the art and future trends | |
| US20170220936A1 (en) | Identifying Linguistically Related Content for Corpus Expansion Management | |
| CN112148461A (en) | Application scheduling method and device | |
| KR101620782B1 (en) | Method and System for Storing Data Block Using Previous Stored Data Block | |
| Sujatha et al. | An efficient Cloud Storage Model for GOP-Level Video deduplication using adaptive GOP structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |