CN112241407B

CN112241407B - Golf course member data processing method, client management system and storage medium

Info

Publication number: CN112241407B
Application number: CN202010958455.XA
Authority: CN
Inventors: 李琦; 宋卫东
Original assignee: Chongqing Ruiyun Technology Co ltd
Current assignee: Chongqing Ruiyun Technology Co ltd
Priority date: 2020-09-11
Filing date: 2020-09-11
Publication date: 2023-06-06
Anticipated expiration: 2040-09-11
Also published as: CN112241407A

Abstract

The invention provides a golf course member data processing method, a client management system and a storage medium, which can quickly acquire matched member data by storing the member data to be accessed into a Redis cache and storing the member data by using a specific data structure, solve the problem that the member data is inquired to have a clamping experience, reduce the burden of a database, enable the database to have more resources to process other requests, and prevent the database from collapsing under the condition of overlarge access.

Description

Golf course member data processing method, client management system and storage medium

Technical Field

The invention relates to the technical field of golf course management, in particular to a golf course member data processing method, a client management system and a storage medium.

Background

Golf (golf), commonly known as a small white ball, is an outdoor ball game that is played with a club to enter a hole. Modern golf has become a surrogate for noble sports today. With the development of national economy and the improvement of the living standard of people, golf balls are gradually known, and more people slowly start to contact the sports. The ball meeting generally adopts a member registration system so as to facilitate the management of the ball meeting members and meet the requirements of the ball meeting members on online reservation, consumption, field service and the like, thereby improving the service quality.

When a customer arrives at a meeting site, a foreground worker inputs customer information, such as a customer name or a telephone, and quickly inquires member information of the customer from the background so as to meet requirements of ordering, consumption and the like. At present, the member information is stored through a MySQL database, and when the member information is queried, the data response is not timely, so that the staff is provided with a clamping feeling. And put a great deal of stress on MySQL databases, which may crash if the court clients are too large.

Disclosure of Invention

The invention provides a golf course member data processing method, a client management system and a storage medium, which mainly solve the technical problems that: the current meeting member information is stored in the database to affect the query efficiency.

In order to solve the technical problems, the invention provides a golf course member data processing method, which comprises the following steps:

acquiring a first list set of golf course member information from a target database storing the golf course member information, wherein the member information comprises a member name, a member identity and a member ID;

for each member, splicing the member name, the blank and the member identity of the member as a first field;

converting all characters in the first field of each member into hexadecimal character strings;

generating a blank second list set, sorting hexadecimal character strings of each member in ascending order according to numerical values, and storing the hexadecimal character strings into the second list set, wherein each member corresponds to a subscript of 2i-1 in the second list set; storing the member IDs of the members into the second list set, wherein the subscript in the corresponding second list set is 2i; the i is the hexadecimal character string ranking of the member; the second list set length is twice the first list set length;

and storing the second list set into a Redis cache.

Optionally, after the storing the second list set in the Redis cache, the method further includes:

acquiring a query request, including keywords to be queried;

judging the type of the keyword to be queried;

when the keyword type to be queried is a character type, converting the keyword to be queried into hexadecimal character strings;

searching character data matched with hexadecimal character strings corresponding to the keywords to be queried in the data which are in the second list set and have odd subscripts, and feeding back target member information corresponding to the matched character data to the query terminal.

Optionally, the feeding back the target member information corresponding to the matched character data to the query terminal includes:

and determining a target index of the target member information in the first list set based on the index of the matched character data in the second list set, and directly extracting the target member information from the first list set according to the target index so as to feed back the target member information to a query terminal.

Optionally, the target member information includes a member name, a member identity, and a member ID.

extracting the matched character data and adding a member ID of 1 to the index of the matched character data as the target member information.

Optionally, when the keyword type to be queried is a digital type, searching character data matched with the keyword to be queried in the data with the even index in the second list set, and feeding back target member information corresponding to the matched character data to the query terminal.

Optionally, a data storage instruction is also received before the first list set of golf course member information is obtained from the target database storing golf course member information.

The invention also provides a golf course client management system, which comprises a data storage module, wherein the data storage module comprises:

a first obtaining submodule, configured to obtain a first list set of golf course member information from a target database storing the golf course member information, where the member information includes a member name, a member identity, and a member ID;

the first processing sub-module is used for splicing the member names, the spaces and the member identities of each member as a first field, and converting all characters in the first field of each member into hexadecimal character strings;

the storage sub-module is used for generating a blank second list set, sorting hexadecimal character strings of all members in ascending order according to numerical values, and storing the hexadecimal character strings into the second list set, wherein each member corresponds to a subscript of 2i-1 in the second list set; storing the member IDs of the members into the second list set, wherein the subscript in the corresponding second list set is 2i; the i is the hexadecimal character string ranking of the member; the second list set length is twice the first list set length; and storing the second list set in a Redis cache.

Optionally, the system further comprises a data query module, wherein the data query module comprises:

the second acquisition sub-module is used for acquiring a query request, including keywords to be queried;

the second processing sub-module is used for judging the type of the keyword to be queried, and converting the keyword to be queried into a hexadecimal character string when the type of the keyword to be queried is a character type;

and the query sub-module is used for searching character data matched with hexadecimal character strings corresponding to the keywords to be queried in the data which is in the second list set and has odd subscripts, and feeding back target member information corresponding to the matched character data to the query terminal.

The present invention also provides a storage medium storing one or more programs executable by one or more processors to implement the steps of the golf course member data processing method as described above.

The beneficial effects of the invention are as follows:

the invention provides a golf course member data processing method, a client management system and a storage medium, wherein the method comprises the following steps: acquiring a first list set of golf course member information from a target database storing the golf course member information, wherein the member information comprises a member name, a member identity and a member ID; for each member, splicing the member name, the blank and the member identity of the member as a first field; converting all characters in the first field of each member into hexadecimal character strings; generating a blank second list set, sorting hexadecimal character strings of each member in ascending order according to the numerical value, and storing the hexadecimal character strings into the second list set, wherein each member corresponds to the subscript of 2i-1 in the second list set; storing the member IDs of the members into a second list set, wherein the subscript in the corresponding second list set is 2i; i is the hexadecimal string ranking of the member; the second list set length is twice the first list set length; the second set of lists is stored in a Redis cache. According to the method, the member data to be accessed are stored in the Redis cache, and the specific data structure is used for storage, so that the matched member data can be quickly obtained, the problem that the member data inquiry has a cartoon experience is solved, meanwhile, the burden of a database is reduced, more resources are provided for the database to process other requests, and database breakdown caused by overlarge access is prevented.

Drawings

FIG. 1 is a schematic flow chart of a method for processing golf course member data according to an embodiment of the present invention;

fig. 2 is a schematic structural diagram of a golf course client management system according to a third embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail by the following detailed description with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.

Embodiment one:

referring to fig. 1, fig. 1 is a schematic flow chart of a golf course member data processing method according to the present embodiment, and the method mainly includes the following steps:

s101, monitoring a data storage instruction.

In this embodiment, the data update storage period may be preset, for example, set to 1 day, and the system determines that the data storage command is monitored every one day. In an alternative embodiment of the present invention, the system may perform periodic detection on the members stored in the database, and when it is detected that the database has an update of member data with respect to the previous period, including an addition or a modification, in the current period, it is determined that a data storage instruction is monitored, so as to trigger the system to perform step S102, thereby better implementing an automated data storage process.

S102, acquiring a first list set of golf course member information from a target database storing the golf course member information, wherein the member information comprises a member name, a member identity and a member ID.

The golf course member information is stored in the target database, the database can meet the requirement of storing large data volume, but the storage and reading efficiency is low, for the embodiment, on the basis of the database storage, the related information is stored in the Redis, under the condition of ensuring the requirement of storing large data volume, the efficiency of data storage and inquiry is improved, the problem of blocking in the data storage and inquiry process is solved, meanwhile, the data inquiry is not required to be processed through the database, the processing load of the database is reduced, some calculation resources of the database process other requests, and the database collapse caused under the condition of overlarge access is prevented.

The court membership information in the database is stored in a list collection, see table 1 below:

TABLE 1

Serial number (subscript)	Member name	Membership identity	Member ID
				1	Liu x	Annual card member	100***5
2	King ×	Life-long member	210***4
				3	Gold x	Family member	120***2
…	…	…	…

S103, for each member, the member name, the space and the member identity of the member are spliced to be used as a first field.

S104, converting all characters in the first field of each member into hexadecimal character strings.

In Chinese character coding, a Chinese character corresponds to an area code and a bit number, the area code and the bit number range are all 01-94, and the formed code is called as an area bit code. The region code and the bit code in the Chinese character code of the national standard code are respectively converted into 16-system numbers, and then one Chinese character corresponds to one 4-bit 16-system number. If the hexadecimal numbers 80 are added, the built-in code of the Chinese character is obtained.

S105, generating a blank second list set.

In this embodiment, the second list set length is twice the first list set length.

S106, the hexadecimal character strings of all the members are sorted in ascending order according to the numerical value and stored in the second list set, and the subscript of each member corresponding to the second list set is 2i-1; storing the member IDs of the members into a second list set, wherein the subscript in the corresponding second list set is 2i; wherein i is a hexadecimal string rank of the member, and i is an integer greater than or equal to 1.

The hexadecimal character strings of each member are ordered according to the numerical value, so that the efficiency of data query is improved subsequently, and the problems of low query efficiency and large processing capacity caused by sequentially carrying out character string comparison and matching are avoided. The hexadecimal character strings corresponding to the member names, the spaces and the member identities are stored separately and crosswise, and when keyword matching is carried out in the data query stage, the problem of inaccurate matched data caused by identical IDs and keywords is avoided.

Taking table 1 as an example, the member information is processed, and hexadecimal strings corresponding to "bang+space+identity 1", "wang+space+identity 1", "jin+space+identity 2" are assumed to be string 1, string 2 and string 3; the numerical ascending rank is 1,2,3, respectively, and the corresponding second list set can be seen in table 2 below:

TABLE 2

S107, storing the second list set into a Redis cache.

S108, monitoring a query request, wherein the query request comprises keywords to be queried.

The system monitors a query request initiated by a foreground worker at a client, performs data query in Redis and feeds the query request back to a query terminal. Typically, the keywords to be queried are, for example, member name, telephone, member identity, etc.

S109, judging the type of the keyword to be queried, and when the type of the keyword to be queried is a text type, turning to a step S110; when the keyword type to be queried is a numeric type, the process goes to step S113.

General member names, member identities and the like are used as keywords, the keyword types are text types, the telephone or the ID, and the keyword types are numerical types.

S110, converting the keywords to be queried into hexadecimal character strings.

Aiming at the keywords to be queried of the text type, converting the keywords to be queried into hexadecimal character strings; alternatively, the conversion may not be necessary for the keywords to be queried of the numeric type.

S111, searching character data matched with hexadecimal character strings corresponding to the keywords to be queried in the data with odd index numbers in the second list set.

Aiming at the keywords to be queried of the text type, the keywords are indicated to be member names or member identity information, and query is directly carried out in the data with the index of the second list set being odd, so that the searching efficiency is improved.

Firstly, selecting the character strings in the middle of the ranking from the data with odd index numbers in the second list set for comparison, for example, 1001 clients in total, firstly selecting the character strings of the clients in the ranking 501, and comparing the character strings with hexadecimal character strings corresponding to keywords to be queried; if the number of clients is even, for example, 1002 clients, one client can be selected from the two clients ranked 501 or 502 for comparison.

If the character string of the client is identical to the hexadecimal character string corresponding to the keyword to be queried, the client is used as a matched client, namely the client needing to be queried. If the key words are not matched, judging the numerical values of the key words to be queried and the character data of the client, and if the key words are larger than the numerical values, selecting the client with the ranking close to the middle (namely, the ranking is about 3/4) from the first time selected client and the ranking maximum interval, and comparing the selected client with the ranking close to the ranking about 3/4 as the second time selected client; if the ranking is smaller than the ranking threshold, selecting the clients ranked in the middle (namely, the ranking position of about 1/4) from the interval of the first selected clients and the lowest ranked clients as the clients selected for the second time for comparison.

If the second selected client is a client with the rank of 3/4 and the character strings corresponding to the keywords to be queried are not matched, judging the character string value corresponding to the keywords to be queried and the character string value corresponding to the second selected client, if the character string value is larger than the character string value, selecting a client with the rank close to the middle (namely, the position with the rank of about 7/8) from the interval of the second selected client (with the rank of 3/4) and the client with the rank of maximum as the third selected client; if the ranking is smaller than the ranking, selecting a client with a ranking close to the middle (namely ranking about 5/8) from the interval of the client selected for the second time (ranking 3/4) and the client selected for the first time (ranking 1/2), comparing the client with the client selected for the third time, and the like until the matched client is obtained.

And when no client exists or only one client exists in the selected two client intervals, but the client still does not match with the character string corresponding to the keyword to be queried, returning a query result as that the matched client is not queried.

Based on the matching mode, the comparison times can be greatly reduced by the program, so that the query efficiency is improved.

S112, feeding back the target member information corresponding to the matched character data to the query terminal.

The target member information includes a member name, a member identity, and a member ID.

In this embodiment, hexadecimal character data corresponding to the first field of the matching client is extracted, and a member ID of 1 is added to the index of the matched character data as target member information. The client obtains the target member information, converts each character string with 4 lengths into a char character (the original character is a 16-bit 2-system number, the embodiment converts a 4-bit 16-system number to be stored in the Redis, so that each original character is changed into a character string with 4 lengths, compared with binary, the number of times of comparison can be reduced, the matching efficiency is improved), the character string is restored into a character string with a member name, a space and a member identity, and the subscript is added with the 1-system number to be taken out and packaged into an object.

S113, searching character data matched with the keyword to be queried in the data which is in the second list set and has even subscript, and feeding back target member information corresponding to the matched character data to the query terminal.

When the keyword to be searched is of a digital type, the query is based on the member ID or the telephone, so that the query is directly performed in the data with even index of the second list set, and the query efficiency is improved.

According to the golf course member data processing method, the member data to be accessed are stored in the Redis cache, and the matched member data can be quickly obtained by using the specific data structure for storage, so that the problem of a clamping experience of member data query is solved, meanwhile, the burden of a database is reduced, more resources are provided for the database to process other requests, and database breakdown caused under the condition of overlarge access is prevented.

Embodiment two:

the first embodiment provides a method for processing member data of a golf course, which is different from the first embodiment in that the system directly sends the member information of the queried matching client to the query terminal without the query terminal restoring based on the character string, specifically, determines the target subscript of the target member information in the first list set based on the subscript of the matched character data in the second list set, and directly extracts the target member information from the first list set according to the target subscript, so as to feed back the target subscript to the query terminal.

Embodiment III:

the present embodiment provides a golf course client management system based on the first embodiment and/or the second embodiment, referring to fig. 2, the system includes a data storage module 21 and a data query module 22, where the data storage module 21 includes a first acquisition sub-module 211, a first processing sub-module 212 and a storage sub-module 213, and the data query module 22 includes a second acquisition sub-module 221, a second processing sub-module 222 and a query sub-module 223; wherein the method comprises the steps of

The first obtaining sub-module 211 is configured to obtain a first list set of golf course member information from a target database storing the golf course member information, where the member information includes a member name, a member identity, and a member ID.

The first processing sub-module 212 is configured to splice, for each member, the member name+space+member identity, as a first field, and convert all characters in the first field of each member into hexadecimal character strings.

The storage sub-module 213 is configured to generate a second blank list set, sort hexadecimal strings of each member in ascending order according to the numerical value, and store the hexadecimal strings in the second list set, where each member corresponds to a subscript 2i-1 in the second list set; storing the member IDs of the members into a second list set, wherein the subscript in the corresponding second list set is 2i; i is the hexadecimal string ranking of the member; the second list set length is twice the first list set length; and storing the second set of lists in a Redis cache.

The second obtaining sub-module 221 is configured to obtain a query request, including keywords to be queried.

The second processing sub-module 222 is configured to determine a keyword type to be queried, and convert the keyword to be queried into a hexadecimal string when the keyword type to be queried is a text type.

The query sub-module 223 is configured to search for character data matched with hexadecimal character strings corresponding to the keyword to be queried in the data with the second list set and the odd index, and feed back target member information corresponding to the matched character data to the query terminal. Please refer to the description of the first embodiment and/or the second embodiment, and the description is omitted herein.

Embodiment four:

the present embodiment provides a computer-readable storage medium storing one or more programs executable by one or more processors to implement the steps of the golf course member data processing method described in embodiment one and/or embodiment two. Please refer to the description of the first embodiment and/or the second embodiment, and the description is omitted herein.

It will be appreciated by those skilled in the art that the modules or steps of the invention described above may be implemented in a general purpose computing device, they may be centralized on a single computing device, or distributed across a network of computing devices, or they may alternatively be implemented in program code executable by computing devices, such that they may be stored on a computer storage medium (ROM/RAM, magnetic or optical disk) for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than what is shown or described herein, or they may be individually manufactured as individual integrated circuit modules, or a plurality of modules or steps in them may be manufactured as a single integrated circuit module. Therefore, the present invention is not limited to any specific combination of hardware and software.

The foregoing is a further detailed description of the invention in connection with specific embodiments, and it is not intended that the invention be limited to such description. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.

Claims

1. A golf course member data processing method, comprising:

and storing the second list set into a Redis cache.

2. The golf course membership data processing method as in claim 1, further comprising, after said storing said second list set in a Redis cache:

acquiring a query request, including keywords to be queried;

judging the type of the keyword to be queried;

3. The golf course member data processing method of claim 2, wherein feeding back the target member information corresponding to the matched character data to the inquiring terminal comprises:

4. The golf course member data processing method of claim 3, wherein the target member information includes a member name, a member identity, and a member ID.

5. The golf course member data processing method of claim 2, wherein feeding back the target member information corresponding to the matched character data to the inquiring terminal comprises:

6. The golf course member data processing method of claim 2, wherein when the keyword type to be queried is a numeric type, searching for character data matched with the keyword to be queried in the data of which the subscript is even number in the second list set, and feeding back target member information corresponding to the matched character data to the query terminal.

7. The golf course member data processing method of any one of claims 1 through 6, wherein the data storage instruction is further received before the first list set of golf course member information is acquired from the target database storing golf course member information.

8. A golf course client management system comprising a data storage module, the data storage module comprising:

9. The golf course client management system of claim 8, further comprising a data query module, the data query module comprising:

the second processing sub-module is used for judging the type of the keyword to be queried, and converting the keyword to be queried into hexadecimal character strings when the type of the keyword to be queried is a character type;

10. A storage medium storing one or more programs executable by one or more processors to implement the steps of the golf course member data processing method of any one of claims 1 to 7.