Method and system for managing time data for search associated with time

Abstract

The present disclosure relates to a method for managing time data for search associated with time, the method being performed by at least one processor. The method for managing time data comprises the steps of: receiving time data associated with a specific search item; dividing the time data by a first time unit to generate a first section data set; generating a first hash key set on the basis of the first section data set; and generating an index associated with the specific search item including at least a part of the first hash key set.

Description

Method and system for managing time data for time-related searches

[0001] The present disclosure relates to a method and system for managing time data for time-related searches, and more particularly, to a method and system for generating an interval data set by dividing time data into specific time units, and generating a hash key set based on the generated interval data set.

[0002] In today's digitalized world, businesses and consumers increasingly rely on reliable, real-time information. In particular, time data serves as a crucial link between consumers and businesses. For example, business hours data is fundamental information for consumers to plan their store visits, while for businesses, it's a crucial element for increasing consumer accessibility and building trust.

[0003] In this context, accessibility to time data impacts both consumers and businesses, and poor accessibility can negatively impact both. However, existing time data is managed in interval units, which limits accessibility. Therefore, new management methods are needed to improve accessibility to time data.

[0004] The present disclosure provides a time data management method, a computer program stored in a recording medium, and a system (device) to solve the above problems.

[0005] The present disclosure may be implemented in various ways, including as a method, a device (system), or a computer program stored on a readable storage medium.

[0006] According to one embodiment of the present disclosure, a method for managing time data for time-related search, performed by at least one processor, includes the steps of receiving time data associated with a specific search item, dividing the time data into first time units to generate a first interval data set, generating a first hash key set based on the first interval data set, and generating an index associated with the specific search item that includes at least a portion of the first hash key set.

[0007] According to one embodiment of the present disclosure, a method for providing time-related search results, performed by at least one processor, includes the steps of receiving a time-related search query, obtaining a time-related index, and providing time-related search results based on the search query and the index, wherein the index includes a first hash key set generated based on a first interval data set generated by dividing time data associated with a specific search item into first time units.

[0008] A computer program stored in a computer-readable recording medium is provided for executing a method according to one embodiment of the present disclosure on a computer.

[0009] An information processing system according to one embodiment of the present disclosure includes a memory and at least one processor connected to the memory and configured to execute at least one computer-readable program included in the memory, wherein the at least one program includes instructions for receiving time data associated with a specific search item, dividing the time data into first time units to generate a first interval data set, generating a first hash key set based on the first interval data set, and generating an index associated with the specific search item that includes at least a portion of the first hash key set.

[0010] An information processing system according to one embodiment of the present disclosure includes a memory and at least one processor connected to the memory and configured to execute at least one computer-readable program included in the memory, wherein the at least one program includes instructions for receiving a search query associated with time, obtaining an index associated with time, and providing a search result associated with time based on the search query and the index, wherein the index includes a first hash key set generated based on a first interval data set generated by dividing time data associated with a specific search item into first time units.

[0011] According to various embodiments of the present disclosure, time data can be divided into specific time units to create an interval data set, and a hash key set can be generated based on the created interval data set. This can enhance the usability of time data, such as facilitating the generation of time-related search results by search engines.

[0012] According to various embodiments of the present disclosure, time-related search results can be provided based on an index that includes at least a portion of a set of hash keys associated with a search query and time. This can improve accessibility to time data and search speed using such data.

[0013] The effects of the present disclosure are not limited to the effects mentioned above, and other effects not mentioned can be clearly understood by a person having ordinary skill in the art to which the present disclosure belongs (referred to as “one skilled in the art”) from the description of the claims.

[0014] Embodiments of the present disclosure will be described below with reference to the accompanying drawings, wherein like reference numerals represent similar elements, but are not limited thereto.

[0015] FIG. 1 is a diagram illustrating an example of a time data management system managing time data according to one embodiment of the present disclosure.

[0016] FIG. 2 is a schematic diagram showing a configuration in which an information processing system is connected to communicate with a plurality of user terminals to manage time data or provide search results related to time according to one embodiment of the present disclosure.

[0017] FIG. 3 is a block diagram showing the internal configuration of a user terminal and an information processing system according to one embodiment of the present disclosure.

[0018] FIG. 4 is a diagram showing the internal configuration of a processor of an information processing system according to one embodiment of the present disclosure.

[0019] FIG. 5 is a diagram illustrating an example of multiple time units for dividing time data according to one embodiment of the present disclosure.

[0020] FIG. 6 is a diagram illustrating an example of generating a hash key set from time data according to one embodiment of the present disclosure.

[0021] FIG. 7 is a diagram illustrating an example of generating a hash key set from time data according to another embodiment of the present disclosure.

[0022] FIG. 8 is a diagram illustrating an example of generating a hash key set from time data according to another embodiment of the present disclosure.

[0023] FIG. 9 is a diagram illustrating an example of generating a hash key set from time data according to another embodiment of the present disclosure.

[0024] FIG. 10 is a diagram illustrating an example of generating a hash key set from time data according to another embodiment of the present disclosure.

[0025] FIG. 11 is a diagram illustrating an example of receiving a time-related search query and providing a time-related search result according to one embodiment of the present disclosure.

[0026] FIG. 12 is a diagram illustrating an example of receiving a time-related search query and providing a time-related search result according to another embodiment of the present disclosure.

[0027] FIG. 13 is a diagram illustrating an example of receiving a time-related search query and providing a time-related search result according to another embodiment of the present disclosure.

[0028] FIG. 14 is a flowchart illustrating an example of a time data management method for time-related search according to one embodiment of the present disclosure.

[0029] FIG. 15 is a flowchart illustrating an example of a method for providing time-related search results according to one embodiment of the present disclosure.

[0030] Hereinafter, specific details for implementing the present disclosure will be described in detail with reference to the attached drawings. However, in the following description, specific descriptions of widely known functions or configurations will be omitted if they may unnecessarily obscure the gist of the present disclosure.

[0031] In the attached drawings, identical or corresponding components are assigned the same reference numerals. Furthermore, in the description of the embodiments below, duplicate descriptions of identical or corresponding components may be omitted. However, even if a description of a component is omitted, it is not intended that such component is not included in any embodiment.

[0032] The advantages and features of the disclosed embodiments, and methods for achieving them, will become clearer with reference to the embodiments described below, along with the accompanying drawings. However, the present disclosure is not limited to the embodiments disclosed below and may be implemented in various different forms. These embodiments are provided solely to ensure the completeness of the disclosure and to fully inform those skilled in the art of the scope of the invention.

[0033] The terms used in this specification will be briefly explained, followed by a detailed description of the disclosed embodiments. The terms used in this specification have been selected from widely used, common terms, taking into account the functions of the present disclosure. However, these terms may vary depending on the intentions of engineers working in the relevant fields, precedents, the emergence of new technologies, etc. Furthermore, in certain cases, terms may be arbitrarily selected by the applicant, and in such cases, their meanings will be described in detail in the relevant description of the invention. Therefore, the terms used in this disclosure should not be defined simply as names of terms, but rather based on their meanings and the overall content of the present disclosure.

[0034] In this specification, singular expressions include plural expressions unless the context clearly indicates otherwise. Furthermore, plural expressions include singular expressions unless the context clearly indicates otherwise. When a part of the specification is said to include a component, this does not exclude other components, but rather implies that other components may be included, unless otherwise specifically stated.

[0035] The terms first, second, A, B, etc. used in this specification and claims may be used to describe various components, but these components should not be limited by these terms. These terms are used only to distinguish one component from another.

[0036] Also, the term 'module' or 'part' used in the specification means a software or hardware component, and the 'module' or 'part' performs certain roles. However, the 'module' or 'part' is not limited to software or hardware. The 'module' or 'part' may be configured to reside on an addressable storage medium and may be configured to execute one or more processors. Thus, as an example, the 'module' or 'part' may include at least one of components such as software components, object-oriented software components, class components, and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, or variables. The functionality provided within the components and 'modules' or 'parts' may be combined into a smaller number of components and 'modules' or 'parts', or further separated into additional components and 'modules' or 'parts'.

[0037] According to one embodiment of the present disclosure, a 'module' or 'unit' may be implemented as a processor and a memory. 'Processor' should be broadly construed to include a general-purpose processor, a central processing unit (CPU), a microprocessor, a digital signal processor (DSP), a controller, a microcontroller, a state machine, and the like. In some circumstances, a 'processor' may also refer to an application-specific integrated circuit (ASIC), a programmable logic device (PLD), a field-programmable gate array (FPGA), and the like. A 'processor' may also refer to a combination of processing devices, such as, for example, a combination of a DSP and a microprocessor, a combination of multiple microprocessors, a combination of one or more microprocessors in conjunction with a DSP core, or any other such combination of configurations. In addition, 'memory' should be broadly construed to include any electronic component capable of storing electronic information. 'Memory' may refer to various types of processor-readable media, such as random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable PROM (EEPROM), flash memory, magnetic or optical data storage, registers, etc. Memory is said to be in electronic communication with the processor if the processor can read information from, and / or write information to, the memory. Memory integrated in a processor is in electronic communication with the processor.

[0038] In the present disclosure, the "system" may include, but is not limited to, at least one of a server device and a cloud device. For example, the system may be comprised of one or more server devices. As another example, the system may be comprised of one or more cloud devices. As yet another example, the system may be configured and operated by a combination of a server device and a cloud device.

[0039] In the present disclosure, 'temporal data' may refer to data containing information about time, for example, data recording the duration of a specific event or activity, or the time of occurrence of a specific incident or state.

[0040] In this disclosure, "business hours data" is an example of "time data," and may refer to information regarding the opening and closing times of a specific business, institution, or service provider. "Business hours data" may include the opening and closing times of business, and may be divided into specific time units (e.g., one hour).

[0041] In this disclosure, "time unit" refers to various units for measuring and expressing time, and may refer to units for dividing business hours data into specific intervals. For example, "time unit" may include 4-hour units, 1-hour units, 15-minute units, 5-minute units, 1-minute units, etc.

[0042] In the present disclosure, "interval data" may refer to data that is "time data" divided into "time units." Furthermore, a "interval data set" may refer to a set of one or more "interval data." For example, if time data is 08:00 - 10:00 and divided into 1-hour units, the "interval data" may be "08:00 - 09:00" or "09:00 - 10:00." The "interval data set" may be {"08:00 - 09:00," "09:00 - 10:00,"}.

[0043] In this disclosure, a "interval unit" may refer to the length between the start and end times of interval data. For example, if the interval data is "08:00 - 09:00," the "interval unit" may be 1 hour.

[0044] According to this disclosure, "data management" may refer to all activities related to managing data as a valuable resource. For example, "data management" may include collecting, storing, maintaining, protecting, analyzing, transforming, and utilizing data.

[0045] FIG. 1 is a diagram illustrating an example of a time data management system (120) managing time data (110) according to one embodiment of the present disclosure. The time data management system (120) may convert time data into other types of data with high usability (e.g., hash keys, etc.), or generate and / or provide time-related search results from time data.

[0046] The time data management system (120) can receive time data (110) of a specific search item. For example, the time data management system (120) can receive business hours data of a specific location (e.g., a restaurant, a store, etc.) that operates from 8:00 to 20:00.

[0047] The time data management system (120) may generate a hash key set (130) based on the received time data (110). According to one embodiment, the time data management system (120) may divide the time data (110) into time units, generate an interval data set, and generate a hash key set (130) based on the interval data set. In this case, the time unit may include, for example, at least one of 4 hours, 1 hour, 15 minutes, 5 minutes, and 1 minute. In addition, the hash key set (130) may include at least one hash key associated with the start time of the interval data included in the interval data set. This will be described in detail later with reference to FIGS. 5 to 10.

[0048] Although not illustrated in FIG. 1, the time data management system (120) may generate an index associated with a particular search item that includes at least a portion of the hash key set (130). In one embodiment, the time data (110) may include an ID of a particular search item (e.g., a particular location, etc.), and the time data management system (120) may associate and store the ID of the particular search item included in the time data (110) with the generated hash key set (130).

[0049] As described above, the time data management system (120) can generate a hash key set (130) from the time data (110) of a specific search item and can generate an index associated with the specific search item. Accordingly, the time data management system (120) can enhance the usability of time data, such as by facilitating the generation of search results by a search engine.

[0050] In one embodiment, the time data management system (120) may be connected to another computing device or server (hereinafter referred to as a "search server") on which a search engine is executed. In another embodiment, the time data management system (120) may be included as a component of the search server, or may comprise at least a portion of the search server's configuration. The time data management system (120) may transmit an index generated using a hash key set (130) to the search server. The search server may use the received index to respond to a search query associated with a time and output search items associated with the time.

[0051] FIG. 2 is a schematic diagram illustrating a configuration in which an information processing system (230) is connected to a plurality of user terminals (210_1, 210_2, 210_3) so as to be able to communicate with each other in order to manage time data or provide time-related search results according to one embodiment of the present disclosure. As illustrated, the plurality of user terminals (210_1, 210_2, 210_3) may be connected to an information processing system (230) capable of managing time data or providing time-related search results via a network (220). Here, the plurality of user terminals (210_1, 210_2, 210_3) may be user terminals that transmit time data management requests and / or time-related search queries to the information processing system (230), and receive processed time data (e.g., hash key set, index, etc.) and / or time-related search results from the information processing system (230). Additionally, the information processing system (230) can correspond to the time data management system (120) of FIG. 1.

[0052] In one embodiment, the information processing system (230) may include one or more server devices and / or databases capable of managing time data and / or providing search results associated with time, and one or more computer executable programs (e.g., downloadable applications) capable of managing time data, or one or more distributed computing devices and / or distributed databases based on cloud computing services.

[0053] Processed time data and / or time-related search results provided by the information processing system (230) may be provided to users through applications, web browsers, web browser extensions, etc. installed on each of a plurality of user terminals (210_1, 210_2, 210_3). For example, the information processing system (230) may provide corresponding information or perform corresponding processing, such as providing a hash key set or index, in response to a time data management request received from the user terminals (210_1, 210_2, 210_3) through a time data management application, etc. As another example, the information processing system (230) may provide corresponding information or perform corresponding processing, such as providing a time-related search query, in response to a time-related search query received from the user terminals (210_1, 210_2, 210_3) through a search engine application, etc.

[0054] A plurality of user terminals (210_1, 210_2, 210_3) can communicate with an information processing system (230) via a network (220). The network (220) can be configured to enable communication between the plurality of user terminals (210_1, 210_2, 210_3) and the information processing system (230). Depending on the installation environment, the network (220) can be configured as a wired network such as Ethernet, a wired home network (Power Line Communication), a telephone line communication device, and RS-serial communication, a wireless network such as a mobile communication network, WLAN (Wireless LAN), Wi-Fi, Bluetooth, and ZigBee, or a combination thereof. The communication method is not limited, and may include not only a communication method utilizing a communication network (e.g., a mobile communication network, wired Internet, wireless Internet, broadcasting network, satellite network, etc.) that the network (220) may include, but also short-range wireless communication between user terminals (210_1, 210_2, 210_3).

[0055] In FIG. 2, a mobile phone terminal (210_1), a tablet terminal (210_2), and a PC terminal (210_3) are illustrated as examples of user terminals, but are not limited thereto, and the user terminals (210_1, 210_2, 210_3) may be any computing device capable of wired and / or wireless communication and capable of installing and executing a search application or web browser, etc. For example, the user terminal may include an AI speaker, a smartphone, a mobile phone, a navigation device, a computer, a laptop, a digital broadcasting terminal, a PDA (Personal Digital Assistants), a PMP (Portable Multimedia Player), a tablet PC, a game console, a wearable device, an IoT (Internet of Things) device, a VR (virtual reality) device, an AR (augmented reality) device, a set-top box, etc. In addition, although FIG. 2 illustrates three user terminals (210_1, 210_2, 210_3) communicating with the information processing system (230) via the network (220), this is not limited thereto, and a different number of user terminals may be configured to communicate with the information processing system (230) via the network (220).

[0056] FIG. 3 is a block diagram showing the internal configuration of a user terminal (210) and an information processing system (230) according to one embodiment of the present disclosure. The user terminal (210) may refer to any computing device capable of executing applications, web browsers, etc., and capable of wired / wireless communication, and may include, for example, a mobile phone terminal (210_1), a tablet terminal (210_2), a PC terminal (210_3), etc. of FIG. 2. As illustrated, the user terminal (210) may include a memory (312), a processor (314), a communication module (316), and an input / output interface (318). Similarly, the information processing system (230) may include a memory (332), a processor (334), a communication module (336), and an input / output interface (338). As illustrated in FIG. 3, the user terminal (210) and the information processing system (230) may be configured to communicate information and / or data via a network (220) using respective communication modules (316, 336). In addition, the input / output device (320) may be configured to input a time data management request, a time-related search query, or output information and / or data generated from the user terminal (210) via the input / output interface (318).

[0057] The memory (312, 332) may include any non-transitory computer-readable recording medium. According to one embodiment, the memory (312, 332) may include a non-permanent mass storage device such as a read-only memory (ROM), a disk drive, a solid state drive (SSD), a flash memory, etc. As another example, a non-permanent mass storage device such as a ROM, an SSD, a flash memory, a disk drive, etc. may be included in the user terminal (210) or the information processing system (230) as a separate permanent storage device distinct from the memory. In addition, the memory (312, 332) may store an operating system and at least one program code (e.g., code for managing time data and / or generating / providing time-related search results, etc.).

[0058] These software components may be loaded from a computer-readable recording medium separate from the memory (312, 332). This separate computer-readable recording medium may include a recording medium directly connectable to the user terminal (210) and the information processing system (230), and may include, for example, a computer-readable recording medium such as a floppy drive, a disk, a tape, a DVD / CD-ROM drive, a memory card, etc. As another example, the software components may be loaded into the memory (312, 332) through a communication module (316, 336) other than a computer-readable recording medium. For example, at least one program may be loaded into the memory (312, 332) based on a computer program (e.g., a program for managing time data and / or generating / providing time-related search results) that is installed by files provided by developers or a file distribution system that distributes installation files of applications through a network (220).

[0059] The processor (314, 334) may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input / output operations. Instructions may be provided to the processor (314, 334) by a memory (312, 332) or a communication module (316, 336). For example, the processor (314, 334) may be configured to execute instructions received according to program code stored in a storage device such as the memory (312, 332).

[0060] The communication module (316, 336) may provide a configuration or function for the user terminal (210) and the information processing system (230) to communicate with each other via the network (220), and may provide a configuration or function for the user terminal (210) and / or the information processing system (230) to communicate with another user terminal or another system (e.g., a separate cloud system, etc.). For example, a request or data (e.g., a time data management request, a time-related search query, etc.) generated by the processor (314) of the user terminal (210) according to a program code stored in a recording device such as a memory (312) may be transmitted to the information processing system (230) via the network (220) under the control of the communication module (316). Conversely, a control signal or command provided under the control of the processor (334) of the information processing system (230) can be received by the user terminal (210) through the communication module (316) of the user terminal (210) via the communication module (336) and the network (220).

[0061] The input / output interface (318) may be a means for interfacing with an input / output device (320). As an example, the input device may include a device such as a camera, keyboard, microphone, mouse, etc., including an audio sensor and / or an image sensor, and the output device may include a device such as a display, a speaker, a haptic feedback device, etc. As another example, the input / output interface (318) may be a means for interfacing with a device that has a configuration or function integrated into one for performing input and output, such as a touch screen. For example, when the processor (314) of the user terminal (210) processes a command of a computer program loaded into the memory (312), a service screen configured using information and / or data provided by the information processing system (230) or another user terminal may be displayed on the display through the input / output interface (318). In FIG. 3, the input / output device (320) is illustrated as not being included in the user terminal (210), but is not limited thereto, and may be configured as a single device with the user terminal (210). In addition, the input / output interface (338) of the information processing system (230) may be a means for interfacing with a device (not shown) for input or output that is connected to the information processing system (230) or that the information processing system (230) may include. In FIG. 3, the input / output interfaces (318, 338) are illustrated as elements configured separately from the processors (314, 334), but are not limited thereto, and the input / output interfaces (318, 338) may be configured to be included in the processors (314, 334).

[0062] The user terminal (210) and the information processing system (230) may include more components than those shown in FIG. 3. However, there is no need to explicitly illustrate most of the conventional components. In one embodiment, the user terminal (210) may be implemented to include at least some of the input / output devices (320) described above. In addition, the user terminal (210) may further include other components, such as a transceiver, a Global Positioning System (GPS) module, a camera, various sensors, a database, and the like. For example, if the user terminal (210) is a smartphone, it may include components that a smartphone generally includes, and various components, such as an acceleration sensor, a gyro sensor, a microphone module, a camera module, various physical buttons, buttons using a touch panel, input / output ports, and a vibrator for vibration, may be implemented to be further included in the user terminal (210).

[0063] While a program for a time data management application, a search engine application, etc. is running, the processor (314) can receive text, images, videos, voices, and / or actions, etc. input or selected through an input device such as a camera, microphone, including a touch screen, keyboard, audio sensor, and / or image sensor connected to an input / output interface (318), and can store the received text, images, videos, voices, and / or actions, etc. in a memory (312) or provide them to an information processing system (230) through a communication module (316) and a network (220).

[0064] The processor (314) of the user terminal (210) may be configured to manage, process, and / or store information and / or data received from an input / output device (320), another user terminal, an information processing system (230), and / or multiple external systems. The information and / or data processed by the processor (314) may be provided to the information processing system (230) via a communication module (316) and a network (220). The processor (314) of the user terminal (210) may output the information and / or data by transmitting it to the input / output device (320) via an input / output interface (318). For example, a hash key set, an index, a search result associated with time, and the like may be displayed or shown on the screen of the user terminal (210).

[0065] The processor (334) of the information processing system (230) may be configured to manage, process, and / or store information and / or data received from a plurality of user terminals (210) and / or a plurality of external systems. The information and / or data processed by the processor (334) may be provided to the user terminal (210) via the communication module (336) and the network (220). In one embodiment, the processor (334) may execute instructions for managing time data received from the user terminal (210). In another embodiment, the processor (334) may execute instructions for processing a search query received from the user terminal (210).

[0066] FIG. 4 is a diagram illustrating the internal configuration of a processor (334) of an information processing system according to one embodiment of the present disclosure. In one embodiment, the information processing system may include the time data management system (120) of FIG. 1. As illustrated in FIG. 4, the processor (334) may include a time data management unit (410), a hash key generation unit (420), and a search result generation unit (430).

[0067] The time data management unit (410) may receive time data and / or time-related indexes associated with a specific search item from the time database (440), and transmit the received time data and / or time-related indexes to the hash key generation unit (420) and / or the search result generation unit (430). According to one embodiment, the time data management unit (410) may receive business hours data of a specific location from the time database (440) and transmit the business hours data to the hash key generation unit (420), and the transmitted business hours data may be used to generate a hash key set. According to another embodiment, the time data management unit (410) may receive time-related indexes from the time database (440) and transmit the transmitted time-related indexes to the search result generation unit (430), and the transmitted time-related indexes may be used to generate / provide search results associated with time. Additionally, the time data management unit (410) can receive a hash key set or index generated from the hash key generation unit (420) and transmit it to the time database (440).

[0068] The hash key generation unit (420) may receive time data associated with a specific search item and generate a hash key set based on the received time data. According to one embodiment, the hash key generation unit (420) may receive time data associated with a specific search item (e.g., business hours data of a specific location, etc.) from the time data management unit (410) and / or the time database (440), divide the received time data into first time units (e.g., 4 hours, etc.), generate a first interval data set, and generate a first hash key set based on the generated first interval data set. In this case, the first hash key set may include a hash key associated with a start time of interval data included in the first interval data set.

[0069] In addition, in one embodiment, the hash key generation unit (420) may extract at least one interval data set included in the first interval data set, divide the extracted at least one interval data set into second time units (e.g., 1 hour, 30 minutes, 15 minutes, etc.) to generate a second interval data set, and generate a second hash key set based on the generated second interval data set. In this case, the interval unit of the at least one extracted interval data may not match the first time unit. In addition, the second hash key set may include a hash key associated with the start time of the at least one extracted interval data and the start time of the interval data included in the second interval data set. In one embodiment, the hash key generation unit (420) is described as generating only the first hash key set and the second hash key set, but is not limited thereto, and may repeatedly generate a plurality of hash key sets. Details thereof will be described in detail later with reference to FIGS. 6 to 10.

[0070] The hash key generation unit (420) can generate an index associated with a specific search item that includes at least a portion of a hash key set. In one embodiment, the hash key generation unit (420) can generate an index associated with a specific search item by associating and storing (e.g., storing in the same data table row) an ID of a specific search item (e.g., an ID of a specific location, etc.) with a hash key set. In this case, the ID of the specific search item may be data included in the time data of the specific search item.

[0071] The hash key generation unit (420) may generate a hash key set based on a search query. According to one embodiment, the hash key generation unit (420) may receive a search query associated with a specific search item (e.g., a search query inquiring about the business hours of a specific location, etc.), extract a search target time included in the search query, determine at least one section data based on the extracted search target time, and generate a hash key set based on the determined section data. This will be described in detail later with reference to FIGS. 11 to 13.

[0072] The search result generation unit (430) may generate and / or provide time-related search results based on a search query and an index. According to one embodiment, the search result generation unit (430) may generate a comparison result by comparing a first hash key set generated from the hash key generation unit (420) based on the search query with a second hash key set generated based on time data associated with a specific search item, and may generate a search result based on the comparison result. This will be described in detail later with reference to FIGS. 11 to 13.

[0073] In FIG. 4, each component of the processor (334) represents functionally distinct functional elements, and multiple components may be implemented in an integrated manner in an actual physical environment. Alternatively, each component of the processor (334) may be implemented separately from one another in an actual physical environment.

[0074] In addition, the internal configuration of the processor (334) in FIG. 4 is illustrated as being divided into a time data management unit (410), a hash key generation unit (420), and a search result generation unit (430), but is not limited thereto, and some configurations may be omitted or other configurations may be added.

[0075] FIG. 5 is a diagram illustrating an example of multiple time units (500) for dividing time data according to one embodiment of the present disclosure. According to one embodiment, the multiple time units (500) may be configured with five depths, and each of the time units of the five depths may include measures of 4 hours, 1 hour, 15 minutes, 5 minutes, and 1 minute.

[0076] The time unit of the first depth may be a unit that divides the time data into 4-hour intervals. For example, if the time data is 08:00 - 16:00 and the time data is divided based on the time unit of the first depth, an interval data set of {08:00 - 12:00, 12:00 - 16:00} may be generated.

[0077] The time unit of the second depth may be a unit that divides the time data into 1-hour intervals. For example, if the time data is 08:00 - 10:00 and the time data is divided based on the time unit of the second depth, an interval data set of {08:00 - 09:00, 09:00 - 10:00} may be generated.

[0078] The time unit of the third depth may be a unit that divides the time data into 15-minute intervals. For example, if the time data is 08:00 - 09:00 and the time data is divided based on the time unit of the third depth, an interval data set of {08:00 - 08:15, 08:15 - 08:30, 08:30 - 08:45, 08:45 - 09:00} may be generated.

[0079] The time unit of the fourth depth may be a unit that divides the time data into 5-minute intervals. For example, if the time data is 08:00 - 09:00 and the time data is divided based on the time unit of the fourth depth, an interval data set of {08:00 - 08:05, 08:05 - 08:10, 쪋 , 08:55 - 09:00} may be generated.

[0080] The time unit of the fifth depth may be a unit that divides the time data into 1-minute intervals. For example, if the time data is 08:00 - 09:00 and the time data is divided based on the time unit of the second depth, an interval data set of {08:00 - 08:01, 08:01 - 08:02, 08:02 - 08:03, 쪋, 08:59 - 09:00} may be generated.

[0081] Although multiple time units consisting of five depths are illustrated in FIG. 5, this is not limited thereto, and a variety of depths may be set. Furthermore, although each of the time units of the multiple depths in FIG. 5 is illustrated as having measures of 4 hours, 1 hour, 15 minutes, 5 minutes, and 1 minute, this is not limited thereto, and time units of various intervals may be set.

[0082] FIG. 6 is a diagram illustrating an example of generating a hash key set (630) from time data (610) according to one embodiment of the present disclosure. According to one embodiment, the time data (610) may include business hours data of a specific location that operates from 08:00 to 20:00. Additionally, the hash key set (630) may be generated by a hash key generation unit (e.g., the hash key generation unit (420) of FIG. 4).

[0083] The interval data set (620) may be generated by dividing the time data (610) into first time units. In one embodiment, the first time unit (the time unit of the first depth) may be 4 hours, and the interval data set (620) may be {08:00 - 12:00, 12:00 - 16:00, 16:00 - 20:00}, which includes first time unit data (08:00 - 12:00), second time unit data (12:00 - 16:00), and third time unit data (16:00 - 20:00), which are the results of dividing the time data (610) 08:00 - 20:00 into the first time unit.

[0084] A hash key set (630) may be generated based on the interval data set (620). In one embodiment, the hash key set (630) may include a hash key associated with a start time of interval data included in the interval data set (620). For example, the hash key set (630) may include a first hash key (08) representing a start time (08:00) of first interval data (08:00 - 12:00) included in the interval data set (620) as a two-digit number, a second hash key (12) representing a start time (12:00) of second interval data (12:00 - 16:00) included in the interval data set (620) as a two-digit number, and a third hash key (16) representing a start time (16:00) of third interval data (16:00 - 20:00) included in the interval data set (620) as a two-digit number.

[0085] Although not illustrated in FIG. 6, an index may additionally be generated that is associated with a specific search term that includes at least a portion of the hash key set (630). In one embodiment, the index may be generated by storing an ID of a specific location (e.g., 123, Restaurant A, etc.) in association with at least a portion of the hash key set (630). Furthermore, the first time unit is not limited to the illustrated content and may be set in various ways.

[0086] FIG. 7 is a diagram illustrating an example of generating a hash key set (740) from time data (710) according to another embodiment of the present disclosure. According to one embodiment, the time data (710) may include business hours data of a specific location that operates from 08:00 to 21:00. Additionally, the hash key set (740) may be generated by a hash key generation unit (e.g., the hash key generation unit (420) of FIG. 4 ).

[0087] The first interval data set (720) may be generated by dividing the time data (710) into first time units. In one embodiment, the first time unit (the time unit of the first depth) may be 4 hours, and the first interval data set (720) may be {08:00 - 12:00, 12:00 - 16:00, 16:00 - 20:00, 20:00 - 21:00} including first interval data (08:00 - 12:00), second interval data (12:00 - 16:00), third interval data (16:00 - 20:00), and fourth interval data (20:00 - 21:00), which are the results of dividing the time data (710) 08:00 - 21:00 into first time units.

[0088] The second interval data set (730) can be generated by dividing at least one interval data extracted from the first interval data set (720) whose interval unit does not match the first time unit. That is, the second interval data set (730) can be generated by dividing at least one interval data extracted from the first interval data set (720) whose interval unit does not match the first time unit by a second time unit. In one embodiment, since the interval unit of the fourth interval data is 1 hour, which does not match the first time unit (4 hours), the fourth interval data can be extracted, and the extracted fourth interval data can be divided by 1 hour, which is the second time unit (the time unit of the second depth), to form the second interval data set (730). In this case, the second interval data set (730) can include the fifth interval data (20:00 - 21:00).

[0089] A hash key set (740) may be generated based on a first interval data set (720) and a second interval data set (730). In one embodiment, the hash key set (740) may include a first hash key subset that includes hash keys associated with start times of interval data included in the first interval data set (720). For example, the first hash key subset may include a first hash key (08) representing the start time (08:00) of the first interval data (08:00 - 12:00) included in the first interval data set (730) as a two-digit number, a second hash key (12) representing the start time (12:00) of the second interval data (12:00 - 16:00) included in the first interval data set (720) as a two-digit number, and a third hash key (16) representing the start time (16:00) of the third interval data (16:00 - 20:00) included in the first interval data set (720) as a two-digit number.

[0090] In one embodiment, the hash key set (740) may include a second hash key subset including a hash key associated with a start time of at least one interval data extracted from the first interval data set (720) and a start time of interval data included in the second interval data set (730). For example, the second hash key subset may include a fourth hash key (2020) that combines a hash key (20) representing a start time (20:00) of fourth interval data extracted from the first interval data set (720) in two digits and a hash key (20) representing a start time (20:00) of fifth interval data included in the second interval data set (730) in two digits.

[0091] Although not illustrated in FIG. 7, an index associated with a specific search item that includes at least a portion of the hash key set (740) may additionally be generated. Furthermore, the first time unit and the second time unit are not limited to the illustrated content and may be set in various ways.

[0092] FIG. 8 is a diagram illustrating an example of generating a hash key set (850) from time data (810) according to another embodiment of the present disclosure. According to one embodiment, the time data (810) may include business hours data of a specific location that operates from 8:30 AM to 9:00 PM. Additionally, the hash key set (850) may be generated by a hash key generation unit (e.g., the hash key generation unit (420) of FIG. 4 ). Hereinafter, the same configuration as that described in FIGS. 6 and 7 may be briefly described or omitted below.

[0093] The first interval data set (820) can be generated by dividing the time data (810) into first time units (4 hours). The second interval data set (830) can be generated by dividing at least one interval data that is included in the first interval data set (820) and has an interval unit that does not match the first time unit. That is, the second interval data set (830) can be generated by dividing at least one interval data extracted from the first interval data set (820) that has an interval unit that does not match the first time unit into second time units (1 hour).

[0094] A third interval data set (840) can be generated by extracting at least one interval data included in the second interval data set (830) whose interval unit does not match the second time unit, and dividing the extracted at least one interval data into third time units. In one embodiment, the interval unit of the first interval data (08:30 - 09:00) included in the second interval data set (830) is 30 minutes, which does not match the second time unit (1 hour), so the first interval data can be extracted, and the extracted first interval data can be divided into 15 minutes, which is a third time unit (time unit of the third depth), to form a third interval data set (840). In this case, the third interval data set (840) can include the second interval data (08:30 - 08:45) and the third interval data (08:45 - 09:00).

[0095] A hash key set (850) may be generated based on the first to third interval data sets (820, 830, 840). In one embodiment, the hash key set (850) may include a first hash key subset ({12, 16}) including a hash key associated with a start time of interval data included in the first interval data set (820). In addition, the hash key set (850) may include a second hash key subset ({0809, 0810, 0811, 2020}) including a hash key associated with a start time of at least one interval data extracted from the first interval data set (820) and a start time of interval data included in the second interval data set (830).

[0096] In one embodiment, the hash key set (850) may include a third hash key subset including a hash key associated with a start time of at least one interval data extracted from a first interval data set (820), a start time of at least one interval data extracted from a second interval data set (830), and a start time of interval data included in a third interval data set (830). For example, the third hash key subset may include a first hash key (080830) that combines a hash key (08) representing a start time of an interval data set extracted from the first interval data set (820) in two digits, a hash key (08) representing a start time of an interval data set extracted from the second interval data set (830) in two digits, and a hash key (30) representing a start time (08:30) of second interval data (08:30 - 08:45) included in the third interval data set (840) in two digits. In addition, the third hash key subset may further include a second hash key (080845) generated in the same manner as described above.

[0097] Although not illustrated in FIG. 8, additionally, an index associated with a specific search item that includes at least a portion of the hash key set (850) may be generated. Furthermore, the first to third time units are not limited to the illustrated content and may be set in various ways.

[0098] FIG. 9 is a diagram illustrating an example of generating a hash key set (940) from time data (910) according to another embodiment of the present disclosure. According to one embodiment, the time data (910) may include business hours data of a specific location that operates from 8:30 AM to 9:10 PM. Additionally, the hash key set (940) may be generated by a hash key generation unit (e.g., the hash key generation unit (420) of FIG. 4 ). Hereinafter, configurations identical to those described in FIGS. 6 to 8 may be briefly described or omitted.

[0099] The first to third interval data sets (920) may be generated by dividing time data (910) into first time units (4 hours), dividing at least one interval data extracted from the first interval data set into second time units (1 hour), and dividing at least one interval data extracted from the second interval data set into third time units (15 minutes).

[0100] A fourth interval data set (930) can be generated by extracting at least one interval data included in the third interval data set, where the interval unit is inconsistent with the third time unit, and dividing the extracted at least one interval data into fourth time units. In one embodiment, the interval unit of the first interval data (21:00 - 21:10) included in the third interval data set is 10 minutes, which is inconsistent with the third time unit (15 minutes), so the first interval data can be extracted, and the extracted first interval data can be divided into 5 minutes, which is the fourth time unit (the time unit of the fourth depth), to form a fourth interval data set (930). In this case, the fourth interval data set (930) can include the second interval data (21:00 - 21:05) and the third interval data (21:05 - 21:10).

[0101] The hash key set (940) may be generated based on the first to fourth interval data sets (920, 930). In one embodiment, the hash key set (940) may include the first to third hash key subsets ({080830, 080845, 0809, 0810, 0811, 12, 16, 2020}).

[0102] In one embodiment, the hash key set (940) may include a start time of at least one interval data extracted from the first interval data set to the third interval data set (920), and a fourth hash key subset including a hash key associated with the start time of the interval data included in the fourth interval data set (930). For example, the fourth hash key subset may include a first hash key (20210000) that combines a hash key (20) representing a start time of an interval data set extracted from the first interval data set in two digits, a hash key (21) representing a start time of an interval data set extracted from the second interval data set in two digits, a hash key (00) representing a start time of an interval data set extracted from the third interval data set in two digits, and a hash key (00) representing a start time (21:00) of the first interval data (21:00 - 21:05) included in the fourth interval data set (930) in two digits. In addition, the third hash key subset may further include a second hash key (20210005) generated in the same manner as described above.

[0103] Although not illustrated in FIG. 9, additionally, an index associated with a specific search item that includes at least a portion of the hash key set (940) may be generated. Furthermore, the first to fourth time units are not limited to the illustrated content and may be set in various ways.

[0104] FIG. 10 is a diagram illustrating an example of generating a hash key set (1050) from time data (1010) according to another embodiment of the present disclosure. According to one embodiment, the time data (1010) may include business hours data of a specific location that operates from 8:30 AM to 9:21 PM. Additionally, the hash key set (1050) may be generated by a hash key generation unit (e.g., the hash key generation unit (420) of FIG. 4 ). Hereinafter, configurations identical to those described in FIGS. 6 to 9 may be briefly described or omitted below.

[0105] The first to third interval data sets (1020) may be generated by dividing time data (1010) into first time units (4 hours), dividing at least one interval data extracted from the first interval data set into second time units (1 hour), and dividing at least one interval data extracted from the second interval data set into third time units (15 minutes). In addition, the fourth interval data set (1030) may be generated by extracting at least one interval data included in the third interval data set, the interval unit of which does not match the third time unit, and dividing the extracted at least one interval data into fourth time units.

[0106] The fifth interval data set (1040) can be generated by extracting at least one interval data included in the fourth interval data set, where the interval unit is inconsistent with the fourth time unit, and dividing the extracted at least one interval data into fifth time units. In one embodiment, the interval unit of the first interval data (21:20 - 21:21) included in the fourth interval data set is 1 minute, which is inconsistent with the fourth time unit (5 minutes), so the first interval data can be extracted, and the extracted first interval data can be divided into 1 minute, which is the fifth time unit (the time unit of the fifth depth), to form the fifth interval data set (1040). In this case, the fourth interval data set can include the second interval data (21:20 - 21:21) and the third interval data (21:15 - 21:20).

[0107] The hash key set (1050) may be generated based on the first to fifth interval data sets (1020, 1030, 1040). In one embodiment, the hash key set (1050) may include the first to third hash key subsets ({080830, 080845, 0809, 0810, 0811, 12, 16, 2020, 202100}). Additionally, the hash key set (1050) may include the fourth hash key subset ({20211515}).

[0108] In one embodiment, the hash key set (1050) may include a start time of at least one interval data extracted from the first interval data set to the fourth interval data set (1020, 1030), and a fifth hash key subset including a hash key associated with a start time of interval data included in the fifth interval data set (1040). For example, the fifth hash key subset may include a first hash key (2021152020) that combines a hash key (20) that represents the start time of an interval data set extracted from the first interval data set in two digits, a hash key (21) that represents the start time of an interval data set extracted from the second interval data set in two digits, a hash key (15) that represents the start time of an interval data set extracted from the third interval data set in two digits, a hash key (20) that represents the start time of an interval data set extracted from the fourth interval data set in two digits, and a hash key (20) that represents the start time (21:20) of the first interval data (21:20 - 21:21) included in the fifth interval data set (1040) in two digits.

[0109] Although not illustrated in FIG. 10, additionally, an index associated with a specific search item that includes at least a portion of the hash key set (1050) may be generated. Furthermore, the first to fifth time units are not limited to the illustrated content and may be set in various ways.

[0110] FIG. 11 is a diagram illustrating an example of receiving a time-related search query (1102) and providing a time-related search result (1120) according to one embodiment of the present disclosure.

[0111] According to one embodiment, receiving a time-related search query (1102) and providing a time-related search result (1120) may be performed by an information processing system (e.g., a time data management system (120) of FIG. 1, an information processing system (230) of FIG. 2, etc.).

[0112] In one embodiment, the hash key generation unit (420) of the information processing system may receive a time-related search query (1102) from a user terminal (1100). The time-related search query (1102) may include a search target time and a search target location. For example, the search query (1102) may be "Is Restaurant A open at 7:31 PM?" and may include a search target time (7:31 PM) and a search target location (Restaurant A).

[0113] In one embodiment, the hash key generation unit (420) may extract a search target time included in a search query (1102), determine at least one interval data based on the extracted search target time, and generate a first hash key set (1104) based on the determined at least one interval data. For example, the hash key generation unit (420) may extract a search target time of “19:31” from the search query (1102). Then, the hash key generation unit (420) may determine interval data of 19:31 - 19:32, 19:30 - 19:35, 19:30 - 19:45, 19:00 - 20:00, and 16:00 - 20:00 from the search target time. Then, the hash key generation unit (420) can generate a first hash key set (1104) including hash keys of 16, 1619, 161930, 16193030, and 1619303031 based on the determined interval data.

[0114] In one embodiment, the hash key generation unit (420) may generate a hash key set (1112) based on the time data (110). For example, the hash key generation unit (420) may generate a second hash key set (1112) including hash keys of 088113040, 081145, 1212, 1213, 161730, 161745, 1618, 1619, 2020, and 2021 from the business hours data of Restaurant A through the method described above with reference to FIGS. 6 to 10. In addition, the hash key generation unit (420) may generate an index associated with Restaurant A based on the second hash key set.

[0115] In one embodiment, the information processing system may generate a search result (1120) including whether the search target location is open for business at the search target time based on an index including a first hash key set (1104) and a second hash key set (1112). For example, a search result generation unit (e.g., a search result generation unit (430) of FIG. 4) of the information processing system may compare the first hash key set (1104) and the second hash key set (1112) to generate a comparison result. In response to determining that the first hash key set and the second hash key set have a common hash key (e.g., 1619, etc.), the search result generation unit may generate a search result (1120) indicating that the search target location, Restaurant A, is open for business. The information processing system may provide the generated search result (1120) to the user terminal (1100).

[0116] As described above, based on a search query (1102) and a set of hash keys (1104, 1112) associated with time, search results (1120) associated with time can be provided. Accordingly, accessibility to time data and search speed using the same can be improved.

[0117] FIG. 12 is a diagram illustrating an example of receiving a time-related search query (1202) and providing a time-related search result (1220) according to another embodiment of the present disclosure.

[0118] According to one embodiment, receiving a time-related search query (1202) and providing a time-related search result (1220) may be performed by an information processing system (e.g., a time data management system (120) of FIG. 1, an information processing system (230) of FIG. 2, etc.).

[0119] In one embodiment, the hash key generation unit (420) of the information processing system may receive a time-related search query (1202) from a user terminal (1200). The time-related search query (1202) may include a search target time. For example, the search query (1202) may be "cafes open at 5:07 PM" and may include a search target time (5:07 PM).

[0120] In one embodiment, the hash key generation unit (420) may extract a search target time included in a search query (1202), determine at least one section data based on the extracted search target time, and generate a hash key set (1204) including hash keys of 16, 1617, 161700, 16170005, and 1617000507 based on the determined at least one section data. The hash key generation unit (420) may transmit the generated hash key set (1204) to the search result generation unit (430) of the information processing system.

[0121] In one embodiment, the time data management unit (410) of the information processing system can transmit an index (1210) associated with time to the search result generation unit (430). For example, the time data management unit (410) can receive an index (1210) associated with time stored in a time database (not shown) and transmit the received index (1210) to the search result generation unit. In this case, the index (1210) can include an ID for each of a plurality of locations and a set of hash keys for each of the plurality of locations. In this case, the time data management unit (410) can extract the type of search item included in the search query (1202) (e.g., cafe, etc.) and transmit a filtered index (1210) based on the type of the extracted search item to the search result generation unit (430).

[0122] In one embodiment, the search result generation unit (430) may generate search results (1220) including places open for business at the search target time based on the hash key set (1204) and the index (1210). For example, the search result generation unit (e.g., the search result generation unit (430) of FIG. 4) may compare the hash key set (1204) and the hash key set included in the index (1210), determine places with a common hash key to be open for business, and include them in the search results (1220). The search result generation unit (430) may provide the generated search results (1220) to the user terminal (1200).

[0123] As described above, time-related search results (1220) can be provided based on a search query (1202) and an index (1210) including at least a portion of a set of hash keys associated with time. Accordingly, accessibility to time data and search speed using the same can be improved.

[0124] FIG. 13 is a diagram illustrating an example of receiving a time-related search query and providing time-related search results (1320) according to another embodiment of the present disclosure. According to one embodiment, receiving a time-related search query and providing time-related search results (1320) may be performed by an information processing system (e.g., the time data management system (120) of FIG. 1, the information processing system (230) of FIG. 2, etc.).

[0125] In one embodiment, the hash key generation unit (420) of the information processing system may receive a time-related search query from a user terminal (1300). In this case, the time-related search query may be generated by receiving a user input selecting a search target time. For example, the user terminal (1300) may generate a search query of "12:00" by receiving a user input selecting the 12:00 PM area of ​​the user interface (1302) from the user, and may transmit the generated search query to the hash key generation unit (420).

[0126] In one embodiment, the hash key generation unit (420) may extract a search target time included in a search query, determine at least one section data based on the extracted search target time, and generate a hash key set (1304) including hash keys of 12, 1212, 121200, 12120000, and 1212000000 based on the determined at least one section data. The hash key generation unit (420) may transmit the generated hash key set (1304) to the search result generation unit (430) of the information processing system.

[0127] In one embodiment, the time data management unit (410) of the information processing system may transmit an index (1310) associated with time to the search result generation unit (430). The index (1310) may include an ID for each of a plurality of locations and a set of hash keys for each of the plurality of locations. In this case, the time data management unit (410) may receive location data and transmit a filtered index (1310) based on the received location data to the search result generation unit (430).

[0128] In one embodiment, the search result generation unit (430) may generate search results (1320) including locations open at the search target time based on the hash key set (1304) and the index (1310). The search result generation unit (430) may provide the generated search results (1320) to the user terminal (1300). Through the above-described configuration, accessibility to time data and search speed using the same may be improved.

[0129] FIG. 14 is a flowchart illustrating an example of a method (1400) for managing time-related searches according to one embodiment of the present disclosure. In one embodiment, the method (1400) may be performed by at least one processor (e.g., processor (334)) of an information processing system and / or at least one processor (e.g., processor (314)) of a user terminal. The method (1400) may be initiated by receiving time data associated with a specific search item (S1410). Then, the processor may divide the time data into first time units to generate a first interval data set (S1420).

[0130] Then, the processor may generate a first hash key set based on the first interval data set. In one embodiment, the first hash key set may include a hash key associated with the start time of the interval data included in the first interval data set (S1430). Finally, the processor may generate an index associated with a specific search item that includes at least a portion of the first hash key set (S1440).

[0131] In one embodiment, the processor may extract at least one interval data included in a first interval data set, divide the extracted at least one interval data into second time units to generate a second interval data set, and generate a second hash key set based on the second interval data set. The second hash key set may include a start time of the extracted at least one interval data and a hash key associated with the start time of the interval data included in the second interval data set. In this case, the interval unit of the extracted at least one interval data may not match the first time unit.

[0132] In one embodiment, the time data for a particular search item includes the ID of the particular search item, and the processor can associate the ID of the particular search item with a first set of hash keys and store them. Furthermore, the processor can receive a search query associated with the time, and generate search results associated with the time based on the search query and the index.

[0133] In one embodiment, the processor may generate a third set of hash keys based on the search query, compare the first set of hash keys with the third set of hash keys to generate a comparison result, and generate a search result based on the comparison result. For example, the processor may extract a search target time included in the search query, determine at least one interval data based on the extracted search target time, and generate the third set of hash keys based on the determined at least one interval data.

[0134] In one embodiment, the search query may include a first search query including a search target time and a search target location, and the search results may include a first search result including whether the search target location is open for business at the search target time.

[0135] In another embodiment, the search query may include a second search query that includes a search target time, and the search results may include second search results that include locations that are open for business at the search target time.

[0136] In another embodiment, the search query may include a third search query generated by receiving user input selecting a search target time, and the search results may include the third search results including places that are open for business at the search target time.

[0137] The flowchart illustrated in Figure 14 and the description above are merely examples, and some embodiments may be implemented differently. For example, in some embodiments, the order of each step may be changed, some steps may be repeated, some steps may be omitted, or some steps may be added.

[0138] FIG. 15 is a flowchart illustrating an example of a method (1500) for providing search results associated with time according to one embodiment of the present disclosure. In one embodiment, the method (1500) may be performed by at least one processor (e.g., processor (334)) of an information processing system and / or at least one processor (e.g., processor (314)) of a user terminal. The method (1500) may be initiated by receiving a search query associated with time (S1510).

[0139] Then, the processor may obtain a time-associated index (S1520). In one embodiment, the index may include a first hash key set generated based on a first interval data set generated by dividing time data associated with a specific search item into first time units. Finally, the processor may provide time-associated search results based on the search query and the index (S1530).

[0140] In one embodiment, the processor may generate a second set of hash keys based on the search query, compare the first set of hash keys and the second set of hash keys to generate a comparison result, and provide a search result based on the comparison result.

[0141] In one embodiment, the search query may include a first search query including a search target time and a search target location, and the search results may include a first search result including whether the search target location is open for business at the search target time.

[0142] In another embodiment, the search query may include a second search query that includes a search target time, and the search results may include second search results that include locations that are open for business at the search target time.

[0143] In another embodiment, the search query may include a third search query generated by receiving user input selecting a search target time, and the search results may include the third search results including places that are open for business at the search target time.

[0144] The flowchart illustrated in FIG. 15 and the description above are merely examples, and some embodiments may be implemented differently. For example, in some embodiments, the order of each step may be changed, some steps may be repeated, some steps may be omitted, or some steps may be added.

[0145] The above-described method may be provided as a computer program stored on a computer-readable recording medium for execution on a computer. The medium may be one that continuously stores a computer-executable program or one that temporarily stores it for execution or download. In addition, the medium may be various recording means or storage means in the form of a single or multiple hardware combinations, and is not limited to a medium directly connected to a computer system, but may also be distributed over a network. Examples of the medium may include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical recording media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks, and those configured to store program instructions, including ROM, RAM, and flash memory. In addition, examples of other media may include recording or storage media managed by app stores that distribute applications, sites that supply or distribute various software, servers, etc.

[0146] The methods, operations, or techniques of the present disclosure may be implemented by various means. For example, these techniques may be implemented in hardware, firmware, software, or a combination thereof. Those skilled in the art will appreciate that the various exemplary logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or a combination of both. To clearly illustrate this interchangeability of hardware and software, various exemplary components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software will depend on the particular application and the design requirements imposed on the overall system. Those skilled in the art may implement the described functionality in various ways for each particular application, but such implementations should not be construed as departing from the scope of the present disclosure.

[0147] In a hardware implementation, the processing units used to perform the techniques may be implemented within one or more ASICs, DSPs, GPUs, digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, electronic devices, other electronic units designed to perform the functions described herein, a computer, or a combination thereof.

[0148] Accordingly, the various exemplary logical blocks, modules, and circuits described in connection with the present disclosure may be implemented or performed by any combination of a general-purpose processor, a DSP, an ASIC, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or those designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0149] In a firmware and / or software implementation, the techniques may be implemented as instructions stored on a computer-readable medium, such as random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable PROM (EEPROM), flash memory, a compact disc (CD), a magnetic or optical data storage device, etc. The instructions may be executable by one or more processors and may cause the processor(s) to perform certain aspects of the functionality described herein.

[0150] When implemented in software, the techniques may be stored on or transmitted as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media, including any medium that facilitates transfer of a computer program from one place to another. Storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. In addition, any connection is suitably made to a computer-readable medium.

[0151] For example, if the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, digital subscriber line, or wireless technologies such as infrared, radio, and microwave are included within the definition of media. Disk and disc, as used herein, includes compact discs, laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs, where disks usually reproduce data magnetically, whereas discs reproduce data optically using lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0152] A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium. Alternatively, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. Alternatively, the processor and the storage medium may reside as discrete components in the user terminal.

[0153] While the embodiments described above have been described as utilizing aspects of the presently disclosed subject matter in one or more standalone computer systems, the present disclosure is not limited thereto and may be implemented in conjunction with any computing environment, such as a network or distributed computing environment. Furthermore, aspects of the present disclosure may be implemented in multiple processing chips or devices, and storage may be similarly affected across multiple devices. Such devices may include personal computers, network servers, and portable devices.

[0154] While the present disclosure has been described in connection with certain embodiments herein, various modifications and variations may be made without departing from the scope of the present disclosure, which would be apparent to those skilled in the art. Furthermore, such modifications and variations are intended to fall within the scope of the claims appended to this specification.

Claims

1. A method for managing time data for time-related search, performed by at least one processor, A step of receiving time data associated with a specific search item; A step of dividing the above time data into first time units to create a first interval data set; A step of generating a first hash key set based on the first interval data set; and A step of generating an index associated with the particular search item, the index comprising at least a portion of the first hash key set; A method for managing time data, including:

2. In paragraph 1, The above first hash key set is, A time data management method, comprising a hash key associated with the start time of the interval data included in the first interval data set.

3. In paragraph 1, A step of extracting at least one interval data included in the first interval data set; A step of dividing at least one of the extracted interval data into second time units to generate a second interval data set; and A step of generating a second hash key set based on the second interval data set. A method for managing time data, further comprising:

4. In paragraph 3, The above second hash key set is, A time data management method, comprising a hash key associated with the start time of at least one extracted interval data and the start time of interval data included in the second interval data set.

5. In paragraph 3, A time data management method, wherein the interval unit of at least one extracted interval data and the first time unit do not match.

6. In paragraph 1, The time data for the above specific search item is, Contains the ID of the specific search item above, The step of generating an index associated with the specific search item including at least a portion of the first hash key set comprises the step of storing the ID of the specific search item and the first hash key set in association with each other. A method for managing time data, including:

7. In paragraph 1, A step of receiving a search query associated with time; and A step of generating search results associated with time based on the search query and the index. A method for managing time data, including:

8. In paragraph 7, The steps for generating the above search results are: A step of generating a third hash key set based on the above search query; A step of comparing the first hash key set and the third hash key set to generate a comparison result; and A step of generating the search result based on the above comparison result A method for managing time data, including:

9. In paragraph 8, The step of generating the third hash key set is: A step of extracting a search target time included in the above search query; A step of determining at least one section data based on the extracted search target time; and generating the third hash key set based on at least one of the determined interval data; A method for managing time data, including:

10. In paragraph 7, The above search query is, Includes a first search query that includes a search target time and a search target location, The above search results are, A time data management method including a first search result including whether the search target location is open for business at the search target time.

11. In paragraph 7, The above search query is, A second search query including the search target time, The above search results are, A time data management method including a second search result including a place that is open for business at the search target time.

12. In paragraph 7, The above search query is, A third search query is generated by receiving user input for selecting a search target time, The above search results are, A time data management method including a third search result including a place that is open for business at the above search target time.

13. In a method for providing search results related to time, performed by at least one processor, A step of receiving a search query associated with time; A step of obtaining an index associated with the above time; and A step of providing search results associated with time based on the search query and the index, The above index is, A method for providing search results associated with time, comprising: a first hash key set generated based on a first interval data set generated by dividing time data associated with a specific search item into first time units.

14. In paragraph 13, The step of providing the above search results is: generating a second set of hash keys based on the search query; A step of comparing the first hash key set and the second hash key set to generate a comparison result; and A step of providing the search results based on the above comparison results. A method for providing search results related to time, including:

15. In paragraph 13, The above search query is, Includes a first search query that includes a search target time and a search target location, The above search results are, A method for providing search results associated with time, the method comprising a first search result including whether the search target location is open for business at the search target time.

16. In paragraph 13, The above search query is, A second search query including the search target time, The above search results are, A method for providing search results related to time, including second search results including places open for business at the time of the search target.

17. In paragraph 13, The above search query is, A third search query is generated by receiving user input for selecting a search target time, The above search results are, A method for providing search results related to time, including third search results including places open for business at the time of the search target.

18. A computer program stored on a computer-readable recording medium for executing the method according to any one of claims 1 to 17 on a computer.

19. As an information processing system, memory; and At least one processor connected to said memory and configured to execute at least one computer-readable program contained in said memory Including, At least one program above, Receive time data associated with a specific search item, Divide the above time data into first time units to create a first interval data set, Based on the first section data set, a first hash key set is generated, An information processing system comprising instructions for generating an index associated with the particular search item, the index comprising at least a portion of the first hash key set.

20. As an information processing system, memory; and At least one processor connected to said memory and configured to execute at least one computer-readable program contained in said memory Including, At least one program above, Receive time-related search queries, Obtain the index associated with the above time, Includes commands for providing search results associated with time based on the search query and the index, The above index is, An information processing system comprising a first hash key set generated based on a first interval data set generated by dividing time data associated with a specific search item into first time units.

Images