CN113032402B

CN113032402B - Method, device, equipment and storage medium for storing data and acquiring data

Info

Publication number: CN113032402B
Application number: CN202110384078.8A
Authority: CN
Inventors: 王琳; 白建民; 刘军令; 康慨; 闫萌; 锁冲
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2021-04-09
Filing date: 2021-04-09
Publication date: 2024-01-12
Anticipated expiration: 2041-04-09
Also published as: CN113032402A

Abstract

The present disclosure relates to methods, apparatus, devices and storage media for storing data and retrieving data, to the field of artificial intelligence, and in particular to the field of intelligent searching. According to the method, determining a level of the target user in response to receiving a message indicating that the target user establishes an association with the first user; determining a target database corresponding to a level of the target user from a plurality of databases, each of the plurality of databases having a different access pattern; and storing the data related to the first user in the target database according to the access mode of the target database. By the method, quick positioning storage can be realized, query efficiency and search speed are improved, and user experience is improved.

Description

Method, device, equipment and storage medium for storing data and acquiring data

Technical Field

The present disclosure relates to the field of artificial intelligence, and more particularly, to methods, apparatuses, devices, and computer-readable storage media for storing and retrieving data in the field of smart search.

Background

With the development of computer technology, many applications involve interactions between users. For example, a user may present his or her own information in an application for other users to browse. If other users are interested in the user's content, the other users will typically be interested in the user to become a fan of the user in order to continue to obtain the user's information at a later time.

As users increase in various applications, the number of fans of users also increases dramatically. Different users have different numbers of fans due to the different content presented by the users in the application. With respect to the large amount of data associated with these users and analyses, current techniques suffer from low storage efficiency, slow search speed, and the like.

Disclosure of Invention

The present disclosure provides methods, apparatuses, devices, and storage media for storing data and retrieving data.

According to a first aspect of the present disclosure, a method for storing data is provided. The method includes determining a level of the target user in response to receiving a message indicating that the target user establishes an association with the first user; the method further includes determining a target database corresponding to the level of the target user from a plurality of databases, each of the plurality of databases having a different access pattern. The method further includes storing data related to the first user in the target database according to the access pattern of the target database.

According to a second aspect of the present disclosure, a method for acquiring data is provided. The method includes determining a level of the target user in response to receiving a request to find an associated user of the target user; determining a target database corresponding to the level of the target user from a plurality of databases, each of the plurality of databases having a different access pattern; and acquiring the data of the associated user from the target database according to the access mode of the target database.

According to a third aspect of the present disclosure, there is provided an apparatus for storing data. The apparatus includes a level determination module of the target user configured to determine a level of the target user in response to receiving a message indicating that the target user establishes an association with the first user; a target database determination module configured to determine a target database corresponding to a level of a target user from a plurality of databases, each of the plurality of databases having a different access pattern; and a storage module configured to store data related to the first user in the target database according to an access pattern of the target database.

According to a fourth aspect of the present disclosure, an apparatus for acquiring data is provided. The apparatus includes a level determination module of the target user configured to determine a level of the target user in response to receiving a request to find an associated user of the target user; a target database determination module configured to determine a target database corresponding to a level of a target user from a plurality of databases, each of the plurality of databases having a different access pattern; and the acquisition module is configured to acquire the data of the associated user from the target database according to the access mode of the target database.

According to a fifth aspect of the present disclosure, an electronic device is provided. The electronic device includes at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method according to the first aspect of the present disclosure.

According to a sixth aspect of the present disclosure, an electronic device is provided. The electronic device includes at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method according to the second aspect of the present disclosure.

According to a seventh aspect of the present disclosure there is provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method according to the first aspect of the present disclosure.

According to an eighth aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method according to the second aspect of the present disclosure.

According to a ninth aspect of the present disclosure there is provided a computer program product comprising a computer program which, when executed by a processor, implements the steps of the method according to the first aspect of the present disclosure.

According to a tenth aspect of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the steps of the method according to the first aspect of the present disclosure.

It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following specification.

Drawings

The drawings are for a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:

FIG. 1 illustrates a schematic diagram of an environment 100 in which various embodiments of the present disclosure can be implemented;

FIG. 2 illustrates a flow chart of a method 200 for storing data according to some embodiments of the present disclosure;

FIG. 3 illustrates a schematic diagram of a method 300 for querying data, according to some embodiments of the present disclosure;

FIG. 4 illustrates a schematic diagram of a method 400 for processing data according to some embodiments of the present disclosure;

FIG. 5 illustrates a block diagram of an apparatus 500 for processing data according to some embodiments of the present disclosure;

FIG. 6 illustrates a block diagram of an apparatus 600 for querying data, according to some embodiments of the present disclosure; and

fig. 7 illustrates a block diagram of an apparatus 700 capable of implementing various embodiments of the present disclosure.

Detailed Description

Exemplary embodiments of the present disclosure are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present disclosure to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

In describing embodiments of the present disclosure, the term "comprising" and its like should be taken to be open-ended, i.e., including, but not limited to. The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first," "second," and the like, may refer to different or the same object. Other explicit and implicit definitions are also possible below.

As the user fan data grows, the amount of data in the fan system increases. Because the number of vermicelli has no upper limit, a large V user can appear to have approximately hundred million vermicelli. At this time, it is necessary to provide a set of vermicelli storage systems that can support large list queries and are easily expandable.

There are two solutions in the traditional approach to the storage of these fan-data. One way is to store it directly by a relational database storage system and to perform sub-tables according to the objects of interest. However, this storage approach can lead to difficult splitting, is not easily scalable, and can present performance bottlenecks. When the number of single tables is large, the queries may result in reduced cluster performance.

Another way is to use a non-relational database for storage. However, this approach does not support conditional indexing well. In addition, problems such as an excessively large single key, uneven memory use, large key operation blocking service, and the like may also be caused.

In order to solve at least the above-mentioned problems, the present disclosure proposes an improved scheme for storing data. In this scenario, upon receiving a message indicating that a target user establishes an association with a first user, a computing device determines a level of the target user. The computing device then determines a target database corresponding to the level of the target user from a plurality of databases, each having a different access pattern. According to the access pattern of the target database, the computing device stores data related to the first user into the target database. By the method, quick positioning storage can be realized, query efficiency and search speed are improved, and user experience is improved.

Fig. 1 illustrates a schematic diagram of an environment 100 in which various embodiments of the present disclosure can be implemented. As shown in FIG. 1, environment 100 includes terminals 104, 116 and computing device 108. Two terminals 104, 116 are shown in fig. 1, which are merely examples and not limiting of the disclosure, and any number of terminals may be included.

Terminals 104 and 116 may be used to run various applications. The terminal 104 may cause the user 102 to utilize the running application to focus on the target user 114 to become an associated user of the target user 114, such as a fan of the target user 114. The terminal 116 may cause the target user 114 to query for information about his user, such as querying fan data. For ease of description, the user 102 is also referred to as a first user, who becomes an associated user of the target user after the first user focuses on the target user.

Terminals 104 and 116 may be implemented as any type of computing device including, but not limited to, mobile phones (e.g., smartphones), laptop computers, portable Digital Assistants (PDAs), electronic book (e-book) readers, portable gaming devices, portable media players, gaming devices, set-top boxes (STBs), smart Televisions (TVs), personal computers, laptop computers, in-vehicle computers (e.g., navigation units), and the like.

After the user 102 has focused on the target user 114 via the terminal 104, a message 106 is generated and sent to the computing device 108. In some embodiments, the message 106 includes an identification of the user and an identification of the target user. Alternatively or additionally, the message 106 also includes a time when the user 102 is interested in the target user 114. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof. Those skilled in the art can set the content of the message as desired and can also obtain data information of the user 102 concerning the target user 114 in any suitable manner.

The computing device 108 will store and manage data for the associated user of the target user 114. Computing device 108 includes, but is not limited to, personal computers, server computers, hand-held or laptop devices, mobile devices such as mobile phones, personal Digital Assistants (PDAs), media players, and the like, multiprocessor systems, consumer electronics, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service ("Virtual Private Server" or simply "VPS") are overcome. The server may also be a server of a distributed system or a server that incorporates a blockchain.

Computing device 108 will determine the level of the target user based on the identification of target user 114 in message 106. In some embodiments, the level of the target user is related to the number of associated users of the user, e.g., the number of associated users of the first level is below a threshold number and the number of associated users of the second level is equal to or greater than the threshold number. In some embodiments, the user's level is related to the importance of the user. For example, unimportant users have a first level and important users have a second level. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof. The content to which the levels correspond and the number of levels may be set by those skilled in the art as required.

The computing device 108 determines a target database corresponding to the level of the target user from a plurality of databases, each having a different access pattern. The access mode is a mode for accessing a data table of a corresponding repository, and includes at least a storage operation mode for storing data to the data table and a search operation mode for searching data from the data table.

In some embodiments, when the access mode is an operation mode for storing data, in the first database 110, a table in which data is to be stored is determined using an identification of a table given in the user information table, and in the second database 112, a table for storing data is determined by hashing an identification of a target user. The two databases 110 and 112 shown in fig. 1 are merely examples, and are not specifically limiting of the present disclosure, and any suitable number of databases may be provided.

In some embodiments, when the access mode is an operation mode of searching for data, in the first database 110, a table in which the data to be searched is determined using a table identifier given in the user information table, and in the second database 112, the table in which the data to be searched is determined by performing a hash operation on the identifier of the target user. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof.

There is a table of user information in computing device 108 that stores an identification of a user at a predetermined level and an identification of a table storing data of the user's associated user, including not only an identification of a table currently being used, but also an identification of a history table in the first database that has previously stored data of the user's associated user. Alternatively or additionally, the user information table further comprises an increased time for storing a table of data of the user's associated user.

Computing device 108 may thus determine the level of target user 114 through the user information table. If the identity of the target user 114 is not in the user information table, it indicates that the type of target user 114 is a first level. In some embodiments, the number of associated users of the first level of target users does not exceed a threshold number, e.g., the number of fan lines does not exceed 10 ten thousand, which may also be referred to as a small V.

If the identity of the target user 114 is in the user information table, it is indicated that the type of target user 114 is a second level. For example, the number of associated users of the target user of the second level is equal to or exceeds a threshold, e.g., the number of fan-ins is equal to or greater than 10 ten thousand, which may also be referred to as a large V.

If the level of the target user is the first level, the data of the user 102 is stored in a second database 112, such as a small V database. If the target user level is the second level, the data of the user 102 is stored in a first database 110, such as a large V database.

The data of the associated user of the target user stored in the table includes the identity of the user 102, the identity of the target user 114, and alternatively or additionally, the time at which the user 102 is concerned with the target user 114.

If based on the user's level, the user's data needs to be stored in a data table of the first database. At this point, when the computing device 108 stores the data of the user 102 in the first database for the data table of the target user 114, the stored number of associated users of the target user is searched for from the corresponding data table, and then incremented by 1 to obtain the current number of associated users.

The computing device 108 compares the current number to a first threshold number. If the first threshold number is not exceeded, storing is directly performed. When the current number equals or exceeds the first threshold number, a new data table needs to be acquired to store data for the associated user for the target user 114. If only the data of one associated user needs to be saved at the moment, the data is saved and put into a message queue. If the data of a plurality of users are stored concurrently at this time, a certain proportion of the user data is selected to be put into the message queue, and the other users are normally stored.

The computing device then obtains the target user from the message queue to obtain the new data table. Which data table has the least stored data is then viewed in the first database 110 and then taken as the new data table for storing the data of the associated user of the target user. And adding the identification of the new data table to the user information table. If there are consecutive messages in the message queue regarding the sub-table for the target user, the following messages for the target user sub-table may be processed without having to be processed based on the new data table having been determined, since the processing of the first message has completed the sub-table.

If based on the user's level, the user's data needs to be stored in the data table of the second database. At this point, when the computing device 108 stores the data of the user 102 for the current data table of the target user 114 in the second database, the stored number of users of interest of the target user is looked up from the corresponding data table, and then incremented by 1 to obtain the current number of associated users.

The computing device 108 compares the current data to a second threshold number. If the second threshold data is not exceeded, the storage is directly performed. When the current number equals or exceeds the second threshold number, a new data table needs to be retrieved from the first database to store the data of the associated user for the target user 114. If only the data of one associated user needs to be saved at the moment, the data is put into a message queue as a notification message. If there are multiple users 'data to save concurrently at this time, choose some proportion of user's data as the notification message to put into the message queue. The computing device then obtains the target user from the message queue to obtain the new data table. Which data table has the least stored data is then viewed in the first database 110 and then taken as a new data table for storing data of the user of interest to the target user. And adding the identification of the new data table to the user information table. If there are consecutive messages in the message queue regarding the sub-table for the target user, the following messages for the target user sub-table may be processed without having to be processed based on the new data table having been determined, since the processing of the first message has completed the sub-table.

In some embodiments, the first threshold number is equal to the second threshold number. In some embodiments, the first threshold data is not equal to the second threshold number. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof.

The target user 114 may also utilize the terminal 116 to query for information about its associated user. The target user 114 sends a lookup request 118 to the computing device 108 via the terminal 114 for information of its interested user. The request includes at least an identification of the target user. The computing device 108 then determines the type of the target user from the user information table based on the identification of the target user. The data of the associated user of the target user is then looked up from the first database or the second database according to its type. The lookup procedure corresponds to a stored procedure.

In some embodiments, the target user may find all associated users based on the identification of the target user. In some embodiments, the user may set the number of associated users to be acquired and then look up from a data table that recently stores the data of the user of interest of the target user. For example, if the target user is a small V, a predetermined number of users of interest that are most recent in time are looked up from the corresponding table. If the target user is a large V, since the data amount of the large V is relatively large, one of the data tables in the second database includes the second threshold number of users of interest, the data of the remaining users of interest is stored in the first database, and the data table storing the data of users of interest in the first database may be determined from the user information table. All the memory tables used from the beginning of the memory to the current time of the data of the concerned user are stored in the user information table. The user information table stores the identification of the data table in which the user concerned of the large V user per threshold number is stored and the identification of the data table currently used for storing the user concerned. Thus, the data table for acquiring the data of the part of the user concerned may be determined from the multiuser information table, for example from the most recent table, and if the number is insufficient, from the next more recent data table. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof.

By the method, quick positioning storage can be realized, query efficiency and search speed are improved, and user experience is improved.

Fig. 1 above illustrates a schematic diagram of an environment 100 in which various embodiments of the present disclosure can be implemented. A flowchart of a method 200 for storing data according to some embodiments of the present disclosure is described below in conjunction with fig. 2. Method 200 may be implemented by computing device 108 in fig. 1 or any other suitable device.

As shown in fig. 2, at block 202, the computing device 108 determines whether a message is received indicating that a target user establishes an association with a first user. If the first user is interested in the target user, a message is sent to the computing device 108 that the target user has established an association with the first user. In some embodiments, the message includes an identification of the first user, an identification of the target user, and other information. Alternatively or additionally, the message also includes a time at which the first user established an association with the target user, such as a time at which the first user focused on the target user or a time at which the first user became a fan of target users. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof.

If a message is received indicating that the target user has established an association with the first user, at block 204, a level of the target user is determined. In some embodiments, the level is determined based on the number of associated users of the target user, e.g., a large V for the number of fans exceeding a threshold number corresponds to the second level and a small V for the number of fans not exceeding the threshold number corresponds to the first level, etc. In this way, the number of associated users of the user can be quickly determined. In some embodiments, the level is determined based on the importance of the target user. For example, important users are set to the second level, and unimportant users are set to the first level. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof.

In some embodiments, the computing device 108 obtains a user information table, wherein the user information table includes information related to a predetermined level of users. For example, the identities of users whose number of associated users exceeds a threshold number are stored in a user information table. The computing device 108 then uses the identification of the target user to look up in the user information table whether there is an identification that matches the identification of the target user. If an identification can be found that matches the identification of the target user, the computing device 108 determines a predetermined level of the user corresponding to the matching identification as the level of the target user. In this way, the level of the target user can be quickly determined. In some embodiments, the user information table stores an identification of a large V for fan data exceeding a threshold number. If the identity of the target user is present in the user information table, it is indicated that the target user is a large V.

At block 206, the computing device 108 determines a target database corresponding to the level of the target user from a plurality of databases, each having a different access pattern.

In some embodiments, the target database is determined to be the first database if the level of the target user is determined to be equal to or greater than a threshold level, e.g., a second level, such as a large V level. The first database includes a plurality of tables, at least one of which is operable to store data of an associated user of the target user. In this way, the database in which the data is stored can be quickly determined.

In some embodiments, if the level of the target user is determined to be less than the threshold level, the computing device 108 determines the target database to be a second database that includes at least one table in which only a single table is available to store data of the associated user of the target user. In this way, the database in which the data is stored can be quickly determined.

At block 208, the computing device 108 stores data related to the first user in the target database according to the access pattern of the target database.

In some embodiments, when data relating to the first user is to be stored in the first database, the computing device 108 may obtain a table from the user information table that is available to store data of the associated user of the target user, the user information table including an identification of the table that is available to store data of the associated user of the target user. The computing device then stores data related to the first user in a table. In this way, data relating to the first user can be quickly stored in the table.

In some embodiments, the data of the first user of the target user is first determined to be stored in a table in the first database, and how many associated users of the target user have been stored in the table of the first database need to be queried before storage can take place. If the stored number plus the number to be currently stored equals or exceeds the first threshold number, the computing device 108 determines a table from the plurality of tables in the first database having a load below a first predetermined threshold, and stores data related to the first user in the table.

In some embodiments, if the data of the first user of the target user is first determined to be stored in the second database, the number of associated users of the target user has been stored in the table that requires querying the second database before storing. If the stored number plus the number to be currently stored equals or exceeds the second threshold number, the computing device 108 determines a table from the plurality of tables in the first database having a load below the first predetermined threshold, and stores data related to the first user in the table. Alternatively or additionally, if multiple associated user data of the target user are obtained concurrently, only a predetermined proportion of the associated user data is selected for determining the stored table in the first database, and the other data is also stored in the table of the second database.

In some embodiments, in determining that the data of the first user is to be stored in the second data, a single table storing the data of the first user is determined by hashing the identity of the target user. The data is then stored in a single table. In this way, data can be stored quickly and accurately.

A method for processing data according to various embodiments of the present disclosure is described above in connection with fig. 2. A schematic diagram of a method 300 for querying data according to some embodiments of the present disclosure is described below in connection with fig. 3. Method 300 may be implemented by computing device 108 in fig. 1 or any other suitable device.

As shown in fig. 3, in block 302, the computing device determines whether a request is received to find an associated user of a target user. If a request is received to find an associated user of the target user, at block 304, the computing device 108 determines a level of the target user.

In some embodiments, the level is determined based on the number of associated users of the target user. In this way, the level can be determined quickly and accurately.

In some embodiments, the computing device 108 obtains a user information table that includes information related to a predetermined level of users. The computing device 108 then uses the identification of the target user to look up an identification in the user information table that matches the identification of the target user. If an identification matching the identification of the target user is found, the computing device 108 determines a predetermined level of the user corresponding to the matching identification as the level of the target user. According to this manner, the level of the target user can be quickly determined.

At block 306, the computing device 108 determines a target database corresponding to the level of the target user from a plurality of databases, each having a different access pattern.

In some embodiments, if the level of the target user is determined to be equal to or greater than a threshold level, such as a large V level, the computing device 108 determines the target database to be a first database that includes a plurality of tables, at least one of which is operable to store data of an associated user of the target user. In this way, the type of database can be quickly determined.

In some embodiments, if the level of the target user is determined to be less than the threshold level, e.g., a small V level, the computing device 108 determines the target database to be a second database that includes at least one table in which only a single table is available to store data of the associated user of the target user. In this way, the type of database can be quickly determined.

At block 308, the computing device 108 obtains data associated with the user from the target database according to the access pattern with the target database.

In some embodiments, if the target database is the first database, a table is obtained from the user information table that can be used to store data of the associated user of the target user. Wherein the user information table includes an identification of the table that may be used to store data of the associated user of the target user. The computing device 108 then obtains the data for the associated user of the target user from the table. By the method, the data of the associated user can be acquired rapidly.

In some embodiments, if the determined database is the second database, the computing device 108 hashes the identity of the target user to determine a single table. The computing device 108 then obtains the data for the associated user of the target user from the list. By the method, the data of the associated user can be acquired rapidly.

A method for querying data according to various embodiments of the present disclosure is described above in connection with fig. 3. A schematic diagram of a method 400 for processing data according to some embodiments of the present disclosure is described below in connection with fig. 4. Method 400 may be implemented by computing device 108 in fig. 1 or any other suitable device.

As shown in fig. 4, at block 402, computing device 108 obtains a notification message of a newly added fan of users. The computing device 108 then queries from the user information table 406 whether an identification of the user exists. At block 408, it is determined whether an identification corresponding to the identification of the user is present in the user information table 406. If there is no identification corresponding to the identification of the user, the newly added fan data of the user is stored in the small V library 410. If there is an identification corresponding to the user's identification, then newly added fan data for the user is stored in the go-to-big V library 412.

When the fan-added data of the user is stored in the data table in the small V library 410, the data table for storing the fan-added data is determined by hashing the identification of the user. In some embodiments, if 10 data tables are stored in the small V library 410, each data table may be represented by a number in the range of 1-10. The data corresponding to the user identification is then divided by 10 to obtain a remainder, and the data table corresponding to the remainder is used as a storage table. In some embodiments, the user's identification may be processed in any suitable hashing method to determine a data table for storing fan data. The above examples are merely for the purpose of describing the present disclosure and are not intended to be a specific limitation thereof.

When storing the fan-out data of the user in the data table in the large V library 412, the data table for storing the newly added fan-out data is found from the user information table.

Alternatively or additionally, the stored fan count of the user is also queried from the data table before storing the fan count of the user in the data table of the small V bank 410, the fan count is incremented by 1 to determine whether the incremented current fan count exceeds a threshold number, and if so, the newly added fan count of the user is stored as a notification message in the message queue 414.

Also, if the number of fan-outs of the user is also queried from the data table stored when the new fan-out data of the user is stored in the data table of the large V bank 412, the number of fan-outs is incremented by 1 to determine whether the incremented current number of fan-outs exceeds the threshold number, and if so, a notification message is generated to be stored in the message queue 414.

If only the data of one vermicelli needs to be stored at the moment, the vermicelli data is put into a message queue as a notification message. If there are multiple vermicelli data stored concurrently at this time, a certain proportion of vermicelli data is selected as notification message to be put into message queue, and other vermicelli data are stored in the data table determined previously.

Computing device 108 then obtains the message stored in the message queue that pertains to the user by subscribing to the information from message queue 414. At block 416, the user information table is updated offline or asynchronously with messages subscribed from the message queue. The computing device determines the data amount stored in each data table in the large V library, and then takes the data table with small stored data amount as the data table for storing the fan data of the user later. At block 418, it is determined whether new user information is required in the user information table. If so, the identity of the table is added to the data item corresponding to the user in the user information table 406 and the time at which the table was obtained is stored. If the user information is newly added in the user information table, the user information is not needed to be added, and the information aiming at the user in the information queue is removed.

At block 404, a user queries a fan list via a computing device. The computing device 108 then determines whether an identification of the user exists from the user information table 406 at block 408. If not, the user's fan is looked up from the small V-library data table. If so, the user's fan may be looked up from the data table of the large V library. The found fan is then returned to the user. The search process is similar to the storage process.

By the method, quick positioning and storage can be guaranteed, query efficiency and search speed are improved, and user experience is improved.

Fig. 5 shows a schematic block diagram of an apparatus 500 for storing data according to an embodiment of the disclosure. As shown in fig. 5, a level determination module 502 of the target user of the apparatus 500 is configured to determine a level of the target user in response to receiving a message indicating that the target user establishes an association with the first user; a target database determination module 504 configured to determine a target database corresponding to a level of a target user from a plurality of databases, each of the plurality of databases having a different access pattern; and a storage module 506 configured to store data related to the first user in the target database according to an access pattern of the target database.

In some embodiments, the level is determined based on a number of associated users of the target user.

In some embodiments, the level determination module 502 of the target user includes: a user information table acquisition module configured to acquire a user information table including information related to a user of a predetermined level; and a matched identity determination module configured to determine whether an identity matched with the identity of the target user exists in the user information table based on the identity of the target user; and a matching level determining module configured to determine a predetermined level of the user corresponding to the matched identification as a level of the target user if it is determined that there is an identification matched with the identification of the target user.

In some embodiments, the target database determination module 504 includes: and a first database determining module configured to determine the target database as the first database if it is determined that the level of the target user is equal to or greater than the threshold level, the first database including a plurality of tables, at least one of the plurality of tables being for storing data of an associated user of the target user.

In some embodiments, the storage module 506 includes: a first data storage module configured to determine a table having a load below a first predetermined threshold from among a plurality of tables in a first database, and store data related to a first user in the table.

In some embodiments, the memory module comprises: a table acquisition module configured to determine a table usable to store data of the associated user of the target user based on a user information table including an identification of the table usable to store data of the associated user of the target user; a second data storage module configured to store data related to the first user in the determined table.

In some embodiments, the target database determination module 504 includes: and a second database determination module configured to determine the target database as a second database if the level of the target user is determined to be less than the threshold level, the second database including at least one table including a single table for storing data of associated users of the target user.

In some embodiments, the storage module 506 includes: a hash operation module configured to determine a single table from the at least one table by performing a hash operation on an identification of a target user; and a single table storage module configured to store data related to the first user in a single table.

Fig. 6 shows a schematic block diagram of an apparatus 600 for querying data in accordance with an embodiment of the present disclosure. As shown in fig. 6, the apparatus 600 includes a target user's level determination module 602 configured to determine a target user's level in response to receiving a request to find an associated user of the target user; a target database determination module 604 configured to determine a target database corresponding to a level of a target user from a plurality of databases, each of the plurality of databases having a different access pattern; and an acquisition module 606 configured to acquire data associated with the user from the target database according to the access pattern of the target database.

In some embodiments, the level is determined based on the number of associated users of the target user.

In some embodiments, the level determination module 602 of the target user includes: a user information table acquisition module configured to acquire a user information table including information related to a user of a predetermined level; and a matched identity determination module configured to determine whether an identity matched with the identity of the target user exists in the user information table based on the identity of the target user; and a matching level determining module configured to determine a predetermined level of the user corresponding to the matched identification as a level of the target user if it is determined that there is an identification matched with the identification of the target user.

In some embodiments, the target database determination module 604 includes: and a first database determining module configured to determine the target database as the first database if it is determined that the level of the target user is equal to or greater than the threshold level, the first database including a plurality of tables, at least one of the plurality of tables being for storing data of an associated user of the target user.

In some embodiments, the acquisition module 606 includes: a table acquisition module configured to determine a table usable to store data of an associated user of the target user based on a user information table including an identification of the table used to store data of the associated user of the target user; and the first acquisition module is configured to acquire the data of the associated user of the target user from the determined table.

In some embodiments, the target database determination module 604 includes: and a second database determination module configured to determine the target database as a second database if the level of the target user is determined to be less than the threshold level, the second database including at least one table including a single table for storing data of associated users of the target user.

In some embodiments, the acquisition module 606 includes: a hash operation module configured to determine a single table from the at least one table by performing a hash operation on an identification of a target user; and a second acquisition module configured to acquire data of the associated user of the target user from the single table.

According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

Fig. 7 illustrates a schematic block diagram of an example electronic device 700 that may be used to implement embodiments of the present disclosure. Device 700 may be used to implement terminals 104, 116 and computing device 108 in fig. 1. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.

As shown in fig. 7, the apparatus 700 includes a computing unit 701 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 702 or a computer program loaded from a storage unit 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the device 700 may also be stored. The computing unit 701, the ROM 702, and the RAM 703 are connected to each other through a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.

Various components in device 700 are connected to I/O interface 705, including: an input unit 706 such as a keyboard, a mouse, etc.; an output unit 707 such as various types of displays, speakers, and the like; a storage unit 708 such as a magnetic disk, an optical disk, or the like; and a communication unit 709 such as a network card, modem, wireless communication transceiver, etc. The communication unit 709 allows the device 700 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The computing unit 701 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 701 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 701 performs the various methods and processes described above, such as methods 200, 300, and 400. For example, in some embodiments, the methods 200, 300, and 400 may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 708. In some embodiments, part or all of the computer program may be loaded and/or installed onto device 700 via ROM 702 and/or communication unit 709. One or more of the steps of the methods 200, 300, and 400 described above may be performed when the computer program is loaded into RAM 703 and executed by computing unit 701. Alternatively, in other embodiments, the computing unit 701 may be configured to perform the methods 200, 300, and 400 by any other suitable means (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.

The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel or sequentially or in a different order, provided that the desired results of the technical solutions of the present disclosure are achieved, and are not limited herein.

The above detailed description should not be taken as limiting the scope of the present disclosure. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.

Claims

1. A method for storing data, comprising:

determining a level of a target user in response to receiving a message indicating that the target user establishes an association with a first user;

determining a target database corresponding to the level of the target user from a plurality of databases, each of the plurality of databases having a different access pattern; and

storing data related to the first user into the target database according to the access mode of the target database;

wherein determining the target database comprises:

if the level of the target user is determined to be equal to or greater than a threshold level, determining the target database as a first database, wherein the first database comprises a plurality of tables, and at least one table in the plurality of tables is used for storing data of the associated user of the target user;

If the level of the target user is determined to be less than a threshold level, determining the target database to be a second database, the second database including at least one table including a single table for storing data of associated users of the target user;

wherein when the access mode is an operation mode of storing data:

in the first database, a table for storing data is determined using an identification of the table given in the user information table, and in the second database, the table for storing data is determined by hashing an identification of a target user; and

when the access mode is an operation mode for searching data:

in the first database, the table in which the data to be searched is determined by using the table identifier given in the user information table, and in the second database, the table in which the data to be searched is determined by performing hash operation on the identifier of the target user;

wherein storing data related to the first user into the target database comprises:

in response to data relating to the first user to be stored in a first database,

Determining a table available for storing data of an associated user of the target user based on a user information table, the user information table comprising an identification of the table available for storing data of an associated user of the target user;

determining a number of associated users of the target user that have been stored in the table of the first database;

in response to the number of stored associated users plus the number of first users currently to be stored being equal to or exceeding a first threshold number, determining a table from a plurality of tables in a first database having a load below a first predetermined threshold, storing data relating to the first users in the table;

in response to data relating to the first user being to be stored in a second database,

determining a single table storing data of a first user by hashing the identification of the target user;

determining a number of associated users of the target user that have been stored in the single table of a second database;

determining a table with a load below a first predetermined threshold from a plurality of tables in a first database in response to the number of stored associated users plus the number of first users currently to be stored being equal to or exceeding a second threshold number;

Data relating to the first user is stored in a table of the first database.

2. The method of claim 1, wherein the level is determined based on a number of associated users of the target user.

3. The method of claim 1, wherein determining the level comprises:

acquiring a user information table, wherein the user information table comprises information related to a user with a preset level; and

determining whether an identifier matched with the identifier of the target user exists in the user information table or not based on the identifier of the target user; and

if it is determined that there is an identification matching the identification of the target user, a predetermined level of the user corresponding to the matching identification is determined as the level of the target user.

4. A method for acquiring data, comprising:

determining a level of a target user in response to receiving a request to find an associated user of the target user;

acquiring the data of the associated user from the target database according to the access mode of the target database;

Wherein determining the target database comprises:

wherein when the access mode is an operation mode of storing data:

when the access mode is an operation mode for searching data:

Wherein obtaining the data of the associated user from the target database comprises:

in response to the target database being the first database,

determining a table for storing data of an associated user of the target user based on a user information table, the user information table comprising an identification of the table for storing data of the associated user of the target user;

acquiring data of the associated user of the target user from the determined table;

in response to the target database being a second database,

determining the single table from the at least one table by hashing the identity of the target user; and

and acquiring the data of the associated user of the target user from the single table.

5. The method of claim 4, wherein the level is determined based on a number of associated users of the target user.

6. The method of claim 4, wherein determining the level comprises:

7. An apparatus for storing data, comprising:

a level determination module of a target user configured to determine a level of the target user in response to receiving a message indicating that the target user establishes an association with a first user;

a target database determination module configured to determine a target database corresponding to the level of the target user from a plurality of databases, each of the plurality of databases having a different access pattern; and

a storage module configured to store data related to the first user in the target database according to an access pattern of the target database;

wherein the target database determination module comprises:

a first database determination module configured to determine the target database as a first database if it is determined that the level of the target user is equal to or greater than a threshold level, the first database including a plurality of tables, at least one of the plurality of tables being for storing data of an associated user of the target user;

A second database determination module configured to determine the target database as a second database if it is determined that the level of the target user is less than a threshold level, the second database comprising at least one table comprising a single table for storing data of associated users of the target user;

wherein when the access mode is an operation mode of storing data:

when the access mode is an operation mode for searching data:

in the first database, a table in which data to be searched is determined by using a table identifier given in a user information table, and in the second database, the table in which the data to be searched is determined by performing a hash operation on an identifier of a target user;

wherein the storage module comprises:

a table acquisition module configured to determine a table available for storing data of an associated user of the target user based on a user information table, the user information table including an identification of the table available for storing data of the associated user of the target user, in response to data relating to a first user being to be stored in a first database;

A first number determination module configured to determine a number of associated users of a target user that have been stored in the table of the first database;

a first data storage module configured to determine a table having a load below a first predetermined threshold from a plurality of tables in a first database, in response to a number of stored associated users plus a number of first users currently to be stored being equal to or exceeding a first threshold number, store data related to the first users in the table;

a hash operation module configured to determine a single table storing data of the first user by performing a hash operation on the identification of the target user in response to the data related to the first user being to be stored in a second database;

a second number determination module configured to determine a number of associated users of the target user that have been stored in the single table of a second database;

a first table determination module configured to determine a table with a load below a first predetermined threshold from a plurality of tables in a first database in response to a number of stored associated users plus a number of first users currently to be stored being equal to or exceeding a second threshold number;

A data storage module configured to store data relating to the first user in a table of the first database.

8. The apparatus of claim 7, wherein the level is determined based on a number of associated users of the target user.

9. The apparatus of claim 7, wherein the level determination module of the target user comprises:

a user information table acquisition module configured to acquire a user information table including information related to a user of a predetermined level;

a matched identification determining module configured to determine whether an identification matched with the identification of the target user exists in the user information table based on the identification of the target user; and

and a matching level determining module configured to determine a predetermined level of a user corresponding to the matched identification as a level of the target user if it is determined that there is an identification matched with the identification of the target user.

10. An apparatus for acquiring data, comprising:

a level determination module of a target user configured to determine a level of the target user in response to receiving a request to find an associated user of the target user;

the acquisition module is configured to acquire the data of the associated user from the target database according to the access mode of the target database;

wherein the target database determination module comprises:

wherein when the access mode is an operation mode of storing data:

when the access mode is an operation mode for searching data:

wherein the acquisition module comprises:

a first determination module configured to, in response to the target database being a first database,

acquiring data of the associated user of the target user from the determined table; and

a second determination module configured to, in response to the target database being a second database,

11. The apparatus of claim 10, wherein the level is determined based on a number of associated users of the target user.

12. The apparatus of claim 10, wherein the level determination module of the target user comprises:

13. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-3.

14. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 4-6.

15. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-3.

16. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 4-6.