Site conflict detection method and system based on dynamic time slice and hash association

Abstract

The invention discloses a site conflict detection method and system based on dynamic time slice and hash association, and the method comprises the steps: obtaining a predetermined request, and determining a target site and a target time slice based on the predetermined request; obtaining all associated sites associated with the target site, and determining a predeterminable time block of each associated site; and carrying out overlapping detection on the target time slice and all the predeterminable time blocks, and triggering a conflict alarm based on an overlapping detection result. Through the dynamic time slice analysis and Hash association technology, efficient and accurate association site conflict detection is realized, and the resource utilization rate and the user experience are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of site resource analysis, and particularly to a site conflict detection method and system based on dynamic time slices and hash association. Background Art

[0002] Currently, the detection of the occupancy status of a site only supports a single site, and cannot handle the collaborative occupancy problems of associated sites (such as adjacent basketball courts and combined meeting rooms), and cannot well detect whether there are conflicts between associated sites. Moreover, the existing site status analysis cannot adapt to the business hour configurations of different sites, and the detection results are also inaccurate.

[0003] Therefore, there are still defects in the prior art. Summary of the Invention

[0004] The technical problem to be solved by the present invention is to provide a site conflict detection method and system based on dynamic time slices and hash association for the above-mentioned defects of the prior art. The technical solutions adopted by the present invention are as follows:

[0005] In a first aspect, the present invention provides a site conflict detection method based on dynamic time slices and hash association, wherein the method includes:

[0006] Obtain a predetermined request, and determine a target site and a target time slice based on the predetermined request;

[0007] Obtain all associated sites associated with the target site, and determine the bookable time blocks of each associated site;

[0008] Perform an overlap detection on the target time slice and all bookable time blocks, and trigger a conflict alarm based on the overlap detection result.

[0009] In one implementation, the obtaining all associated sites associated with the target site includes:

[0010] Obtain a preset site association table, wherein the site association table is used to reflect sites with an association relationship;

[0011] Obtain the first ID information of the target site, and match the first ID information with the site association table to obtain all second ID information corresponding to the first ID information. The second ID information is the ID information of the associated sites having an association relationship with the target site.

[0012] In one implementation, the creation method of the site association table includes:

[0013] Obtain all sites with an association relationship and their corresponding ID information;

[0014] Map the ID information of all related venues to a fixed-length two-way hash value, and use the two-way hash value as the key for data storage or query to obtain the venue association table, where the two-way hash value reflects the hash values obtained based on the ID information in the forward order and the ID information in the reverse order respectively.

[0015] In one implementation, determining the bookable time blocks for each associated venue includes:

[0016] Based on a preset venue area configuration table, obtain the business hours and duration unit of the venue area configuration, divide the business hours into equal-length initial time slices, and form a time slice list;

[0017] Traverse the time slice list to obtain a time block list, and determine the bookable time blocks for each associated venue based on the time block list.

[0018] In one implementation, the traversing the time slice list to obtain a time block list includes:

[0019] Traverse the time slice list, check whether the initial time slices are continuous, and obtain the current time block based on the continuous initial time slices;

[0020] If the initial time slices are not continuous, generate new time blocks;

[0021] Output the time block list based on the current time block and the new time blocks.

[0022] In one implementation, the overlapping detection of the target time slice with all the bookable time blocks includes:

[0023] Match the target time slice with the bookable time blocks corresponding to each associated venue;

[0024] If the start time of the target time slice is less than the end time of the bookable time block of a certain associated venue, and the end time of the target time slice is greater than the start time of the bookable time block of that associated venue, it is determined that there is an overlap between the target time slice and the bookable time block of that associated venue.

[0025] In one implementation, the triggering of a conflict alarm based on the overlapping detection result includes:

[0026] Based on the venue lock status table, obtain the time slices that have been locked for each associated venue;

[0027] If the target time slice overlaps with the bookable time block of a certain associated venue, and the bookable time block belongs to the time slices that have been locked, trigger a conflict alarm.

[0028] Second aspect, an embodiment of the present invention further provides a venue conflict detection system based on dynamic time slice and hash association. The system is used to implement the steps of the venue conflict detection method based on dynamic time slice and hash association described in the above solution. The system includes:

[0029] A predetermined request analysis module, configured to obtain a predetermined request, and determine a target venue and an associated target time slice based on the predetermined request;

[0030] A schedulable time block determination module, configured to obtain all associated venues associated with the target venue, and determine the schedulable time blocks of each associated venue;

[0031] A conflict warning detection module, configured to perform an overlap detection on the target time slice and all schedulable time blocks, and trigger a conflict warning based on the overlap detection result.

[0032] Third aspect, an embodiment of the present invention further provides a terminal. The terminal includes a memory, a processor, and a venue conflict detection program based on dynamic time slice and hash association stored in the memory and executable on the processor. When the processor executes the venue conflict detection program based on dynamic time slice and hash association, the steps of the venue conflict detection method based on dynamic time slice and hash association in any one of the above solutions are implemented.

[0033] Fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium. A venue conflict detection program based on dynamic time slice and hash association is stored on the computer-readable storage medium. The venue conflict detection program based on dynamic time slice and hash association implements the steps of the venue conflict detection method described in any one of the above solutions on the computer-readable storage medium.

[0034] Beneficial effects: Compared with the prior art, the present invention provides a venue conflict detection method based on dynamic time slice and hash association. The present invention first obtains a predetermined request, and determines a target venue and an associated target time slice based on the predetermined request. Then, all associated venues associated with the target venue are obtained, and the schedulable time blocks of each associated venue are determined. Finally, an overlap detection is performed on the target time slice and all schedulable time blocks, and a conflict warning is triggered based on the overlap detection result. The present invention realizes efficient and accurate associated venue conflict detection through dynamic time slice analysis and hash association technology, improving resource utilization rate and user experience. Description of the Drawings

[0035] Figure 1 It is a flowchart of a preferred embodiment of the venue conflict detection method based on dynamic time slice and hash association provided by an embodiment of the present invention.

[0036] Figure 2 This is the actual application flowchart of the site conflict detection method based on dynamic time slice and hash association provided by the embodiments of the present invention.

[0037] Figure 3 This is the time slice merging flowchart in the site conflict detection method based on dynamic time slice and hash association provided by the embodiments of the present invention.

[0038] Figure 4 This is the schematic diagram of the site conflict detection method based on dynamic time slice and hash association provided by the embodiments of the present invention.

[0039] Figure 5 This is the functional principle block diagram of the site conflict detection system based on dynamic time slice and hash association provided by the embodiments of the present invention.

[0040] Figure 6 This is the principle block diagram of the terminal provided by the embodiments of the present invention. Detailed implementation manners

[0041] To make the objectives, technical solutions and effects of the present invention clearer and more definite, the following further describes the present invention in detail with reference to the accompanying drawings and by way of examples. It should be understood that the specific examples described herein are only used to explain the present invention and are not used to limit the present invention.

[0042] The flowcharts shown in the accompanying drawings are only illustrative examples, and do not necessarily include all the contents, operations or steps, nor do they necessarily need to be executed in the described order. For example, some operations or steps can be decomposed, combined or partially merged, so the actual execution order may be changed according to the actual situation.

[0043] It should be understood that the terms used in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the specification of the present invention and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include the plural forms.

[0044] It should be understood that, in order to clearly describe the technical solutions of the embodiments of the present invention, in the embodiments of the present invention, terms such as "first" and "second" are used to distinguish the same items or similar items with basically the same functions and effects. For example, the first control information and the second control information are only used to distinguish different control information, and do not limit their sequence.

[0045] Those skilled in the art can understand that the terms such as "first" and "second" do not limit the quantity and execution order, and the terms such as "first" and "second" do not necessarily mean different.

[0046] It should also be understood that the term "and / or" used in the specification and appended claims of the present invention refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0047] To solve the problems of the prior art, this embodiment provides a venue conflict detection method based on dynamic time slices and hash association. Specifically in application, this embodiment first obtains a predetermined request, and determines a target venue and an associated target time slice based on the predetermined request. Then, all associated venues associated with the target venue are obtained, and the available reservation time blocks for each associated venue are determined. Finally, the target time slice is subjected to an overlap detection with all the available reservation time blocks, and a conflict alarm is triggered based on the overlap detection result. This embodiment realizes efficient and accurate associated venue conflict detection through dynamic time slice analysis and hash association technology, improving resource utilization and user experience.

[0048] The venue conflict detection method based on dynamic time slices and hash association of this embodiment can be applied to terminals, and the terminals include intelligent product terminals such as computers, mobile phones, and smart TVs. As Figure 1 shown, the venue conflict detection method based on dynamic time slices and hash association of this embodiment includes the following steps:

[0049] Step S100: Obtain a predetermined request, and determine a target venue and an associated target time slice based on the predetermined request.

[0050] Combined with Figure 2 and Figure 4 shown, this embodiment can output a predetermined request, which can be generated based on a venue reservation platform. For example, a user can select a target venue to be reserved and a target time slice to be reserved on the venue reservation platform, and the venue reservation platform can automatically generate a predetermined request based on the options selected by the user. The predetermined request at least includes the above-mentioned target venue and target time slice. In actual application, the target time slice of this embodiment can be multiple. For example, the target time slices of venue A that the user wants to reserve are the two time periods from 9:30 to 10:30 and from 10:30 to 11:30. This embodiment does not limit this. After receiving the predetermined request, the terminal can parse out the target venue and target time slice based on the predetermined request.

[0051] Step S200: Obtain all associated venues associated with the target venue, and determine the available reservation time blocks for each associated venue.

[0052] After determining the target venue, this embodiment obtains associated venues that have an association with the target venue, such as adjacent basketball courts, combined meeting rooms, etc. By analyzing the associated venues, the bookable time blocks for each associated venue are determined. The bookable time blocks in this embodiment reflect the initial bookable time slices configured based on the business hours in the associated venues. Compared with the single-venue conflict detection in the prior art, this embodiment can jointly analyze the target venue and the associated venues that have an association, so as to more accurately implement the conflict detection of venue resources and improve resource utilization and user experience.

[0053] In one implementation, when determining the associated venues in this embodiment, the following steps are included:

[0054] Step S201: Obtain a preset venue association table, where the venue association table is used to reflect venues that have an association.

[0055] Step S202: Obtain the first ID information of the target venue, and match the first ID information with the venue association table to obtain all the second ID information corresponding to the first ID information. The second ID information is the ID information of the associated venues that have an association with the target venue.

[0056] In this embodiment, the method for determining the associated venues with the target venue is realized by matching the venue association table. As Figure 4 shown, this embodiment analyzes the associated venues based on the association management module. Specifically, a database is set up in this embodiment, and the database includes a venue association table, which is used to reflect venues that have an association. Therefore, when the first ID information of the target venue is matched with the venue association table, the second ID information corresponding to the first ID information can be obtained. In this embodiment, the second ID information is the ID information of the associated venues that have an association with the target venue. Thus, all the associated venues that have an association with the target venue are determined. For example, if there are 3 venues adjacent to the target venue A, then all the associated venues can be matched based on this venue association table, which is convenient for analyzing these associated venues in the subsequent steps.

[0057] In one implementation, when constructing the venue association table, this embodiment first obtains all venues with an association relationship and their corresponding ID information. Then, it maps the ID information of all venues with an association relationship to a two-way hash value of a fixed length, and uses the two-way hash value as the key for data storage or query, thereby obtaining the venue association table. The two-way hash value in this embodiment reflects the hash values obtained respectively based on the ID information in the forward order and the reverse order. Specifically, for example, if the ID information of two venues with an association relationship is field_a and field_b, this embodiment can map the ID information in the two direction orders (field_a, field_b) and (field_b, field_a) to a two-way hash value of a fixed length (such as an MD5 value), and then use it as the key for data storage or query (Key). By storing the hash values in both directions (field_a, field_b) and (field_b, field_a), this embodiment establishes a two-way mapping relationship to obtain the venue association table. Based on this associated venue table, it can be ensured that the associated venue can be quickly queried from either direction. Moreover, the venue association table established based on the two-way mapping relationship in this embodiment can ensure that (field_a, field_b) and (field_b, field_a) are the same association and can be mapped to the same record through the two-way hash value. Of course, the above is an example of two venues with an association relationship. In actual applications, a target venue can have multiple associated venues, and this embodiment does not limit this.

[0058] Further, after determining all the associated venues of the target venue, this embodiment can further analyze the bookable time blocks of each associated venue, as follows:

[0059] Step S203: Based on a preset venue area configuration table, obtain the business hours and time duration unit of the venue area configuration, divide the business hours into equal-length initial time slices, and form a time slice list;

[0060] Step S204: Traverse the time slice list to obtain a time block list, and determine the bookable time blocks of each associated venue based on the time block list.

[0061] Specifically, this embodiment analyzes the bookable time blocks of each associated venue based on a dynamic time analysis module, such as Figure 4As shown in the figure, a site configuration table can also be set in the database of this embodiment. The site configuration table configures business hours (start_time, end_time) and a time unit (time_span). Therefore, in this embodiment, the business hours can be divided into equal-length initial time slices, and a time slice list is formed. For example, if start_time is 09:00, end_time is 11:00, and time_span is 1 hour, it is split into two initial time slices: 09:00-10:00 and 10:00-11:00. In this embodiment, regardless of the length of the business hours or how the time unit time_span is adjusted, the corresponding initial time slices can be generated according to the rules, so as to realize the characteristic of dynamic time slices. This embodiment can traverse all the time slices in the time slice list, then check whether the initial time slices are continuous, and merge them based on the continuous initial time slices to obtain the current time block. For example, the two initial time slices 09:00-10:00 and 10:00-11:00 are continuous, so they can be merged into 09:00-11:00, that is, the reservable time block is obtained. If the initial time slices are discontinuous, new time blocks can be created, and then the created new time blocks and the current time blocks are output together as a time block list, which reflects the reservable time slices of all the sites in the site area. Therefore, when the associated sites are determined, the reservable time blocks of each associated site can be determined based on this time block list. Through the generation and merging of dynamic time slices, this embodiment can not only flexibly adapt to different business hour configurations, but also reduce fragmentation by merging continuous time slices, optimizing the display and utilization efficiency of time resources.

[0062] Step S300: Perform an overlap detection on the target time slice and all the reservable time blocks, and trigger a conflict alarm based on the overlap detection result.

[0063] After determining the reservable time blocks of all the associated sites, this embodiment can perform an overlap detection on the target time slice and the reservable time block of each associated site. The overlap detection is to detect whether there is an overlap between the target time slice and the reservable time block. If there is an overlap, this embodiment will trigger a conflict alarm based on the overlap detection result to prompt the user that there are some time periods in the target time slice where there are conflicts in the associated sites, which can facilitate the manager to more flexibly configure the use of the sites and facilitate the user to more efficiently reserve the sites.

[0064] In one implementation, when performing the overlap detection, this embodiment includes the following steps:

[0065] Step S301: Match the target time slice with the reservable time block corresponding to each associated site;

[0066] Step S302: If the start time of the target time slice is less than the end time of a bookable time block of a certain associated venue, and the end time of the target time slice is greater than the start time of the bookable time block of this associated venue, it is determined that there is an overlap between the target time slice and the bookable time block of this associated venue.

[0067] Specifically, in this embodiment, the target time slice can be sequentially matched with the bookable time blocks corresponding to each associated venue to compare whether there is an overlap between the two time periods. If the start time of the target time slice is less than the end time of a bookable time block of a certain associated venue, and the end time of the target time slice is greater than the start time of the bookable time block of this associated venue, it is determined that there is an overlap between the target time slice and the bookable time block of this associated venue. For example, the target time slice of the target venue A is 10:00 - 11:00), and the bookable time block of the associated venue B is 10:30 - 11:30. There is an overlap in time between the two, and an overlap detection result is obtained. Therefore, a conflict alarm can be triggered based on the overlap detection result.

[0068] In specific applications, a venue lock status table is also set in the database of this embodiment. As shown in Figure 2 It can be used to check the lock status of the associated venue. This embodiment can also determine whether the lock status of the bookable time block of the associated venue is occupied based on the venue lock status table. Specifically, this embodiment can obtain the time slices that have been locked for each associated venue. The time slices that have been locked are in the occupied state. If the target time slice overlaps with the bookable time block of a certain associated venue, and the bookable time block belongs to the time slices that have been locked, it means that during this target time slice, there will be some time periods occupied in the associated venue. Therefore, there is a conflict, and these time periods cannot be booked. At this time, a conflict alarm will be immediately triggered, and the process will be terminated and the conflict result will be returned. This can prevent unreasonable time allocation, such as prohibiting the simultaneous booking of conflicting venue times. If the target time slice does not overlap with the bookable time block of a certain associated venue, then this bookable time block under this associated venue can be marked as conflict-free, and the matching analysis of the next associated venue can be continued. In another implementation manner, as shown in Figure 2As shown, if the target time slice overlaps with the bookable time blocks of a certain associated venue, but the bookable time blocks do not belong to the locked time slices, that is, these bookable time blocks are not occupied. At this time, this bookable time block under the associated venue can also be marked as conflict-free and continue the matching analysis of the next associated venue. In another implementation, when an associated venue time slice is locked (such as user reservation, system allocation), the engine immediately starts the detection process to ensure that conflicts are discovered in the first time and avoid the inefficiency and resource waste of post-processing. In addition, in this embodiment, if the bookable time blocks of the associated venue cannot be queried, it can be directly marked as conflict-free with the associated venue.

[0069] In summary, this embodiment can first obtain a reservation request, determine the target venue and the target time slice based on the reservation request. Then, obtain all associated venues associated with the target venue and determine the bookable time blocks of each associated venue. Finally, perform an overlap detection between the target time slice and all the bookable time blocks, and trigger a conflict alarm based on the overlap detection result. The present invention realizes efficient and accurate conflict detection of associated venues through dynamic time slice analysis and hash association technology, improving resource utilization and user experience.

[0070] Based on the above embodiment, the present invention also provides a venue conflict detection system based on dynamic time slice and hash association. The system of this embodiment can be used to implement the steps in the above method embodiment. Specifically as Figure 5 shown, the system of this embodiment at least includes: a reservation request analysis module 10, a bookable time block determination module 20, and a conflict alarm detection module 30. Specifically, the reservation request analysis module 10 is used to obtain a reservation request and determine the target venue and the target time slice based on the reservation request. The bookable time block determination module 20 is used to obtain all associated venues associated with the target venue and determine the bookable time blocks of each associated venue. The conflict alarm detection module 30 is used to perform an overlap detection between the target time slice and all the bookable time blocks and trigger a conflict alarm based on the overlap detection result.

[0071] In one implementation, the bookable time block determination module 20 includes:

[0072] a venue association table acquisition unit, configured to acquire a preset venue association table, where the venue association table is used to reflect the venues with an association relationship;

[0073] An associated venue determination unit is configured to obtain the first ID information of the target venue, match the first ID information with the venue association table, and obtain all the second ID information corresponding to the first ID information, where the second ID information is the ID information of the associated venues that have an association relationship with the target venue.

[0074] In one implementation, the system further includes a venue association table creation module, including:

[0075] An ID information acquisition unit is configured to acquire all venues having an association relationship and their corresponding ID information;

[0076] A two-way hash storage unit is configured to map the ID information of all venues having an association relationship into two-way hash values of a fixed length, and use the two-way hash values as keys for data storage or query to obtain the venue association table, where the two-way hash values reflect the hash values obtained based on the ID information in the forward order and the ID information in the reverse order respectively.

[0077] In one implementation, the schedulable time block determination module 20 further includes:

[0078] A time slice list determination unit is configured to, based on a preset site configuration table, obtain the business hours and duration units of the site configuration, divide the business hours into equal-length initial time slices, and form a time slice list;

[0079] A schedulable time block analysis unit is configured to traverse the time slice list to obtain a time block list, and determine the schedulable time blocks of each associated venue based on the time block list.

[0080] In one implementation, the schedulable time block analysis unit includes:

[0081] A current time block determination subunit is configured to traverse the time slice list, check whether the initial time slices are continuous, and obtain the current time block based on the continuous initial time slices;

[0082] A new time block determination subunit is configured to generate a new time block if the initial time slices are not continuous;

[0083] A time block list output subunit is configured to output the time block list based on the current time block and the new time block.

[0084] In one implementation, the conflict warning detection module 30 includes:

[0085] A time slice matching unit is configured to match the target time slice with the schedulable time blocks corresponding to each associated venue;

[0086] An overlap detection and analysis unit, which is configured to determine that there is an overlap between the target time slice and the schedulable time block of a related site if the start time of the target time slice is less than the end time of the schedulable time block of a related site and the end time of the target time slice is greater than the start time of the schedulable time block of the related site.

[0087] In one implementation, the conflict warning detection module further includes:

[0088] A locked time slice determination unit, which is configured to obtain the locked time slices of each related site based on the site lock status table;

[0089] A conflict warning trigger unit, which is configured to trigger a conflict warning if the target time slice overlaps with the schedulable time block of a related site and the schedulable time block belongs to the locked time slices.

[0090] The working principles of the modules in the site conflict detection system based on dynamic time slices and hash association in this embodiment are the same as those of the steps in the above method embodiment, and will not be elaborated here.

[0091] Each module in the above site conflict detection system based on dynamic time slices and hash association can be implemented in whole or in part by software, hardware, and their combination. The above modules can be embedded in the processor in the terminal in hardware form or be independent of the processor, or can be stored in the memory in the terminal in software form, so that the processor can call and execute the operations corresponding to the above modules.

[0092] Based on the above embodiments, the present invention further provides a terminal, and the principle block diagram of the terminal can be as Figure 6 shown. The terminal may include one or more processors 100 ( Figure 6 only one is shown in the figure), a memory 101, and a computer program 102 stored in the memory 101 and executable on one or more processors 100. For example, a site conflict detection program based on dynamic time slices and hash association. When one or more processors 100 execute the computer program 102, each step in the method embodiment of the site conflict detection method based on dynamic time slices and hash association can be implemented. Or, when one or more processors 100 execute the computer program 102, the functions of the modules / units in the system embodiment of the site conflict detection system based on dynamic time slices and hash association can be implemented, which is not limited here.

[0093] In one embodiment, the so-called processor 100 may be a central processing unit (CPU), or may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0094] In one embodiment, the memory 101 may be an internal storage unit of the electronic device, such as the hard disk or memory of the electronic device. The memory 101 may also be an external storage device of the electronic device, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the electronic device. Further, the memory 101 may also include both the internal storage unit and the external storage device of the electronic device. The memory 101 is used to store computer programs and other programs and data required by the terminal. The memory 101 may also be used to temporarily store data that has been output or is to be output.

[0095] Those skilled in the art can understand that Figure 6 the principle block diagram shown in

[0096] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above methods. Among them, any reference to a memory, storage, operational database, or other medium used in the embodiments provided by the present invention can include non-volatile and / or volatile memories. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and Rambus dynamic RAM (RDRAM), etc.

[0097] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them. Although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments or equivalently replace some of the technical features. These modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for detecting site conflicts based on dynamic time slices and hash association, characterized in that The method includes: Obtaining a predetermined request, and determining a target venue and a target time slice based on the predetermined request; Obtaining all associated venues associated with the target venue, and determining the bookable time blocks of each associated venue; Performing an overlap detection between the target time slice and all the bookable time blocks, and triggering a conflict warning based on the overlap detection result.

2. The method for detecting site conflicts based on dynamic time slices and hash association according to claim 1, wherein The obtaining all the associated venues associated with the target venue includes: Obtaining a preset venue association table, where the venue association table is used to reflect the venues with an association relationship; Obtaining the first ID information of the target venue, matching the first ID information with the venue association table to obtain all the second ID information corresponding to the first ID information, where the second ID information is the ID information of the associated venues having an association relationship with the target venue.

3. The method for detecting venue conflicts based on dynamic time slices and hash associations according to claim 2, wherein The creation method of the venue association table includes: Obtaining all the venues with an association relationship and their corresponding ID information; Mapping the ID information of all the venues with an association relationship into a two-way hash value of a fixed length, and using the two-way hash value as a key for data storage or query to obtain the venue association table, where the two-way hash value reflects the hash values obtained based on the ID information in the forward order and the ID information in the reverse order respectively.

4. The method for detecting site conflicts based on dynamic time slices and hash association according to claim 1, wherein Determining the bookable time blocks of each associated venue includes: Based on a preset venue area configuration table, obtaining the business hours and duration units of the venue area configuration, dividing the business hours into equal-length initial time slices, and forming a time slice list; Traversing the time slice list to obtain a time block list, and determining the bookable time blocks of each associated venue based on the time block list.

5. The method for detecting site conflicts based on dynamic time slices and hash association according to claim 4, characterized in that, The traversing the time slice list to obtain a time block list includes: Traversing the time slice list, checking whether the initial time slices are continuous, and obtaining the current time block based on the continuous initial time slices; If the initial time slices are not continuous, generating new time blocks; Outputting the time block list based on the current time block and the new time blocks.

6. The method for detecting site conflicts based on dynamic time slices and hash associations according to claim 1, wherein The performing an overlap detection between the target time slice and all the bookable time blocks includes: Matching the target time slice with the bookable time blocks corresponding to each associated venue; If the start time of the target time slice is less than the end time of the bookable time block of a certain associated venue, and the end time of the target time slice is greater than the start time of the bookable time block of the associated venue, it is determined that there is an overlap between the target time slice and the bookable time block of the associated venue.

7. The method for detecting site conflicts based on dynamic time slices and hash associations according to claim 1, characterized in that The triggering a conflict warning based on the overlap detection result includes: Based on a venue lock status table, obtaining the time slices that have been locked for each associated venue; If the target time slice overlaps with the bookable time block of a certain associated venue, and the bookable time block belongs to the time slices that have been locked, a conflict warning is triggered.

8. A site conflict detection system based on dynamic time slice and hash association, characterized in that, The system is used to implement the steps of the venue conflict detection method based on dynamic time slice and hash association according to any one of claims 1-7. The system includes: A predetermined request analysis module, configured to obtain a predetermined request, and determine a target venue and a target time slice based on the predetermined request; A reservable time block determination module, configured to obtain all associated sites associated with the target site, and determine the reservable time blocks of each associated site; A conflict warning detection module, configured to perform an overlap detection on the target time slice and all the reservable time blocks, and trigger a conflict warning based on the overlap detection result.

9. A terminal, characterized in that, The terminal includes a memory, a processor, and a site conflict detection program based on the association of dynamic time slices and hashes stored in the memory and executable on the processor. When the processor executes the site conflict detection program based on the association of dynamic time slices and hashes, the steps of the site conflict detection method based on the association of dynamic time slices and hashes according to any one of claims 1-7 are implemented.

10. A computer-readable storage medium, characterized in that, A site conflict detection program based on the association of dynamic time slices and hashes is stored on the computer-readable storage medium. The site conflict detection program based on the association of dynamic time slices and hashes implements the steps of the site conflict detection method based on the association of dynamic time slices and hashes according to any one of claims 1-7 on the computer-readable storage medium.

Images