Hot ticket card blacklist generation method and device and medium

Abstract

The application discloses a hot ticket card blacklist generation method and device and a medium, relates to the technical field of computers, and comprises the following steps: determining a quantity threshold of a hot ticket card blacklist; sorting each initial ticket card according to the time attribute of each initial ticket card to obtain a first sorting result, and screening a first candidate ticket card from the first sorting result; if the first ticket card quantity of the first candidate ticket card is not less than the quantity threshold, determining a target ticket card from the first candidate ticket card according to a priority rule; if the first ticket card quantity is less than the quantity threshold, sorting each initial ticket card according to the balance information in each initial ticket card to obtain a second sorting result, and screening a second candidate ticket card from the second sorting result; screening the target ticket card from the first candidate ticket card and the second candidate ticket card, and taking the target ticket card as the hot ticket card blacklist. The application can accurately obtain a hot ticket card blacklist with higher activity, and can reduce the memory resource demand on the memory database of a gate.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a method, device and medium for generating a hot ticket card blacklist. Background Art

[0002] Rail transit (such as urban subways) generates real-time transaction data on passengers entering and exiting stations. Abnormal scenarios such as blacklisted tickets may occur when passengers pass through the gate. When the data reaches the clearing system at the subway network center, the clearing system needs to identify the transaction data of blacklisted tickets to avoid discrepancies between revenue and actual conditions.

[0003] Due to the massive volume of transaction data generated daily by the subway, with cities with larger network networks generating approximately 15 million transactions per day, and the potential for delayed transmission of transactions held at gates, revenue verification requires a lengthy period. The clearing system must identify legitimate transactions requiring revenue clearing from this massive volume of transaction data. However, existing techniques for performing blacklist verification on this massive volume of transaction data can lead to resource consumption and performance issues for physical servers and application systems, failing to meet the clearing system's need for accurate and rapid blacklisting of ticket cards. Summary of the Invention

[0004] The present application provides a method, device and medium for generating a hot ticket blacklist, which can accurately obtain a hot ticket blacklist with high activity, reduce the memory resource requirements of the gate machine memory database, and realize rapid blacklist verification of transaction data.

[0005] In a first aspect, the present application provides a method for generating a hot ticket card blacklist, which is applied to a server, and the method includes:

[0006] Determine the quantity threshold of the hot ticket card blacklist;

[0007] sorting the initial tickets in the initial ticket list according to their time attributes to obtain a first sorting result, and selecting first reserve ticket cards that meet a first preset standard from the first sorting result;

[0008] If the number of first tickets in the first standby ticket card is not less than the number threshold, determining target tickets with the number threshold from the first standby ticket card according to a priority rule, and adding the target tickets to the hot ticket blacklist;

[0009] If the number of first tickets in the first backup ticket card is less than the number threshold, sorting the initial tickets according to the balance information in the initial tickets to obtain a second sorting result, and selecting second backup ticket cards that meet a second preset standard from the second sorting result;

[0010] Target tickets are screened out from the first standby ticket cards and the second standby ticket cards, and the target tickets are used as the hot ticket blacklist.

[0011] Furthermore, the time attributes include a first time attribute of the initial storage of the ticket and a second time attribute of the most recent use of the ticket; the sorting of the initial ticket cards in the initial ticket card list according to their time attributes to obtain a first sorting result, and screening out first reserve ticket cards that meet the first preset standard from the first sorting result, includes: sorting the initial ticket cards according to their first time attributes to obtain a third sorting result, and screening out a first number of first preliminary screening ticket cards from the third sorting result; sorting the initial ticket cards according to their second time attributes to obtain a fourth sorting result, and screening out a second number of second preliminary screening ticket cards from the fourth sorting result; and performing union processing on the first preliminary screening ticket cards and the second preliminary screening ticket cards to obtain first reserve ticket cards.

[0012] Furthermore, selecting target tickets from the first and second backup ticket cards includes: performing a union process on the first and second backup ticket cards to obtain candidate tickets; if the number of second tickets of the candidate tickets is not less than the number threshold, determining target tickets with the number threshold from the candidate tickets according to a priority rule, and adding the target tickets to the hot ticket blacklist; if the number of second tickets is less than the number threshold, adding the candidate tickets to the hot ticket blacklist.

[0013] In a second aspect, the present application provides a gate ticket checking method, which is applied to a gate, and the method includes:

[0014] Receive a hot ticket blacklist sent by the server, where the hot ticket blacklist is obtained by filtering the server from the initial ticket list;

[0015] When it is detected that the ticket recognition operation is triggered, the ticket identification of the current ticket is obtained;

[0016] A clearing decision for the transaction data corresponding to the current ticket is determined based on the hot ticket blacklist and the ticket identifier, so that a clearing system performs clearing processing on the transaction data based on the clearing decision.

[0017] Furthermore, the clearing decision for the transaction data corresponding to the current ticket card is determined based on the hot ticket card blacklist and the ticket card identifier, so that the clearing system performs clearing processing on the transaction data based on the clearing decision, including: determining whether the current ticket card can be found from the hot ticket card blacklist based on the ticket card identifier; if it can be found, determining that the clearing decision is to delete the transaction data of the current ticket card, and prohibiting the clearing system from clearing the transaction data; if it cannot be found, determining that the clearing decision is to retain the transaction data of the current ticket card.

[0018] Furthermore, after determining that the clearing decision is to retain the transaction data of the current ticket card, it also includes: during the idle period of the clearing system, determining whether the current ticket card can be found from the cold ticket card blacklist based on the ticket card identification, and the cold ticket card blacklist is the ticket card in the initial ticket card list except the hot ticket card blacklist; if it can be found, the clearing system is prohibited from clearing the transaction data of the current ticket card.

[0019] Furthermore, the method also includes: extracting key information from the transaction data of the current ticket and sending the key information to the security access component of the gate; when the security access component completes the transaction request corresponding to the current ticket based on the key information and obtains revenue data, generating a transaction verification code; assembling the revenue data and the transaction verification code into a transaction detail record, so that the clearing system can verify the legitimacy of the transaction detail record.

[0020] In a third aspect, the present application provides a hot ticket blacklist generation device, which is integrated into a server, and the device includes:

[0021] A quantity threshold acquisition module is used to determine the quantity threshold of the hot ticket card blacklist;

[0022] a reserve ballot card screening module, configured to sort the initial ballot cards in the initial ballot card list according to their time attributes to obtain a first sorting result, and to screen out first reserve ballot cards that meet a first preset standard from the first sorting result;

[0023] a blacklist determination module configured to, if the number of first tickets in the first reserve ticket card is not less than the number threshold, determine target tickets with the number threshold from the first reserve ticket card according to a priority rule, and add the target tickets to the hot ticket blacklist;

[0024] The backup ballot card screening module is further configured to, if the number of first ballot cards in the first backup ballot card is less than the number threshold, sort the initial ballot cards according to the balance information of the initial ballot cards to obtain a second sorting result, and screen out second backup ballot cards that meet a second preset standard from the second sorting result;

[0025] The blacklist determination module is further configured to filter out target tickets from the first standby ticket cards and the second standby ticket cards, and use the target tickets as the hot ticket blacklist.

[0026] In a fourth aspect, the present application provides a gate ticket checking device integrated into the gate, the device comprising:

[0027] The first data receiving module is used to receive a hot ticket card blacklist sent by the server, wherein the hot ticket card blacklist is obtained by filtering the server from the initial ticket card list;

[0028] A second data acquisition module is used to acquire the ticket identification of the current ticket when it is detected that the ticket recognition operation is triggered;

[0029] The clearing decision determination module is used to determine the clearing decision for the transaction data corresponding to the current ticket based on the hot ticket blacklist and the ticket identifier, so that the clearing system performs clearing processing on the transaction data based on the clearing decision.

[0030] In the fifth aspect, the present application provides an electronic device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the hot ticket blacklist generation method and gate ticket checking method described in any embodiment of the present application.

[0031] In a sixth aspect, the present application provides a computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a processor to implement the hot ticket blacklist generation method and gate ticket checking method described in any embodiment of the present application when executed.

[0032] In order to solve the defects of the existing technology in the background technology, the embodiment of the present application provides a hot ticket blacklist generation method, and the execution of this method can bring the following beneficial effects: the server of this application screens the initial ticket list according to the time attributes and balance information of the initial ticket, and can accurately obtain a hot ticket blacklist with higher activity; compared with the initial ticket list, the data volume of the hot ticket blacklist is smaller, which can reduce the memory resource requirements of the gate machine memory database, so as to realize the rapid blacklist verification of transaction data.

[0033] It should be noted that the above-mentioned computer instructions may be stored in whole or in part on a computer-readable storage medium. The computer-readable storage medium may be packaged together with the processor of the gate ticket inspection device, or may be packaged separately from the processor of the gate ticket inspection device, and this application does not limit this.

[0034] The descriptions of the second, third, ..., and sixth aspects of this application can refer to the detailed description of the first aspect; and the beneficial effects of the descriptions of the second, third, ..., and sixth aspects can refer to the analysis of the beneficial effects of the first aspect, which will not be repeated here.

[0035] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easily understood through the following description.

[0036] It is understandable that before using the technical solutions disclosed in the embodiments of this application, the type, scope of use, and usage scenarios of the personal information involved in this application should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0038] Figure 1 A flowchart of a method for generating a hot ticket blacklist provided in an embodiment of the present application;

[0039] Figure 2 A schematic diagram of a flow chart of a gate ticket checking method provided in an embodiment of the present application;

[0040] Figure 3A A schematic diagram of a terminal generating a TAC code according to an embodiment of the present application;

[0041] Figure 3B A schematic diagram of the TAC code verification of the clearing system provided in an embodiment of the present application;

[0042] Figure 4A A schematic diagram of the overall structure of the clearing and sorting system provided in an embodiment of the present application;

[0043] Figure 4B A schematic diagram of the first-level revenue protection provided in an embodiment of the present application;

[0044] Figure 4C A schematic diagram of secondary revenue protection provided in an embodiment of the present application;

[0045] Figure 5 A schematic diagram of the design of the Redis key structure provided in the embodiment of the present application;

[0046] Figure 6 A schematic diagram of the structure of a hot ticket card blacklist generation device provided in an embodiment of the present application;

[0047] Figure 7 A schematic structural diagram of a gate ticket checking device provided in an embodiment of the present application;

[0048] Figure 8 This is a block diagram of an electronic device used to implement a hot ticket card blacklist generation method and a gate ticket checking method in an embodiment of the present application. DETAILED DESCRIPTION

[0049] To make the purpose, technical solutions, and advantages of the embodiments of the present application more clear, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of this application.

[0050] It should be noted that the terms "first", "second", "target" and "original" in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including", "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0051] Figure 1 This is a flow chart of a method for generating a hot ticket blacklist provided in an embodiment of the present application. This embodiment can be applied to generating a hot ticket blacklist for rail transit passengers. The method for generating a hot ticket blacklist provided in this embodiment can be executed by a hot ticket blacklist generation device provided in an embodiment of the present application. This device can be implemented in software and / or hardware and integrated into an electronic device that executes this method. Preferably, the electronic device in this embodiment of the present application can be a server.

[0052] See also Figure 1 The method of this embodiment includes but is not limited to the following steps:

[0053] S110: Determine the quantity threshold of the hot ticket card blacklist.

[0054] The initial ticket card list consists of a hot ticket card blacklist and a cold ticket card blacklist. The hot ticket card blacklist refers to a ticket card list with higher activity in the blacklist. In other words, it also indicates a ticket card list with a higher probability of being used for rail transit in the future. The cold ticket card blacklist refers to a ticket card list with lower activity in the blacklist. In other words, it also indicates a ticket card list with a lower probability of being used for rail transit in the future. Since the amount of data in the initial ticket card list is too large, in order to improve the blacklist verification performance of the ticket card when the passenger passes the gate, a blacklist filtering algorithm can be set so that the ticket card list with higher activity (that is, the ticket card list with a higher probability of being used for rail transit in the future) can be filtered out from the initial ticket card list to obtain a hot ticket card blacklist. The server can read the number threshold of the hot ticket card blacklist from the configuration file, denoted as N.

[0055] S120: Sort the initial tickets in the initial ticket list according to their time attributes to obtain a first sorting result, and select first reserve ticket cards that meet a first preset standard from the first sorting result.

[0056] Specifically, sorting the initial tickets in the initial ticket list according to their time attributes to obtain a first sorting result, and selecting first reserve tickets that meet a first preset standard from the first sorting result includes the following steps:

[0057] First, the initial tickets are sorted according to the first time attribute of the initial tickets to obtain a third sorting result, and a first number of first preliminary screening tickets are screened from the third sorting result.

[0058] Among them, the time attribute of the ticket includes the first time attribute of the ticket initially entering the (blacklist) database. The first time attribute is the time when a ticket first enters the database of the initial ticket list. The first quantity can be set to A.

[0059] Rail transit generates a large number of blacklists every day. It is necessary to determine whether these blacklists are new blacklists or historical blacklists. The judgment method is: by analyzing and processing the historical blacklist, gradually comparing the serial number blacklist of the day. If the ticket card is not in the historical blacklist table, then the first time attribute of the blacklist of the ticket card is set to the current time; if the ticket card is in the historical blacklist table, then the first time attribute of the blacklist of the ticket card remains unchanged, and the blacklist priority of each ticket card is set to the corresponding priority.

[0060] In an embodiment of the present application, the first time attribute of the initial ticket is first determined, and the initial tickets are sorted in chronological order based on the first time attribute. This may be to screen out a first number of first preliminary screening tickets from the initial tickets, or it may be to screen out the first preliminary screening tickets from the initial tickets whose first time attribute is within a preset time period (such as three months) from the current time.

[0061] Second, the initial tickets are sorted according to the second time attribute of the initial tickets to obtain a fourth sorting result, and a second number of second preliminarily screened tickets are screened from the fourth sorting result.

[0062] The time attribute of the ticket also includes a second time attribute of the most recent use of the ticket, and the second quantity can be set to B.

[0063] In an embodiment of the present application, the second time attribute of the initial ticket is first determined, and the initial tickets are sorted in chronological order based on the second time attribute. A second number of second preliminary screening tickets may be screened out from the initial tickets, or second preliminary screening tickets whose second time attributes are within a preset time period (such as three days) from the current time may be screened out from the initial tickets.

[0064] Optionally, determine whether all initial tickets have any transactions on the day (i.e., whether they are in use), including inbound transactions, update transactions, or outbound transactions; if an initial ticket is in use, the blacklist priority of the initial ticket is set to the corresponding priority; if an initial ticket is not in use, the priority remains unchanged.

[0065] Third, the first preliminary screening ticket card and the second preliminary screening ticket card are combined to obtain a first reserve ticket card.

[0066] In an embodiment of the present application, since there may be an intersection between the first preliminary screening ticket card and the second preliminary screening ticket card, it is necessary to perform a union processing on the first preliminary screening ticket card and the second preliminary screening ticket card to obtain the first backup ticket card; that is, the number of the first backup ticket card (denoted as M) is less than or equal to A+B, where A is the number of the first preliminary screening ticket cards and B is the number of the second preliminary screening ticket cards.

[0067] S130: If the number of first ticket cards in the first standby ticket card is not less than the number threshold, determine target ticket cards with the number threshold from the first standby ticket card according to the priority rule, and add the target ticket cards to the hot ticket blacklist.

[0068] In this embodiment of the present application, it is determined whether the first ticket quantity M of the first standby ticket card is less than a quantity threshold N. If M = N, the first standby ticket card is directly determined as the target ticket card and is added to the hot ticket blacklist. If M > N, the first standby ticket cards are sorted in descending order of priority based on the blacklist priority set when sorting the initial tickets using the time attribute. The ticket card with the higher priority and the quantity threshold is selected as the target ticket card and added to the hot ticket blacklist.

[0069] S140: If the number of first backup ballot cards is less than the number threshold, sort the initial ballot cards according to the balance information in each initial ballot card to obtain a second sorting result, and select second backup ballot cards that meet the second preset standard from the second sorting result.

[0070] In this embodiment of the present application, if M < N, then additional tickets need to be selected from the initial ticket list for replenishment. The process for determining the tickets to be replenished can include first determining the balance information of each initial ticket, sorting the initial tickets from highest to lowest based on their balance information to obtain a second sorting result, and then selecting second backup ticket cards that meet a second preset criterion from the second sorting result. The number of second backup ticket cards can be recorded as C.

[0071] Optionally, the tickets whose balances have not been queried are summarized, and then based on the usage records of these tickets, the most recent transaction is determined to obtain the balance of the ticket, and the blacklist priority of the ticket is set to the corresponding priority.

[0072] S150: Filter out target ticket cards from the first and second backup ticket cards, and add the target ticket cards to the hot ticket blacklist.

[0073] Specifically, the step of selecting a target ticket card from the first and second backup ticket cards includes the following steps:

[0074] First, the first alternative ballot card and the second alternative ballot card are combined to obtain a candidate ballot card.

[0075] In the embodiment of the present application, since there may be an intersection between the first backup ballot card and the second backup ballot card, it is necessary to perform a union process on the first backup ballot card and the second backup ballot card to obtain a candidate ballot card; that is, the number of candidate ballot cards (denoted as Q) is less than or equal to M+C, where M is the number of first backup ballot cards and C is the number of second backup ballot cards.

[0076] Second, if the second ticket quantity of the candidate tickets is not less than the quantity threshold, target tickets with the quantity threshold are determined from the candidate tickets according to a priority rule, and the target tickets are added to the hot ticket blacklist.

[0077] In this embodiment of the present application, it is determined whether the second ticket quantity Q of the candidate ticket is less than a quantity threshold N. If Q = N, where N represents the quantity threshold, the candidate ticket is directly determined as the target ticket and is added to the hot ticket blacklist. If Q > N, the candidate tickets are sorted in descending order of priority based on the blacklist priority set when sorting the initial tickets using the time attribute and the balance attribute. The ticket with the higher priority, which is the quantity threshold, is selected as the target ticket and added to the hot ticket blacklist.

[0078] Third, if the number of the second tickets is less than the number threshold, the candidate tickets are determined to be in the hot ticket blacklist.

[0079] In this embodiment, although Q < N, the candidate tickets selected using the time attribute and balance attribute can represent the more active tickets in the initial ticket list, eliminating the need to select additional tickets from the initial ticket list to supplement the list. Therefore, the candidate tickets can be directly identified as target tickets, and the target tickets can be added to the hot ticket blacklist.

[0080] The technical solution provided by this embodiment determines a quantity threshold for the hot ticket blacklist; sorts each initial ticket in the initial ticket list according to its time attribute to obtain a first sorting result, and screens out first reserve ticket cards that meet a first preset standard from the first sorting result; if the quantity of first ticket cards of the first reserve ticket is not less than the quantity threshold, determines a target ticket with the quantity threshold from the first reserve ticket according to a priority rule, and adds the target ticket to the hot ticket blacklist; if the quantity of first ticket cards of the first reserve ticket is less than the quantity threshold, sorts each initial ticket according to the balance information in each initial ticket to obtain a second sorting result, and screens out second reserve ticket cards that meet a second preset standard from the second sorting result; screens out the target ticket from the first reserve ticket and the second reserve ticket, and adds the target ticket to the hot ticket blacklist. The server of this application filters the initial ticket card list according to the time attribute and balance information of the initial ticket card, and can accurately obtain the hot ticket card blacklist with higher activity, and then send the hot ticket card blacklist to the gate machine so that the gate machine stores the hot ticket card blacklist in the memory database. Compared with the initial ticket card list, the data volume of the hot ticket card blacklist is smaller, which can reduce the memory resource demand for the gate machine's memory database, so as to realize the rapid blacklist verification of transaction data.

[0081] Figure 2This is a flow chart of a gate ticket checking method provided in an embodiment of the present application. This embodiment can be applied to blacklist verification of rail transit passengers' tickets to determine the access policy for the passenger. The gate ticket checking method provided in this embodiment can be performed by a gate ticket checking device provided in an embodiment of the present application. The device can be implemented in software and / or hardware and integrated into the electronic device that executes the method. Preferably, the electronic device in the embodiment of the present application can be a gate microcontroller.

[0082] See also Figure 2 The method of this embodiment includes but is not limited to the following steps:

[0083] S210: Receive the hot ticket card blacklist sent by the server.

[0084] In an embodiment of the present application, the hot ticket blacklist is obtained by filtering the server from the initial ticket list. The server divides the initial ticket list into a hot ticket blacklist and a cold ticket blacklist according to the preset screening rules; wherein, the hot ticket blacklist refers to the ticket list with higher activity in the blacklist, in other words, it also means the ticket list with a higher probability of being used to take rail transit in the future; the cold ticket blacklist refers to the ticket list with lower activity in the blacklist, in other words, it also means the ticket list with a lower probability of being used to take rail transit in the future. The server sends the hot ticket blacklist to the gate, and after the gate receives the hot ticket blacklist, it stores it in the memory database, such as the String structure of the Redis database. The advantage of this setting is that the performance of the memory database is extremely high (such as the reading speed of Redis is 110,000 times per second and the writing speed is 81,000 times per second), which can meet the gate's fast response requirements. Optionally, the cold ticket blacklist can be stored in the server's file database, such as a distributed file storage database.

[0085] Since not all blacklists in the initial ticket card list are sent to the gate machine, but only the hot ticket card blacklist is sent to the gate machine, the gate machine's memory database does not need too much memory to meet the daily needs of timely determining whether the current ticket card held by the passenger is illegally used. Moreover, since the hot ticket card blacklist is a ticket card list with higher activity, the calculation efficiency of the gate machine can be improved.

[0086] Optionally, the data volume of the hot ticket blacklist can be customized according to the actual application requirements of rail transit, or can be determined based on the total data volume of the initial ticket list.

[0087] S220: When it is detected that the ticket recognition operation is triggered, obtain the ticket identification of the current ticket.

[0088] In an embodiment of the present application, when a passenger takes a rail transit to enter or exit a station at a gate, the passenger places the ticket at the ticket recognition component of the gate. The ticket recognition component detects the ticket and triggers the ticket recognition operation, and obtains the ticket identification of the ticket currently placed at the ticket recognition component (i.e., the current ticket).

[0089] S230: Determine a clearing decision for transaction data corresponding to the current ticket based on the hot ticket blacklist and the ticket identifier, so that the clearing system performs clearing processing on the transaction data based on the clearing decision.

[0090] In an embodiment of the present application, it is determined based on the ticket identification whether the current ticket can be found from the hot ticket blacklist; if it can be found, it indicates that the current ticket belongs to the blacklist, then the clearing decision is determined to delete the transaction data of the current ticket, and the clearing system does not perform clearing processing on the transaction data; if it cannot be found, it indicates that the current ticket does not belong to the hot ticket blacklist, but may belong to the cold ticket blacklist or does not belong to the blacklist, then the clearing decision is determined to retain the transaction data of the current ticket.

[0091] Furthermore, the access strategy for passengers holding the current ticket is determined based on the hot ticket blacklist and the ticket identification, specifically: based on the ticket identification, it is determined whether the current ticket can be found from the hot ticket blacklist; if it can be found, it indicates that the current ticket is on the blacklist, then the access strategy is determined to prohibit passage, and the gate is controlled not to be opened; if it cannot be found, it indicates that the current ticket is not on the hot ticket blacklist, but may be on the cold ticket blacklist or not on the blacklist, then the access strategy is determined to allow passage.

[0092] Furthermore, after determining that the passage strategy is to allow passage, it also includes: during the idle period of the clearing system (such as the end of rail transit operation period or low-peak operation period), it is determined based on the ticket identification whether the current ticket can be found from the cold ticket blacklist. The cold ticket blacklist is the ticket in the initial ticket list except for the hot ticket blacklist; if it can be found, it indicates that the current ticket belongs to the cold ticket blacklist, and the clearing system is prohibited from clearing the transaction data of the current ticket to avoid differences between the income and the actual situation.

[0093] Furthermore, after the terminal transaction is completed, the terminal must use the Secure Access Module (SAM) installed in the terminal to perform transaction verification calculations on the key data of the terminal transaction, and attach the verification calculation results to the transaction record formed by the transaction for the clearing system to check the legitimacy of the terminal income data. Specifically: Figure 3AThe figure shows a schematic diagram of a terminal generating a TAC code. Reference symbol a in the figure shows the terminal extracting key information (such as key index fields) from the transaction data of the current ticket card; reference symbol b shows the terminal sending the key information to the gate's SAM according to a preset data structure; reference symbol c shows the terminal using the SAM to complete the transaction request corresponding to the current ticket card (such as recharge, consumption, etc.) based on the key information and obtain revenue data. After the transaction is completed, the ticket card generates a transaction authentication code (TAC); reference symbol d shows the ticket card returning the TAC code to the terminal; reference symbol e shows the terminal assembling the revenue data and TAC code into a transaction detail record so that the clearing system can verify the legitimacy of the transaction detail record. In this embodiment, the terminal can be a gate.

[0094] like Figure 3B The figure shows a schematic diagram of the clearing system verifying the TAC code. In the figure, reference numeral a indicates that the clearing system separates the revenue data and TAC code from the received transaction details record; reference numeral b indicates that the key information is extracted from the revenue data; reference numeral c indicates that the TAC code is calculated based on the key information according to the preset data structure; and reference numeral d indicates whether the terminal TAC code is legal, thereby determining whether the terminal revenue data has system legitimacy.

[0095] The technical solution provided by this embodiment is to receive the hot ticket blacklist sent by the server; when it is detected that the ticket identification operation is triggered, obtain the ticket identification of the current ticket; determine the clearing decision for the transaction data corresponding to the current ticket based on the hot ticket blacklist and the ticket identification, so that the clearing system can clear the transaction data based on the clearing decision. The server of this application filters out the hot ticket blacklist from the initial ticket list, and stores the hot ticket blacklist in the memory database of the gate. The gate removes the transaction data corresponding to the tickets in the hot ticket blacklist, which can reduce the amount of data for revenue clearing processing by the clearing system, avoid the real-time clearing and data processing performance problems and physical server resource loss problems in the existing technology, improve the performance efficiency of the clearing system for revenue clearing, and reduce the loss of physical server resources; in addition, this application pre-places the blacklist verification in revenue protection at the gate for real-time processing, which can shorten the time period of revenue protection verification.

[0096] In an optional embodiment, traditional data verification of massive data may cause resource loss and performance problems to physical servers and application systems. Figure 4A The overall structure diagram of the clearing system is as follows: Figure 4B is a schematic diagram of the first-level income protection, such as Figure 4CThis is a schematic diagram of secondary revenue protection. In this embodiment, transaction data can be divided into hot transaction data and cold transaction data according to the transaction time of the transaction data. For example, transaction data 7 days before the current operation day is set as hot transaction data, and transaction data from 8 days to 90 days before the current operation day is set as cold transaction data; hot transaction data of multiple nodes of the clearing system are uniformly and centrally stored in the first-level cache server, and the hot transaction data are verified according to the first-level revenue protection; cold transaction data of multiple nodes of the clearing system are uniformly and centrally stored in the second-level cache server, and the cold transaction data are verified according to the second-level revenue protection. Transactions that fail the verification are saved as erroneous transactions in the erroneous transaction table, and those that pass the verification are legal data and participate in real-time revenue clearing.

[0097] The legitimacy of each transaction data can be determined through certain key fields. The key fields are extracted to form a key string that uniquely identifies the data. The key string of the transaction type is saved in the cache server using an appropriate structure. After the server receives the key string, it uses the cache server to determine whether the transaction data is legal.

[0098] In the first-level profit protection, the key string of the transaction can be saved based on the key-value method. The average time complexity of saving the key string using the redis String structure is O(1). Figure 5 This is a schematic diagram of the Redis key structure design: [key, value]. The key can be named as follows: yyyymmdd: Transaction type: Unique string storage, using: similar to a tree structure with an expiration time, calculated based on the configuration (7 days, configurable). The value stores an empty string by default; if required, you can store related information. Using a string structure, data is distributed across nodes in the cluster, fully utilizing the cluster's capabilities. Capacity estimation is as follows: Average byte usage of key strings: 100 bytes; Estimated daily data volume: 15 million; Cache retention time (configurable): 7 days; Memory requirement = 100 bytes * 15 million * 7 / 1024 / 1024 / 1024 ≈ 10 GB; In a cluster with one backup, 10 GB * 2 = 20 GB is required.

[0099] The reasons for not using a hash structure for storage are as follows: 1. As the amount of data stored in a hash increases, scalability becomes a problem. Incremental expansion not only consumes more memory, but also creates a situation where the previous expansion is completed and the new expansion conditions are met, impacting server performance. 2. In cluster mode, partitions are calculated based on key values. The hash of a single key cannot distribute data across the Redis cluster, resulting in pressure on a single server. 3. Efficiency issues: As the amount of hashed data increases, hash conflicts affect efficiency.

[0100] Secondary revenue protection primarily targets cold data. Verification is often performed within the primary cache. Secondary cache usage is low, but cold data is larger than hot data. To avoid excessive server memory usage, a distributed file storage database is used for data verification, using the same verification rules as primary revenue protection. Capacity estimation is as follows: Average byte usage of key strings: 100 bytes; Estimated daily data volume: 15 million; Cache retention time (configurable): 83 days; Disk capacity required = 100 bytes * 15 million * 83 / 1024 / 1024 / 1024 ≈ 118 GB. In a cluster with one backup, 118 GB * 2 = 236 GB is required.

[0101] Revenue protection rules may include: site identification (ID) verification, used to verify whether the site ID of the revenue data belongs to a site that is legal and has been put into operation on the line network; device ID verification, used to verify whether the device ID of the revenue data belongs to a device that is legal and has been put into operation on the line network; SAM card verification, used to verify whether the SAM card of the revenue data belongs to a SAM card that is legal and has been put into use on the line network; transaction time verification, used to verify whether the transaction time of the revenue data is legal; ticket type verification, used to verify whether the ticket type of the revenue data belongs to a ticket type that is legal on the line network; payment method verification, used to verify whether the payment method of the revenue data belongs to a payment method that is legal on the line network; maximum fare verification, used to verify whether the ticket consumption amount of the revenue data is within the legal maximum fare of the line network; blacklist verification, used to verify whether the ticket of the revenue data belongs to a blacklist ticket; TAC code verification, used to verify whether the TAC code of the revenue data is legal; data duplication verification, used to verify whether the revenue data is duplicate data. Among them, the unique index field reference for data duplication verification is shown in Table 1 below:

[0102] Table 1 Unique index field for data duplication verification

[0103]

[0104]

[0105] This embodiment adopts a low-cost, higher-performance approach to determine the validity of data in massive data, so as to solve the problem of discrepancies in clearing revenue and accounts caused by illegal data in the rail transit field; it implements a method and system for multi-level revenue protection of the rail transit clearing system, and solves the performance problem of discrepancies between subway revenue and actual conditions caused by illegal data in the real-time clearing process under massive data, as well as the problem of physical server resource loss. By analyzing and evaluating hot and cold data, it solves the problem of discrepancies in clearing revenue and accounts caused by duplicate data in the rail transit field in a low-cost, higher-performance manner, further improving the overall operational efficiency of urban rail transit enterprises and reducing operating costs.

[0106] Figure 6 A schematic diagram of a hot ticket blacklist generation device provided in an embodiment of the present application is shown in FIG. Figure 6 As shown, the device 600 is integrated into the server and may include:

[0107] A quantity threshold acquisition module 610 is used to determine the quantity threshold of the hot ticket card blacklist;

[0108] The backup ballot card screening module 620 is configured to sort the initial ballot cards in the initial ballot card list according to their time attributes to obtain a first sorting result, and to screen out first backup ballot cards that meet a first preset criterion from the first sorting result;

[0109] The blacklist determination module 630 is configured to determine target tickets with the threshold number from the first reserve ticket cards according to a priority rule if the number of first tickets in the first reserve ticket cards is not less than the threshold number, and add the target tickets to the hot ticket blacklist;

[0110] The backup ballot card screening module 620 is further configured to, if the number of first ballot cards in the first backup ballot card is less than the number threshold, sort the initial ballot cards according to the balance information of the initial ballot cards to obtain a second sorting result, and screen out second backup ballot cards that meet a second preset standard from the second sorting result;

[0111] The blacklist determination module 630 is further configured to filter out target tickets from the first standby ticket cards and the second standby ticket cards, and set the target tickets as the hot ticket blacklist.

[0112] Optionally, the time attribute includes a first time attribute of the initial storage of the ticket and a second time attribute of the last use of the ticket;

[0113] Furthermore, the above-mentioned spare ticket card screening module 620 can be specifically used to sort the initial ticket cards according to the first time attribute of each initial ticket card to obtain a third sorting result, and screen out a first number of first preliminary screening ticket cards from the third sorting result; sort the initial ticket cards according to the second time attribute of each initial ticket card to obtain a fourth sorting result, and screen out a second number of second preliminary screening ticket cards from the fourth sorting result; and perform union processing on the first preliminary screening ticket card and the second preliminary screening ticket card to obtain a first spare ticket card.

[0114] Furthermore, the blacklist determination module 630 may be specifically configured to perform a union process on the first backup ticket card and the second backup ticket card to obtain a candidate ticket card; if the number of second tickets of the candidate ticket card is not less than the number threshold, determine a target ticket card with the number threshold from the candidate ticket card according to a priority rule, and add the target ticket card to the hot ticket blacklist; if the number of second tickets is less than the number threshold, determine the candidate ticket card to the hot ticket blacklist.

[0115] The hot ticket card blacklist generation device provided in this embodiment can be applied to the hot ticket card blacklist generation method provided in any of the above embodiments, and has corresponding functions and beneficial effects.

[0116] Figure 7 A schematic diagram of the structure of a gate ticket checking device provided in an embodiment of the present application is shown in FIG. Figure 7 As shown, the device 700 is integrated into a gate machine and may include:

[0117] The first data receiving module 710 is used to receive a hot ticket card blacklist sent by the server, wherein the hot ticket card blacklist is obtained by filtering the server from the initial ticket card list;

[0118] The second data acquisition module 720 is used to acquire the ticket identification of the current ticket when it is detected that the ticket recognition operation is triggered;

[0119] The clearing decision determination module 730 is used to determine the clearing decision for the transaction data corresponding to the current ticket based on the hot ticket blacklist and the ticket identifier, so that the clearing system performs clearing processing on the transaction data based on the clearing decision.

[0120] Furthermore, the above-mentioned clearing decision determination module 730 can be specifically used to: determine whether the current ticket card can be found from the hot ticket card blacklist based on the ticket card identification; if it can be found, determine that the clearing decision is to delete the transaction data of the current ticket card, and prohibit the clearing system from clearing the transaction data; if it is not found, determine that the clearing decision is to retain the transaction data of the current ticket card.

[0121] Furthermore, the above-mentioned clearing decision determination module 730 can also be specifically used for: after determining that the clearing decision is to retain the transaction data of the current ticket card, during the idle period of the clearing system, determining whether the current ticket card can be found from the cold ticket card blacklist based on the ticket card identification, the cold ticket card blacklist is the ticket card in the initial ticket card list except the hot ticket card blacklist; if it can be found, the clearing system is prohibited from clearing the transaction data of the current ticket card.

[0122] Furthermore, the gate ticket checking device may further include: a legitimacy verification module;

[0123] The legitimacy verification module is used to extract key information from the transaction data of the current ticket and send the key information to the security access component of the gate; when the security access component completes the transaction request corresponding to the current ticket based on the key information and obtains the revenue data, it generates a transaction verification code; the revenue data and the transaction verification code are assembled into a transaction detail record, so that the clearing system can verify the legitimacy of the transaction detail record.

[0124] The gate ticket checking device provided in this embodiment can be applied to the gate ticket checking method provided in any of the above embodiments, and has corresponding functions and beneficial effects.

[0125] Figure 8 It is a block diagram of an electronic device for implementing a hot ticket blacklist generation method and a gate ticket checking method of an embodiment of the present application. The electronic device 10 is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present application described and / or required herein.

[0126] like Figure 8As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., which is communicatively connected to the at least one processor 11. The memory stores a computer program that can be executed by the at least one processor. The processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 into the random access memory (RAM) 13. Various programs and data required for the operation of the electronic device 10 can also be stored in the RAM 13. The processor 11, ROM 12, and RAM 13 are connected to each other via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0127] Multiple components in the electronic device 10 are connected to the I / O interface 15, including an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a magnetic disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0128] The processor 11 can be any general-purpose and / or specialized processing component with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as the hot ticket blacklist generation method and the gate ticket inspection method.

[0129] In some embodiments, the hot ticket card blacklist generation method and the gate ticket inspection method can be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the hot ticket card blacklist generation method and the gate ticket inspection method described above can be executed. Alternatively, in other embodiments, the processor 11 can be configured to execute the hot ticket card blacklist generation method and the gate ticket inspection method in any other appropriate manner (for example, by means of firmware).

[0130] Various embodiments of the systems and techniques described herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), system-on-chip systems (SOCs), programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system that includes at least one programmable processor, which can be a special-purpose or general-purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0131] Computer programs for implementing the methods of the present application may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when the computer program is executed by the processor, the functions / operations specified in the flowcharts and / or block diagrams are implemented. The computer program may be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0132] In the context of the present application, a computer-readable storage medium can be a tangible medium that can contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared or semiconductor system, device or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium can be a machine-readable signal medium. A more specific example of a machine-readable storage medium can include an electrical connection based on one or more lines, a portable computer disk, 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 disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0133] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device that has: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0134] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, 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: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0135] A computing system may include clients and servers. The clients and servers are typically remote from each other and typically interact via a communication network. This client-server relationship arises through computer programs running on the respective computers, creating a client-server relationship. The server may be a cloud server, also known as a cloud computing server or cloud host. This server is a hosting product within the cloud computing service ecosystem that addresses the management difficulties and limited scalability of traditional physical hosting and VPS services.

[0136] Note that the above are only preferred embodiments of the present application and the technical principles used. Those skilled in the art will understand that the present application is not limited to the specific embodiments described herein, and that various obvious changes, readjustments, and substitutions can be made by those skilled in the art without departing from the scope of protection of the present application. For example, those skilled in the art can use the various forms of processes shown above, reorder, add, or delete steps; and can perform the steps described in the present application in parallel, sequentially, or in a different order, as long as the desired results of the technical solution of the present application can be achieved, and this document does not limit them here.

[0137] The above specific embodiments do not limit the scope of protection of this application. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions may be made based on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this application shall be included within the scope of protection of this application.

Claims

1. A method for generating a hot ticket card blacklist, characterized in that: Applied to the server, the method includes: Determine the quantity threshold of the hot ticket card blacklist; sorting the initial tickets in the initial ticket list according to their time attributes to obtain a first sorting result, and selecting first reserve ticket cards that meet a first preset standard from the first sorting result; If the number of first tickets in the first standby ticket card is not less than the number threshold, determining target tickets with the number threshold from the first standby ticket card according to a priority rule, and adding the target tickets to the hot ticket blacklist; If the number of first tickets in the first backup ticket card is less than the number threshold, sorting the initial tickets according to the balance information in the initial tickets to obtain a second sorting result, and selecting second backup ticket cards that meet a second preset standard from the second sorting result; Filtering target tickets from the first and second reserve ticket cards, and adding the target tickets to the hot ticket blacklist; The time attributes include a first time attribute of the initial entry of the ticket into the storage and a second time attribute of the most recent use of the ticket; sorting the initial tickets in the initial ticket list according to their time attributes to obtain a first sorting result, and screening out first backup ticket cards that meet a first preset standard from the first sorting result, including: sorting the initial tickets according to the first time attribute of the initial tickets to obtain a third sorting result, and screening a first number of first preliminary screening tickets from the third sorting result; sorting the initial tickets according to the second time attribute of the initial tickets to obtain a fourth sorting result, and screening a second number of second pre-screened tickets from the fourth sorting result; The first preliminary screening ticket card and the second preliminary screening ticket card are combined to obtain a first reserve ticket card.

2. The method for generating a hot ticket blacklist according to claim 1, characterized in that: The step of selecting a target ticket card from the first and second reserve ticket cards includes: performing a union process on the first alternative ballot card and the second alternative ballot card to obtain a candidate ballot card; If the second ticket quantity of the candidate tickets is not less than the quantity threshold, determining target tickets with the quantity threshold from the candidate tickets according to a priority rule, and adding the target tickets to the hot ticket blacklist; If the number of the second tickets is less than the number threshold, the candidate tickets are determined to be in the hot ticket blacklist.

3. A hot ticket card blacklist generation device, characterized in that: Integrated in the server, the device includes: A quantity threshold acquisition module is used to determine the quantity threshold of the hot ticket card blacklist; a reserve ballot card screening module, configured to sort the initial ballot cards in the initial ballot card list according to their time attributes to obtain a first sorting result, and to screen out first reserve ballot cards that meet a first preset standard from the first sorting result; a blacklist determination module configured to, if the number of first tickets in the first reserve ticket card is not less than the number threshold, determine target tickets with the number threshold from the first reserve ticket card according to a priority rule, and add the target tickets to the hot ticket blacklist; The backup ballot card screening module is further configured to, if the number of first ballot cards in the first backup ballot card is less than the number threshold, sort the initial ballot cards according to the balance information of the initial ballot cards to obtain a second sorting result, and screen out second backup ballot cards that meet a second preset standard from the second sorting result; The blacklist determination module is further configured to select a target ticket card from the first standby ticket card and the second standby ticket card, and set the target ticket card as the hot ticket blacklist; The time attributes include a first time attribute of the initial storage of the ticket and a second time attribute of the most recent use of the ticket; The backup ballot card screening module is specifically configured to sort the initial tickets according to the first time attributes of the initial tickets to obtain a third sorting result, and screen out a first number of first preliminary screening tickets from the third sorting result; sort the initial tickets according to the second time attributes of the initial tickets to obtain a fourth sorting result, and screen out a second number of second preliminary screening tickets from the fourth sorting result; and perform a union process on the first preliminary screening tickets and the second preliminary screening tickets to obtain a first backup ballot card.

4. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the hot ticket card blacklist generation method described in any one of claims 1 to 2 when executed.

Images