CN111435376A - Information processing method and system, computer system, and computer-readable storage medium - Google Patents
Information processing method and system, computer system, and computer-readable storage medium Download PDFInfo
- Publication number
- CN111435376A CN111435376A CN201910038018.3A CN201910038018A CN111435376A CN 111435376 A CN111435376 A CN 111435376A CN 201910038018 A CN201910038018 A CN 201910038018A CN 111435376 A CN111435376 A CN 111435376A
- Authority
- CN
- China
- Prior art keywords
- keyword
- target
- information
- determining
- search
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The present disclosure provides an information processing method, including determining keyword information and time information for searching a target result in user input information; determining a target keyword index matched with the keyword information from a keyword set of a cache type database, wherein the keyword set comprises one or more keyword indexes, and each keyword index has a corresponding search answer; determining search answers of target time matched with the time information in a corresponding time range from an ordered set of a cache type database, wherein the ordered set comprises one or more time stamps and the search answers; and determining a target result according to the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range. The present disclosure also provides an information processing system, a computer system, and a computer-readable storage medium.
Description
Technical Field
The present disclosure relates to the field of internet technologies, and in particular, to an information processing method and system, a computer system, and a computer-readable storage medium.
Background
In some application scenarios, data retrieval needs to be performed on data within a time range specified in user input information, and a common solution is to generate a database table by using search answers, search keywords and time as fields, establish a relational database, and query data within the time period by using SQ L statements and using start time and end time, and N (N > ═ 0) search keywords as conditions.
In implementing the disclosed concept, the inventors found that there are at least the following problems in the related art: due to the uncertainty of the information input by the user, when searching is carried out based on a database table maintained in the relational database, the query efficiency is low, and the expandability of fields in the database table is poor.
Disclosure of Invention
In view of the above, the present disclosure provides an information processing method and system, a computer system, and a computer-readable storage medium.
One aspect of the present disclosure provides an information processing method including determining keyword information and time information for searching for a target result among user input information; determining a target keyword index matched with the keyword information from a keyword set of a cache type database, wherein the keyword set comprises one or more keyword indexes, and each keyword index has a corresponding search answer; determining search answers of target time matched with the time information in a corresponding time range from an ordered set of the cache type database, wherein the ordered set comprises one or more time stamps and the search answers; and determining the target result according to the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range.
According to an embodiment of the present disclosure, determining the target result according to the search answer corresponding to the target keyword index and the search answer of the target time within the corresponding time range includes taking an intersection of the search answer corresponding to the target keyword index and the search answer of the target time within the corresponding time range, and taking the search answer obtained after taking the intersection as the target result.
According to an embodiment of the present disclosure, determining a target keyword index matching the keyword information from a keyword set of a cached database includes: determining the category of the keyword information; and determining the target keyword index from the keyword set of the cache type database according to the category of the keyword information and the keywords in the keyword information.
According to an embodiment of the present disclosure, after the target result is determined, the method further includes sending the target result to a client, so that the client can display the target result and update the target result to a local memory using a least recently used algorithm.
According to an embodiment of the present disclosure, the method further includes: acquiring an adding operation; and responding to the adding operation, and adding a corresponding index in the keyword set.
Another aspect of the present disclosure provides an information processing system including: the first determining module is used for determining keyword information and time information used for searching a target result in the user input information; the first matching module is used for determining a target keyword index matched with the keyword information from a keyword set of a cache type database, wherein the keyword set comprises one or more keyword indexes, and each keyword index has a corresponding search answer; the second matching module is used for determining search answers of the target time matched with the time information in a corresponding time range from an ordered set of the cache type database, wherein the ordered set comprises one or more timestamps and the search answers; and a second determining module, configured to determine the target result according to the search answer corresponding to the target keyword index and the search answer within the corresponding time range of the target time.
According to an embodiment of the present disclosure, the second determining module is configured to take an intersection of the search answer corresponding to the target keyword index and the search answer of the target time within a corresponding time range, and use the search answer obtained after taking the intersection as the target result.
According to an embodiment of the present disclosure, the first matching module includes a first determining unit, configured to determine a category of the keyword information; and a second determining unit configured to determine the target keyword index from the keyword set in the cache type database according to the category of the keyword information and the keyword in the keyword information.
According to an embodiment of the present disclosure, the system further includes a sending module, configured to send the target result to a client after determining the target result, so that the client can display the target result and update the target result to a local memory that adopts a least recently used algorithm.
According to an embodiment of the present disclosure, the system further includes an obtaining module, configured to obtain the adding operation; and the response module is used for responding to the adding operation and adding the corresponding index in the keyword set.
Another aspect of the present disclosure provides a computer system comprising: one or more processors; a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the information processing method as described above.
Another aspect of the present disclosure provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to implement the information processing method as described above.
Another aspect of the present disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to the embodiment of the disclosure, because the technical means that the keyword sets in the cache type database store the corresponding keyword indexes, each index has the corresponding search answer, the ordered sets store the search answers with the target time in the corresponding time range, and the data search in a time period range is supported is adopted, the technical problems that the query efficiency is low and the expandability of fields in the database table is poor when the related technology adopts the database table maintained in the relational database for searching are at least partially overcome, so that the consistency of data can be ensured, the requirement of data search in the time period range is met, and the search efficiency is improved are achieved.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
fig. 1 schematically shows an exemplary system architecture to which an information processing method and an information processing system can be applied according to an embodiment of the present disclosure;
FIG. 2 schematically shows a flow chart of an information processing method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart for determining a target keyword index matching keyword information from a keyword set of a cached database according to an embodiment of the present disclosure;
FIG. 4 schematically shows a flow chart of an information processing method according to another embodiment of the present disclosure;
FIG. 5 schematically shows a flow chart of an information processing method according to another embodiment of the present disclosure;
FIG. 6 schematically shows a block diagram of an information handling system according to an embodiment of the present disclosure;
FIG. 7 schematically illustrates a block diagram of a first matching module according to an embodiment of the disclosure;
FIG. 8 schematically shows a block diagram of an information handling system according to another embodiment of the present disclosure; and
FIG. 9 schematically shows a block diagram of a computer system suitable for implementing the above described method according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
Embodiments of the present disclosure provide an information processing method and an information processing system, a computer system, and a computer-readable storage medium. The information processing method comprises the steps of determining keyword information and time information used for searching a target result in user input information; determining a target keyword index matched with the keyword information from a keyword set of a cache type database, wherein the keyword set comprises one or more keyword indexes, and each keyword index has a corresponding search answer; determining search answers of target time matched with time information in a corresponding time range from an ordered set of a cache type database, wherein the ordered set comprises one or more timestamps and the search answers; and determining a target result according to the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range.
Fig. 1 schematically shows an exemplary system architecture to which the information processing method and the information processing system can be applied according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the system architecture 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired and/or wireless communication links, and so forth.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as a web browser application, a search-type application, a shopping-type application, an instant messaging tool, a mailbox client, and/or social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
It should be noted that the information processing method provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the information processing system provided by the embodiments of the present disclosure may be generally disposed in the server 105. The information processing method provided by the embodiment of the present disclosure may also be executed by a server or a server cluster that is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Accordingly, the information processing system provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the terminal devices 101, 102, 103 and/or the server 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Fig. 2 schematically shows a flow chart of an information processing method according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S210 to S240.
In operation S210, keyword information and time information for a search target result among the user input information are determined.
According to an embodiment of the present disclosure, for example, the user inputs what the meeting related to artificial intelligence in the national meeting center is included for 12 months and 3 days in 2018. The keyword information can be national conference center and artificial intelligence, and the time information can be from 0 to 24 points in 12, 3 and 2018. According to the embodiment of the disclosure, the entity recognition technology can be adopted to extract the keyword and the time period information required by the target result, and then the search condition is constructed according to the input information of the user.
In operation S220, a target keyword index matching the keyword information is determined from a keyword set of the cache type database, where the keyword set includes one or more keyword indexes, and each keyword index has a corresponding search answer.
In operation S230, search answers at a target time matched with the time information within a corresponding time range are determined from an ordered set of the cache type database, where the ordered set includes one or more timestamps and search answers.
According to the embodiment of the disclosure, a cache type database may also be referred to as a Redis database, and the retrieval of the target result may be completed by using APIs of Redis (e.g., elements of keys in an iteration set, intersection solving of the set, union solving of the set, acquisition of data in an ordered set specified range, and the like). A set of keys and an ordered set may be stored in Redis. The keyword set comprises one or more keyword indexes, and the ordered set comprises a plurality of time indexes.
According to the embodiment of the disclosure, in the field of intelligent customer service, specifically, taking user input information as an example of a certain search problem, the data structure of the index in the constructed keyword set and ordered set may be in the following form.
For example, for the data structure of the index in the keyword set, the keyword of the question may be stored as an index into a set different from Redis (key is the name of the index, the index may contain the keyword of the question and/or the category of the question, and is distinguished by a separator, and member is the unique ID of the answer). The index name may be stored in a global set of Redis for fuzzy matching of keyword indices (key is the name of the set, and member is the index name).
For example, for the data structure of the indexes in the ordered sets, the time ranges of the questions (start time, end time, etc., such as 2018, 12/3/0 as start time, and 24 as end time) are stored in zset ordered sets different from Redis (key is the name of the ordered set, score is the time after the type is converted into the question, and member is the answer unique ID).
According to the embodiment of the present disclosure, the answer to the question may also be stored in a global Hash mapping table of Redis (key is the name of the mapping table, field is the unique ID of the question, value is the answer to the question), and when the answer is matched, the answer is searched from the Hash mapping table according to the unique ID of the question.
It should be noted that the information processing method disclosed in the present disclosure may also be applied to the field of search recommendation supporting a time range, and the constructed data structures of the keyword set and the index in the ordered set may be constructed according to the search recommendation related technology, which is not described herein again.
In operation S240, a target result is determined according to the search answer corresponding to the target keyword index and the search answer of the target time within the corresponding time range.
According to the embodiment of the disclosure, an intersection can be taken for the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range, and the search answer obtained after the intersection is taken is used as the target result.
Through the embodiment of the disclosure, the search answers corresponding to different indexes are intersected, so that the accuracy of the search answers can be improved, and more accurate answers can be recommended to improve the user experience.
According to the embodiment of the disclosure, a union set of the search answers corresponding to the target keyword index and the search answers within the corresponding time range of the target time can be obtained, and the search answers obtained after the union set is obtained are used as the target result.
By the embodiment of the disclosure, search answers corresponding to different indexes are merged, so that the number of the search answers can be increased, and more answers can be recommended for the user to select.
In the related art, search answers, search keywords, and time are generally generated in a database table as fields, a relational database is established, and data search is performed. In this case, on the one hand, not only the code needs to be modified when the field needs to be added, but also the query is inefficient. According to the embodiment of the disclosure, because the keyword sets in the cache type database are adopted to store the corresponding keyword indexes, each index has a corresponding search answer, the ordered sets store the search answers with the target time within the corresponding time range, and a technical means of data search within a time period range is supported, the technical problems that the query efficiency is low and the expandability of fields in the database table is poor when the related technology adopts the database table maintained in the relational database to search are at least partially overcome, so that the consistency of data can be ensured, the requirement of data search within the time period range is met, and the technical effect of improving the search efficiency is achieved.
The method shown in fig. 2 is further described with reference to fig. 3-5 in conjunction with specific embodiments.
Fig. 3 schematically illustrates a flowchart for determining a target keyword index matching keyword information from a keyword set of a cached database according to an embodiment of the present disclosure.
As shown in fig. 3, determining a target keyword index matching the keyword information from the keyword set of the cache type database includes operations S221 to S222.
In operation S221, a category of keyword information is determined.
According to the embodiment of the disclosure, the classification of the keyword information can be obtained by using the classification model, one or more keywords are input into the classification model, and the classification of the keyword information is output.
In operation S222, a target keyword index is determined from the keyword set of the cache database according to the category of the keyword information and the keywords in the keyword information.
According to the embodiment of the disclosure, the matching of the keyword index can be performed on the classification of the input information and the keyword list loop execution matching command in the keyword set. Global matching with only keywords can be set for a specific classification.
According to embodiments of the present disclosure, a Sunionstore command union of collections may be performed on the same keyword index on different classifications, and then a Sinter command is performed to take the intersection of all the different keyword index unions.
In the related art, a database table needs to be established independently for each classified input information, so that the management is very complicated and the flexibility is poor. According to the embodiment of the disclosure, the problem retrieval range can be configured through problem classification, and the flexibility is good.
According to the embodiment of the disclosure, after the target result is determined, the target result is sent to the client, so that the client can display the target result and can update the target result to the local memory adopting the least recently used algorithm.
According to the embodiment of the disclosure, a least Recently Used algorithm may also be referred to as L RU (L east RecentlyUsed). L rucche is a local memory that adopts L RU (L east RecentlyUsed) least Recently Used algorithm, and the core idea is that when a cache is full, those least Recently Used cache objects are preferentially eliminated.
Fig. 4 schematically shows a flow chart of an information processing method according to another embodiment of the present disclosure.
As shown in fig. 4, after obtaining the user input information, a search condition including time information and keyword information may be generated, according to an embodiment of the present disclosure, a search result may be first searched in a local cache L RUCache, if the search result exists, the search result is returned to the caller, if the search result does not exist, a corresponding keyword index may be searched in a keyword set for the keyword information, and a search answer within a corresponding time range may be searched in an ordered set for the time information.
According to the embodiment of the disclosure, the search answers corresponding to the keyword indexes and the search answer assembly response results of the target time within the corresponding time range are returned to the caller.
According to the embodiment of the disclosure, the retrieval of the target result can be realized based on a cache type database API, L RUCache is adopted to perform local cache on the target result, and the performance of the system can be greatly improved through the technical architecture of Redis + L RUCache.
Fig. 5 schematically shows a flow chart of an information processing method according to another embodiment of the present disclosure.
As shown in fig. 5, the method includes operations S250 to S260.
In operation S250, an add operation is acquired.
In operation S260, in response to the adding operation, a corresponding index is added in the keyword set.
In the related art, search answers, search keywords and time are generally generated in a database table as fields, and a relational database is established. According to the embodiment of the disclosure, the keyword set or the ordered set in the cache database can be expanded in consideration of the uncertainty of user input, so that the method is more suitable for user search and improves the retrieval efficiency. Compared with the traditional solution, the method has the advantages of greatly improving the performance, expansibility, manageability, flexibility and the like, and supporting the linear expansion of the index columns.
FIG. 6 schematically shows a block diagram of an information handling system according to an embodiment of the disclosure.
As shown in fig. 6, the information processing system 400 includes a first determination module 410, a first matching module 420, a second matching module 430, and a second determination module 440.
The first determining module 410 is used for determining keyword information and time information for searching the target result in the user input information.
The first matching module 420 is configured to determine a target keyword index matching the keyword information from a keyword set of the cached database, where the keyword set includes one or more keyword indexes, and each keyword index has a corresponding search answer.
The second matching module 430 determines search answers of the target time matched with the time information in the corresponding time range from an ordered set of the cache type database, wherein the ordered set comprises one or more time stamps and the search answers.
The second determining module 440 is configured to determine a target result according to the search answer corresponding to the target keyword index and the search answer within the corresponding time range of the target time.
Through the embodiment of the disclosure, because the technical means that the keyword sets in the cache type database store the corresponding keyword indexes, each index has the corresponding search answer, the ordered sets store the search answers of the target time in the corresponding time range, and the data search in a time period range is supported is adopted, the technical problems that the query efficiency is low and the expandability of fields in the database table is poor when the database table maintained in the relational database is adopted for searching in the related technology are at least partially overcome, so that the consistency of data can be ensured, the requirement of the data search in the time period range is met, and the search efficiency is improved are achieved.
According to the embodiment of the present disclosure, the second determining module 440 is configured to take an intersection of the search answer corresponding to the target keyword index and the search answer within the corresponding time range of the target time, and use the search answer obtained after taking the intersection as the target result.
Through the embodiment of the disclosure, the search answers corresponding to different indexes are intersected, so that the accuracy of the search answers can be improved, and more accurate answers can be recommended to improve the user experience.
Fig. 7 schematically illustrates a block diagram of a first matching module according to an embodiment of the present disclosure.
As shown in fig. 7, the first matching module 420 includes a first determining unit 421 and a second determining unit 422.
The first determining unit 421 is configured to determine a category of the keyword information.
The second determining unit 422 is configured to determine the target keyword index from the keyword set of the cache type database according to the category of the keyword information and the keyword in the keyword information.
According to the embodiment of the disclosure, the problem retrieval range can be configured through problem classification, and the flexibility is good.
FIG. 8 schematically shows a block diagram of an information handling system according to another embodiment of the present disclosure.
As shown in fig. 8, information handling system 400 also includes a sending module 450.
The sending module 450 is configured to send the target result to the client after determining the target result, so that the client can display the target result and update the target result to the local memory adopting the least recently used algorithm.
According to the embodiment of the disclosure, a least Recently Used algorithm may also be referred to as L RU (L east RecentlyUsed). L rucche is a local memory that adopts L RU (L east RecentlyUsed) least Recently Used algorithm, and the core idea is that when a cache is full, those least Recently Used cache objects are preferentially eliminated.
According to the embodiment of the disclosure, the retrieval of the target result can be realized based on a cache type database API, L RUCache is adopted to perform local cache on the target result, and the performance of the system can be greatly improved through the technical architecture of Redis + L RUCache.
According to an embodiment of the present disclosure, as shown in fig. 8, the information processing system 400 further includes an acquisition module 460 and a response module 470.
The obtaining module 460 is used for obtaining the adding operation.
The response module 470 is used to add the corresponding index in the keyword set in response to the add operation.
According to the embodiment of the disclosure, the keyword set or the ordered set in the cache database can be expanded in consideration of the uncertainty of user input, so that the method is more suitable for user search and improves the retrieval efficiency. Compared with the traditional solution, the method has the advantages of greatly improving the performance, expansibility, manageability, flexibility and the like, and supporting the linear expansion of the index columns.
Any one or more of the modules, sub-modules, units, sub-units, or sub-units according to embodiments of the present disclosure may be implemented at least in part as hardware circuitry, e.g., a Field Programmable Gate Array (FPGA), a programmable logic array (P L a), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or any other reasonable manner of integrating or packaging circuitry, or in any one of or a suitable combination of software, hardware, and firmware.
For example, any of the first determining module 410, the first matching module 420, the second matching module 430, the second determining module 440, the sending module 450, the obtaining module 460, and the responding module 470, the first determining unit 421, and the second determining unit 422 may be combined and implemented in one module/unit/sub-unit, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units, or at least some of the functions of one or more of these modules/units/sub-units may be combined with at least some of the functions of the other modules/units/sub-units and implemented in one module/unit/sub-unit according to the embodiments of the present disclosure, at least one of the first determining module 410, the first matching module 420, the second matching module 430, the second determining module 440, the sending module 450, the obtaining module 460, and the responding module 470, the first determining unit 421, and the second determining unit 422 may be implemented at least partially as hardware circuits, for example, when the first determining module 410, the first matching module 420, the second matching module 430, the second determining module 440, the sending module 450, the obtaining module 460, the first determining unit 421, the second determining unit 422, the field programmable system may be implemented as a field programmable computer system, or any combination of the field programmable system, wherein the first determining module may be implemented as a or any one of the field programmable system, or any combination of the field programmable system, or any of the field programmable system.
It should be noted that, the information processing system part in the embodiment of the present disclosure corresponds to the information processing method part in the embodiment of the present disclosure, and the description of the information processing system part specifically refers to the information processing method part, which is not described herein again.
According to an embodiment of the present disclosure, a computer system includes: one or more processors; a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the information processing method of the embodiments of the present disclosure.
FIG. 9 schematically shows a block diagram of a computer system suitable for implementing the above described method according to an embodiment of the present disclosure. The computer system illustrated in FIG. 9 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 9, a computer system 500 according to an embodiment of the present disclosure includes a processor 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 503, various programs and data necessary for the operation of the system 500 are stored. The processor 501, the ROM 502, and the RAM 503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 502 and/or the RAM 503. Note that the programs may also be stored in one or more memories other than the ROM 502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to AN embodiment of the present disclosure, the system 500 may further include AN input/output (I/O) interface 505, the input/output (I/O) interface 505 also being connected to the bus 504. the system 500 may further include one or more of AN input section 506 including a keyboard, a mouse, and the like, AN output section 507 including a Cathode Ray Tube (CRT), a liquid crystal display (L CD), and the like, and a speaker, and the like, a storage section 508 including a hard disk, and the like, and a communication section 509 including a network interface card such as a L AN card, a modem, and the like, the communication section 509 performs communication processing via a network such as the Internet, the drive 510 is also connected to the I/O interface 505 as necessary, a removable medium 511 such as a magnetic disk, AN optical disk, a magneto-optical disk, a semiconductor memory, and the like, is mounted on the drive 510 as necessary, so that a computer program read therefrom is mounted into the storage section 508 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM 502 and/or RAM 503 and/or one or more memories other than ROM 502 and RAM 503 described above.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (12)
1. An information processing method comprising:
determining keyword information and time information used for searching a target result in user input information;
determining a target keyword index matched with the keyword information from a keyword set of a cache type database, wherein the keyword set comprises one or more keyword indexes, and each keyword index has a corresponding search answer;
determining search answers of target time matched with the time information in a corresponding time range from an ordered set of the cache type database, wherein the ordered set comprises one or more time stamps and the search answers; and
and determining the target result according to the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range.
2. The method of claim 1, wherein determining the target result according to the search answer corresponding to the target keyword index and the search answer of the target time within the corresponding time range comprises:
and taking an intersection of the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range, and taking the search answer obtained after the intersection is taken as the target result.
3. The method of claim 1, wherein determining a target keyword index from a set of keywords in a cached database that matches the keyword information comprises:
determining a category of the keyword information; and
and determining the target keyword index from the keyword set of the cache type database according to the category of the keyword information and the keywords in the keyword information.
4. The method of claim 1, wherein after determining the target outcome, the method further comprises:
and sending the target result to a client so that the client can display the target result and update the target result to a local memory adopting a least recently used algorithm.
5. The method of claim 1, wherein the method further comprises:
acquiring an adding operation; and
in response to the add operation, adding a corresponding index in the set of keywords.
6. An information processing system comprising:
the first determining module is used for determining keyword information and time information used for searching a target result in the user input information;
the first matching module is used for determining a target keyword index matched with the keyword information from a keyword set of a cache type database, wherein the keyword set comprises one or more keyword indexes, and each keyword index has a corresponding search answer;
the second matching module is used for determining search answers of target time matched with the time information in a corresponding time range from an ordered set of the cache type database, wherein the ordered set comprises one or more timestamps and the search answers; and
and the second determining module is used for determining the target result according to the search answer corresponding to the target keyword index and the search answer of the target time in the corresponding time range.
7. The system according to claim 6, wherein the second determining module is configured to intersect the search answer corresponding to the target keyword index and the search answer within the corresponding time range at the target time, and use the search answer obtained after intersection as the target result.
8. The system of claim 6, wherein the first matching module comprises:
a first determination unit configured to determine a category of the keyword information; and
and the second determining unit is used for determining the target keyword index from the keyword set of the cache type database according to the category of the keyword information and the keywords in the keyword information.
9. The system of claim 6, wherein the system further comprises:
and the sending module is used for sending the target result to a client after the target result is determined so that the client can display the target result and update the target result to a local memory adopting a least recently used algorithm.
10. The system of claim 6, wherein the system further comprises:
the acquisition module is used for acquiring the adding operation; and
and the response module is used for responding to the adding operation and adding the corresponding index in the keyword set.
11. A computer system, comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the information processing method of any one of claims 1 to 5.
12. A computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to implement the information processing method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910038018.3A CN111435376A (en) | 2019-01-15 | 2019-01-15 | Information processing method and system, computer system, and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910038018.3A CN111435376A (en) | 2019-01-15 | 2019-01-15 | Information processing method and system, computer system, and computer-readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111435376A true CN111435376A (en) | 2020-07-21 |
Family
ID=71580859
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910038018.3A Pending CN111435376A (en) | 2019-01-15 | 2019-01-15 | Information processing method and system, computer system, and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111435376A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112286970A (en) * | 2020-10-30 | 2021-01-29 | 领扣网络(上海)有限公司 | Information processing method, system, computer device and computer readable storage medium |
| CN113779058A (en) * | 2020-10-16 | 2021-12-10 | 北京京东振世信息技术有限公司 | Method, device, equipment and computer readable medium for acquiring service data |
| CN114201573A (en) * | 2020-09-02 | 2022-03-18 | 萃弈公司 | System and method for generating and querying an index associated with a target communication |
| CN114661722A (en) * | 2022-03-23 | 2022-06-24 | 天津同阳科技发展有限公司 | Data storage method, data indexing method and device |
| CN116150456A (en) * | 2023-04-18 | 2023-05-23 | 中信天津金融科技服务有限公司 | Intelligent archive management method, device, electronic equipment and medium |
| CN112286970B (en) * | 2020-10-30 | 2024-04-26 | 领扣网络(上海)有限公司 | Information processing method, system, computer device and computer readable storage medium |
-
2019
- 2019-01-15 CN CN201910038018.3A patent/CN111435376A/en active Pending
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114201573A (en) * | 2020-09-02 | 2022-03-18 | 萃弈公司 | System and method for generating and querying an index associated with a target communication |
| CN114201573B (en) * | 2020-09-02 | 2024-02-02 | 萃弈公司 | System and method for generating and querying an index associated with a target communication |
| CN113779058A (en) * | 2020-10-16 | 2021-12-10 | 北京京东振世信息技术有限公司 | Method, device, equipment and computer readable medium for acquiring service data |
| CN112286970A (en) * | 2020-10-30 | 2021-01-29 | 领扣网络(上海)有限公司 | Information processing method, system, computer device and computer readable storage medium |
| CN112286970B (en) * | 2020-10-30 | 2024-04-26 | 领扣网络(上海)有限公司 | Information processing method, system, computer device and computer readable storage medium |
| CN114661722A (en) * | 2022-03-23 | 2022-06-24 | 天津同阳科技发展有限公司 | Data storage method, data indexing method and device |
| CN116150456A (en) * | 2023-04-18 | 2023-05-23 | 中信天津金融科技服务有限公司 | Intelligent archive management method, device, electronic equipment and medium |
| CN116150456B (en) * | 2023-04-18 | 2023-08-11 | 中信天津金融科技服务有限公司 | Intelligent archive management method, device, electronic equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111435376A (en) | Information processing method and system, computer system, and computer-readable storage medium | |
| CN109614402B (en) | Multidimensional data query method and device | |
| CN108897874B (en) | Method and apparatus for processing data | |
| CN111522927B (en) | Entity query method and device based on knowledge graph | |
| CN111046237B (en) | User behavior data processing method and device, electronic equipment and readable medium | |
| US9754015B2 (en) | Feature rich view of an entity subgraph | |
| CN111427971A (en) | Business modeling method, device, system and medium for computer system | |
| CN110059172B (en) | Method and device for recommending answers based on natural language understanding | |
| CN115168398A (en) | Data query method and device, electronic equipment and storage medium | |
| JP7213890B2 (en) | Accelerated large-scale similarity computation | |
| CN107256244B (en) | Data processing method and system | |
| US20190258736A1 (en) | Dynamic Execution of ETL Jobs Without Metadata Repository | |
| US11042706B2 (en) | Natural language skill generation for digital assistants | |
| CN109657129B (en) | Method and device for acquiring information | |
| CN110647623B (en) | Method and device for updating information | |
| CN113010666A (en) | Abstract generation method, device, computer system and readable storage medium | |
| CN111339124A (en) | Data display method and device, electronic equipment and computer readable medium | |
| CN110598133A (en) | Method, apparatus, electronic device, and computer-readable storage medium for determining an order of search items | |
| CN111539208B (en) | Sentence processing method and device, electronic device and readable storage medium | |
| CN110619093B (en) | Method, apparatus, electronic device, and computer-readable storage medium for determining an order of search items | |
| CN113821581A (en) | Information recommendation method, device, computer system and computer-readable storage medium | |
| CN113342646A (en) | Use case generation method, apparatus, electronic device and medium | |
| CN113868383A (en) | Question answering method and device executed by electronic equipment | |
| CN114579616A (en) | Information query method, device, equipment and medium | |
| JP2023544024A (en) | Systems and methods for matching into composite data sets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |