CN111259049A

CN111259049A - Information query method, information query device and terminal equipment

Info

Publication number: CN111259049A
Application number: CN202010054756.XA
Authority: CN
Inventors: 郑榕俊
Original assignee: Ping An Life Insurance Company of China Ltd
Current assignee: Ping An Life Insurance Company of China Ltd
Priority date: 2020-01-17
Filing date: 2020-01-17
Publication date: 2020-06-09

Abstract

The information query method provided by the application comprises the following steps: determining and storing a storage position corresponding to each preset label in a preset storage space of the valley laying filter based on at least one first hash function in the first hash function set; associating the cuckoo filter with a preset service; if the preset service is determined to obtain a query request about an element to be queried, obtaining a first label corresponding to the element to be queried through a second hash function; based on the preset service, inquiring whether a preset label which is the same as the first label is stored in the preset storage space through the valley filter; and if the preset storage space stores a preset label which is the same as the first label, inquiring whether target information about the element to be inquired is stored in a cache or not. By the method, the problem that some malicious query requests influence normal query of the database can be solved.

Description

Information query method, information query device and terminal equipment

Technical Field

The present application belongs to the field of information query technologies, and in particular, relates to an information query method, an information query apparatus, a terminal device, and a computer-readable storage medium.

Background

When a database is queried, cache queries are often performed first to improve the query efficiency. And if the corresponding elements do not exist or are expired in the cache query, querying the database.

However, some requesters requesting queries, such as malicious requesters, may intentionally make a large number of repeated requests for elements not in the cache of some databases, which results in the requests all being concentrated in the databases, and thus causes the database to be down (i.e. the cache is broken down), which affects the normal queries on the databases.

Disclosure of Invention

The embodiment of the application provides an information query method, an information query device, a terminal device and a computer readable storage medium, which can solve the problem that the normal query of a database is influenced by performing a large amount of repeated queries on elements which are not in a cache of the database so that all the queries are concentrated in the database.

In a first aspect, an embodiment of the present application provides an information query method, including:

determining a corresponding storage position of each preset label in a preset storage space of a valley laying filter and storing the storage position based on at least one first hash function in a first hash function set, wherein the first hash function set comprises at least two first hash functions, the first hash functions are different and mutually associated, and for any preset label, the storage positions of the preset labels in the preset storage space of the valley laying filter, which are obtained based on each first hash function, are different;

associating the valley distribution filter with a preset service to enable the preset service to invoke the valley distribution filter;

if the preset service is determined to obtain a query request about an element to be queried, obtaining a first label corresponding to the element to be queried through a second hash function;

based on the preset service, inquiring whether a preset label which is the same as the first label is stored in the preset storage space through the valley filter;

and if the preset storage space stores a preset label which is the same as the first label, inquiring whether target information about the element to be inquired is stored in a cache or not.

In a second aspect, an embodiment of the present application provides an information query apparatus, including:

the storage module is used for determining and storing a corresponding storage position of each preset label in a preset storage space of the valley laying filter based on at least one first hash function in a first hash function set, wherein the first hash function set comprises at least two first hash functions, the first hash functions are different and mutually associated, and for any preset label, the storage positions of the preset labels in the preset storage space of the valley laying filter, which are obtained based on each first hash function, are different;

a setting module, configured to associate the valley distribution filter with a preset service, so that the preset service can invoke the valley distribution filter;

the processing module is used for obtaining a first label corresponding to an element to be queried through a second hash function if the preset service is determined to obtain a query request about the element to be queried;

the first query module is used for querying whether a preset label which is the same as the first label is stored in the preset storage space through the valley distribution filter based on the preset service;

and the second query module is used for querying whether target information about the element to be queried is stored in a cache if the preset storage space stores a preset tag which is the same as the first tag.

In a third aspect, an embodiment of the present application provides a terminal device, which includes a memory, a processor, a display, and a computer program stored in the memory and executable on the processor, where the processor implements the information query method according to the first aspect when executing the computer program.

In a fourth aspect, the present application provides a computer-readable storage medium, where a computer program is stored, and when executed by a processor, the computer program implements the information query method according to the first aspect.

In a fifth aspect, an embodiment of the present application provides a computer program product, which, when running on a terminal device, causes the terminal device to execute the information query method described in the first aspect.

Compared with the prior art, the embodiment of the application has the advantages that: in this embodiment of the application, a corresponding storage location of each preset label in a preset storage space of a valley distribution filter may be determined and stored based on at least one first hash function in a first hash function set, where the first hash function set includes at least two first hash functions, so that each preset label may have multiple corresponding storage locations in the preset storage space of the valley distribution filter through multiple first hash functions, and one of the storage locations is selected to store the preset label; and the first hash functions are different and associated with each other, so that in practical application, the storage positions corresponding to other first hash functions can be obtained according to the storage position corresponding to one of the first hash functions, and therefore, under some circumstances, a plurality of storage positions corresponding to the preset label can be quickly found through one first hash function, and one storage position capable of storing among the plurality of storage positions can be determined. In addition, because the framework and the programming language adopted by the valley laying filter may be different from the object (such as various applications) sending the query request, the valley laying filter is associated with a preset service so that the preset service can call the valley laying filter, and the problem that the framework and the programming language adopted by the valley laying filter are different from the object sending the query request can be solved, so that the valley laying filter can be called for various objects sending the query request through the preset service to carry out query, the requirements of various application scenes are met, and the universality of the valley laying filter is greatly improved. If the preset storage space stores the preset tag which is the same as the first tag, whether the target information of the element to be queried is stored in the query cache or not is judged, at the moment, the element to be queried can be filtered through the valley distribution filter, only effective query content is subjected to subsequent query on the cache and even the database, and therefore the situations of cache breakdown and the like are avoided, and normal use of the database is maintained.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.

Fig. 1 is a schematic flowchart of a first information query method according to an embodiment of the present application;

fig. 2 is a schematic flowchart of a second information query method according to an embodiment of the present application;

fig. 3 is a schematic structural diagram corresponding to an information query method according to an embodiment of the present application;

fig. 4 is a schematic structural diagram of an information query apparatus according to an embodiment of the present application;

fig. 5 is a schematic structural diagram of a terminal device according to an embodiment of the present application.

Detailed Description

In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.

It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

It should also be understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.

As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to" determining "or" in response to detecting ". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".

Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless expressly specified otherwise.

Specifically, fig. 1 shows a flowchart of a first information query method provided in an embodiment of the present application, where the information query method may be applied to a terminal device.

In the embodiment of the present application, the types of the terminal devices may be various. For example, the terminal device may be a server, a mobile phone, a tablet Computer, a wearable device, an in-vehicle device, an Augmented Reality (AR)/Virtual Reality (VR) device, a notebook Computer, an Ultra-mobile Personal Computer (UMPC), a netbook, a Personal Digital Assistant (PDA), and the like. The embodiments of the present application are not limited to the specific types of the terminal devices.

In an application scenario, the terminal device may implement the information query method of the present application through a specific software module. The specific software module of the terminal device may include a module for implementing the function of the valley laying filter and a module for implementing the function of the preset service. The specific software module may be implemented by one or more programming languages, wherein different programming languages may be employed in implementing different functions in the specific software module. For example, the module for implementing the function of the valley filter may be implemented by a go language, and the module for implementing the function of the preset service may be implemented by a Java language.

In addition, the specific software module may also be used to implement other functions, and the terminal device may also include other software modules, which are not limited herein.

For example, in some embodiments, the terminal device may further include a software module that implements at least one of a function of a service registry, a function of a target gateway, a function of a gateway, and a function of other business systems, so that functions involved in some embodiments of the information query method, such as acquiring an address of a preset service, verifying validity of a source of a query request, and the like, may be implemented. Of course, in some embodiments, the functions of the service registration center, the target gateway, the gateway, and other service systems described above may also be implemented on other terminals besides the terminal device, in which case, the other terminals may perform information transmission with the terminal device through a specified information transmission manner (such as a wired transmission manner or a wireless transmission manner).

The information query method comprises the following steps:

step S101, determining and storing a corresponding storage position of each preset label in a preset storage space of the valley laying filter based on at least one first hash function in a first hash function set, wherein the first hash function set comprises at least two first hash functions, the first hash functions are different and mutually associated, and for any preset label, the storage positions of the preset labels in the preset storage space of the valley laying filter obtained based on each first hash function are different.

In the embodiment of the present application, the Hash Function is also called a Hash Function (Hash Function), and is used to calculate a storage address corresponding to an element to be stored. The first hash function is used for determining the storage position of each preset label in the preset storage space of the valley laying filter. For example, the first hash function may be a function based on a hash algorithm such as MD5, SHA1, MD4, and the like. The preset tag may represent a corresponding preset element. In some embodiments, the preset tag may be obtained by calculating a preset element through a preset hash function. Illustratively, the preset elements may include, for example, websites, phone numbers, mailboxes, words, and the like. By presetting the preset elements, a white list or a black list of websites, telephone numbers, mailboxes and the like can be obtained, and a correct word list and the like can also be obtained. The preset label is called a fingerprint of a corresponding preset element, wherein the fingerprint is a digital fingerprint and is an identifier of a certain file or element generated based on a hash function. Generally, the size of the preset tag is smaller than that of the preset element, so that the preset tag is stored in the preset storage space instead of the corresponding preset element, storage resources can be saved, and space efficiency can be improved.

It should be noted that, in some embodiments, for the preset hash function, the preset labels corresponding to different preset elements may be the same, and therefore, in practical applications, there may be a certain misjudgment rate, but by selecting a suitable hash function and a certain optimization, the misjudgment rate may be reduced to a reasonable range without affecting the normal use of the database,

in the embodiment of the present application, the Cuckoo Filter is also called Cuckoo Filter. The specific structure of the valley distribution filter can be selected and optimized according to the actual application scene. In practical use, the storage locations of different preset labels obtained by the first hash function may be the same. Therefore, in this embodiment of the application, the first hash function set of the valley distribution filter may include at least two first hash functions, so that at least two corresponding storable positions of the preset tag in the preset storage space may be obtained, and for any preset tag, the storage positions of the preset tag in the preset storage space of the valley distribution filter, which are obtained based on each first hash function, are different.

In the embodiment of the application, for any preset tag, the storage location for storing the preset tag may be one or multiple. Generally speaking, any one of the preset tags only needs to be stored in a corresponding storage location, and at this time, other preset tags may not be stored in other storage locations corresponding to the preset tags, and other preset tags may also be stored in the other storage locations corresponding to the preset tags, and the storage locations obtained by the other preset tags through the first hash function are the same as the storage location of the preset tag. Therefore, the determining and storing the storage location corresponding to each preset tag in the preset storage space of the valley laying filter may include determining a plurality of storable locations corresponding to each preset tag in the preset storage space of the valley laying filter, and for any preset tag, selecting one storage location with empty storage content in the plurality of storable locations corresponding to the preset tag for storing; in addition, a storable position corresponding to each preset tag in the preset storage space of the valley laying filter can be determined through one first hash function, whether the storage content of the storable position is empty is judged, if the storable position is empty, the storable position is used as the storage position for storage, and if the storable position is not empty, one storable position corresponding to each preset tag in the preset storage space of the valley laying filter is determined through another first hash function until the storage content in the plurality of storable positions corresponding to the preset tags is determined to be the empty storage position for storage.

In some embodiments, if none of the plurality of storable positions corresponding to the preset tag is empty for a certain preset tag, one storable position corresponding to the preset tag may be selected, and a replacement storage operation related to the preset tag may be performed, where the replacement storage operation related to the preset tag may enable the preset tag to replace other preset tags stored in the storage position in advance for storage; and for the other replaced preset tags, calculating other storable positions of the other preset tags in the preset storage space of the valley distribution filter, selecting one storage position with empty storage contents in the plurality of storable positions corresponding to the other preset tags for storage, or performing replacement storage operation on the other preset tags until the number of times of the replacement storage operation reaches a preset number threshold, and considering that the preset storage space of the valley distribution filter is insufficient, so as to expand the preset storage space, wherein the expansion degree can be determined by an actual application scene.

In the embodiment of the present application, the first hash functions are associated with each other, and therefore, the storage locations corresponding to the first hash functions are also associated with each other. The first hash functions may be associated with one another in a plurality of ways, and for example, the first hash function set may include two first hash functions, where the two first hash functions are set in the following ways:

p1＝hash(key)

p2＝p1 xorhash(f(key))

where p1 is a first hash function, p2 is another first hash function, the key is any preset tag, and f (key) is processing the preset tag through a preset function, for example, f (key) fingerprint (key), and at this time, the fingerprint (key) may be a fingerprint corresponding to the preset tag. The xor is an exclusive or operation. At this time, the two corresponding storage locations of the preset tag may be found through one of the first hash functions. Of course, the specific setting manner of the first hash functions may also be other manners that enable the first hash functions to be different and associated with each other, which is not limited herein.

Step S102, associating the valley laying filter with a preset service so that the preset service can call the valley laying filter.

In the embodiment of the present application, the programming language adopted by the valley placement filter is often different from an object (such as various applications) that issues a query request, for example, the valley placement filter may be written in a go language, and query requests of various applications, such as a browser, an application program, a preset platform, and the like, are implemented in a Java language, so in the embodiment of the present application, the valley placement filter may be associated with a preset service, so that the preset service can invoke the valley placement filter. The preset service may be, for example, DaemonSet or Sidecar. For example, the preset service may be a sidacr, which is a micro service, and the application function may be separated from the application as a separate process. Multiple functions can be added to the application non-invasively by the Sidecar. In an embodiment of the present application, the preset service can call the valley fill filter for an application having a programming language different from the valley fill filter.

Because the framework and the programming language adopted by the valley laying filter may be different from the object (such as various applications) sending the query request, the valley laying filter is associated with the preset service, so that the preset service can call the valley laying filter, the problem that the framework and the programming language adopted by the valley laying filter are different from the object sending the query request can be solved, the valley laying filter can be called for various objects sending the query request through the preset service to carry out query, the requirements of various application scenes are met, and the universality of the valley laying filter is greatly improved.

Step S103, if it is determined that the preset service acquires the query request about the element to be queried, a first label corresponding to the element to be queried is obtained through a second hash function.

In this embodiment of the application, the element to be queried may be all of the content to be queried or an identifier of the content to be queried (e.g., an id, a name, a number, and the like of the content to be queried). The specific form of the element to be queried can be various. For example, in one embodiment, the element to be queried may be a key (key) in a database query, and in practical applications, the type of the key may be various and may be determined according to practical requirements. For example, the Keys may include Candidate Keys (Candidate Keys), Primary Keys (Primary Keys), secondary Keys (minor) Keys, super Keys (superkeys), Foreign Keys (Foreign Keys), and the like.

In the embodiment of the present application, for example, the second hash function may be a function based on a hash algorithm such as MD5, SHA1, MD4, or the like. In some embodiments, the preset tag may be obtained by calculating a preset element through a preset hash function, and at this time, the second hash function may be the same as the preset hash function. Also, in some embodiments, the first tag may be a fingerprint of the element to be queried. The fingerprint is a digital fingerprint and is an identifier of a certain file or element generated based on a hash function.

Step S104, based on the preset service, inquiring whether a preset label which is the same as the first label is stored in the preset storage space through the valley laying filter.

In an embodiment of the application, the preset service calls the valley laying filter to inquire whether a preset tag identical to the first tag is stored in the preset storage space. Specifically, it may be determined that, based on at least one first hash function in the first hash function set, a first storage location corresponding to the first tag in a preset storage space of the valley laying filter is calculated, and then it is queried whether each first storage location stores a preset tag that is the same as the first tag.

Optionally, in some embodiments, based on at least one first hash function in the first hash function set, at least one first storage location corresponding to the first label in a preset storage space of the valley laying filter is calculated;

based on the preset service, whether preset tags which are the same as the first tags are stored in the first storage positions or not is inquired through the valley laying filter until the first storage positions corresponding to the first tags are traversed, or until the preset tags which are the same as the first tags are stored in the preset storage space is determined.

In the embodiment of the application, the number of the first storage locations obtained by calculation may be determined according to an actual application scenario. For example, if the same preset tag as the first tag is stored in the first calculated first storage location, only one first storage location needs to be calculated. And if the preset tag which is the same as the first tag is not stored in each first storage position after traversing each first storage position corresponding to the first tag, the first tag can be regarded as an invalid tag.

Step S105, if the preset storage space stores a preset tag that is the same as the first tag, querying whether target information about the element to be queried is stored in a cache.

In this embodiment of the application, if the preset storage space stores a preset tag that is the same as the first tag, the first tag may be considered as an effective tag, that is, the to-be-queried element corresponding to the first tag is effective to-be-queried content, so that further query may be performed in the cache or even the database.

In this embodiment of the application, the element to be queried may be an identifier of the target information, and of course, may also be the target information itself. When the element to be queried is the identifier of the target information, the element to be queried may be an ID, a name, a number, and the like of the target information, so as to uniquely identify the target information, and at this time, the target information identified by the element to be queried may be obtained through querying.

In some embodiments, after whether target information about the element to be queried is stored in the query cache, the method further includes:

and if the target information about the element to be inquired is not stored in the cache, inquiring the target information about the element to be inquired from a database.

And if the target information about the element to be queried is stored in the cache, acquiring the target information about the element to be queried in the cache.

In the embodiment of the application, if the target information about the element to be queried is queried in the database, the target information about the element to be queried can be stored in the cache, so that subsequent quick query is facilitated, and query pressure of the database is relieved.

In some embodiments, the cache may store content queried from the database in a specified time period or a specified operation cycle before the current time; of course, the cache may also include other content, such as high frequency query content to the database. The high frequency query content may be content with a query frequency higher than a preset frequency.

In some embodiments, the information query method further includes:

and if the first label does not have a corresponding storage position in the preset storage space, determining that the first label is an invalid label.

In the embodiment of the present application, if the first tag is an invalid tag, it is not necessary to further query whether target information about the element to be queried is stored in a cache, and an indication instruction indicating that the first tag is an invalid tag may be returned, and at this time, some invalid query contents may be filtered out by the valley laying filter, so that a large number of repeated query requests for the cache and even the database by the invalid query contents are avoided.

In some embodiments, the determining and storing the storage location, corresponding to each preset label, in the preset storage space of the valley laying filter based on at least one first hash function in the first hash function set includes:

determining the category of each preset label;

dividing a preset storage space of a valley filter to enable the preset storage space to comprise at least one sub-storage space, wherein each sub-storage space corresponds to one category;

determining and storing the storage position of each preset label in the corresponding sub-storage space based on at least one first hash function in the first hash function set;

if it is determined that the preset service obtains the query request about the element to be queried, obtaining a first label corresponding to the element to be queried through a second hash function, including:

if the preset service is determined to acquire a query request about an element to be queried, determining the category of the element to be queried;

determining a second hash function corresponding to the element to be queried according to the category of the element to be queried, wherein different categories correspond to different second hash functions;

obtaining a first label corresponding to the element to be queried through the corresponding second hash function;

the querying, based on the preset service, whether a preset tag identical to the first tag is stored in the preset storage space through the valley fill filter includes:

determining a sub-storage space corresponding to the element to be queried in the preset storage space according to the category of the element to be queried;

and inquiring whether a preset label which is the same as the first label is stored in the sub-storage space or not through the valley filter based on the preset service.

In this embodiment of the application, generally, the preset label may be obtained by calculating a preset element through a preset hash function. Therefore, the category of the preset tag may be determined according to the category of the preset element corresponding to the preset tag. The category may be determined according to an actual application scenario, for example, the category may include a web address, a phone number, a mailbox, and the like. Because the performance of different preset hash functions when calculating different types of data may differ according to the type, the preset hash functions corresponding to different types of preset labels may differ. Since the second hash function may be the same as the preset hash function, there may be a plurality of second hash functions. At this time, different second hash functions may be selected according to the category of the element to be queried, and a sub-storage space corresponding to the element to be queried in the preset storage space is determined according to the category of the element to be queried.

Different second hash functions and sub-storage spaces are adopted according to different categories, different elements can be stored and inquired in a more targeted mode, the probability that storage positions corresponding to different labels are the same is reduced, the error rate is reduced, and the inquiry efficiency is improved.

In the embodiment of the application, as the elements to be queried of different categories can be processed based on different second hash functions and queried in different sub-storage spaces, in some embodiments, after the category of the elements to be queried is determined, parallel query can be performed on the elements to be queried of different categories in subsequent processing, so that the query speed and the query efficiency are improved.

In this embodiment of the application, a corresponding storage location of each preset label in a preset storage space of a valley distribution filter may be determined and stored based on at least one first hash function in a first hash function set, where the first hash function set includes at least two first hash functions, so that each preset label may have multiple corresponding storage locations in the preset storage space of the valley distribution filter through multiple first hash functions, and one of the storage locations is selected to store the preset label; and the first hash functions are different and associated with each other, so that in practical application, the storage positions corresponding to other first hash functions can be obtained according to the storage position corresponding to one of the first hash functions, and therefore, under some circumstances, a plurality of storage positions corresponding to the preset label can be quickly found through one first hash function, and one storage position capable of storing among the plurality of storage positions can be determined. In addition, because the framework and the programming language adopted by the valley laying filter may be different from the object (such as various applications) sending the query request, the valley laying filter is associated with a preset service so that the preset service can call the valley laying filter, and the problem that the framework and the programming language adopted by the valley laying filter are different from the object sending the query request can be solved, so that the valley laying filter can be called for various objects sending the query request through the preset service to carry out query, the requirements of various application scenes are met, and the universality of the valley laying filter is greatly improved. If the preset storage space stores the preset tag which is the same as the first tag, whether the target information of the element to be queried is stored in the query cache or not is judged, at the moment, the element to be queried can be filtered through the valley distribution filter, only effective query content is subjected to subsequent query on the cache and even the database, and therefore the situations of cache breakdown and the like are avoided, and normal use of the database is maintained.

On the basis of the foregoing embodiments, fig. 2 shows a flowchart of a second information query method provided in the embodiments of the present application.

The information query method comprises the following steps:

step S201, determining a corresponding storage location of each preset label in a preset storage space of the valley distribution filter based on at least one first hash function in a first hash function set, and storing the storage location, wherein the first hash function set includes at least two first hash functions, the first hash functions are different and associated with each other, and for any preset label, the storage locations of the preset labels in the preset storage space of the valley distribution filter obtained based on each first hash function are different.

Step S202, associating the valley laying filter with a preset service so that the preset service can call the valley laying filter.

Step S203, if it is determined that the preset service acquires the query request about the element to be queried from the target gateway, obtaining a first label corresponding to the element to be queried through a second hash function.

In this embodiment of the Application, the target gateway may be an Application Programming Interface (API) gateway of a micro service architecture provided in a system of a terminal device. Illustratively, the target gateway may be Zuul or the like in Spring Cloud. Generally, requests (e.g., query requests) obtained from devices, websites, etc. require authentication through the target gateway.

In some embodiments, the target gateway may obtain the address of the preset service in advance, so as to send a query request about an element to be queried to the preset service. The registration service center may provide a list of services available for invocation, where the information may include an address of the preset service.

Step S204, based on the preset service, inquiring whether a preset label which is the same as the first label is stored in the preset storage space through the valley distribution filter.

Step S205, if the preset storage space stores a preset tag that is the same as the first tag, querying whether target information about the element to be queried is stored in a cache.

Steps S201, S202, S204 and S205 of this embodiment are the same as or similar to steps S101, S102, S104 and S105 described above, and are not repeated here.

In some embodiments, if it is determined that the preset service acquires the query request for the element to be queried from the target gateway, obtaining the first tag corresponding to the element to be queried through a second hash function includes:

if it is determined that the preset service receives a query request about an element to be queried, which is sent to the preset service by the target gateway according to the address of the preset service acquired from a service registration center, the first label corresponding to the element to be queried is obtained through a second hash function, wherein the preset service and the target gateway are registered in the service registration center.

In the embodiment of the present application, the service registry may provide a service list for calling, and the service list may include addresses of each service provider. When the device, the website, the application and the like call the service through the target gateway, the service call can be performed according to the service list and the address of the service provider (such as each business system, the preset service and the like). The service registration center may be pre-registered with the preset service and the target gateway, so that the service registration center may obtain an address of the preset service and may provide the address of the preset service for the target gateway.

Illustratively, the service registry may be Zookeeper, Eureka, etc., without limitation.

It should be noted that the service registry may also be registered with other service systems or other services, interfaces, and the like, and a specific setting mode of the service registry may be set according to an actual application scenario.

In the embodiment of the present application, the target gateway sends an inquiry request about an element to be inquired to the preset service according to the address of the preset service, where the inquiry request about the element to be inquired may be directly sent to the preset service by the target gateway, or the inquiry request about the element to be inquired may be sent to the preset service by the service registry, and the information transmission manner may be multiple.

In some embodiments, the address of the preset service is returned to the target gateway by the service registry after receiving an address query request of the target gateway, where the address query request indicates that the target gateway requests the service registry to query the address of the preset service, and the address query request is generated when the target gateway obtains a query request for a specified application about an element to be queried and verifies that the source of the query request is a target source, and the preset service is a service matching the query request.

In this embodiment of the application, the target source may be preset, or may be determined by determining according to information such as an address of a source of the query request. Illustratively, the target source may include a target application (such as an application specifying an application type or specifying attributes), a target device, and so forth. When the target gateway acquires the query request about the element to be queried, whether the source of the query request is the target source is verified, so that illegal query can be reduced, and normal use of database query is further ensured. In this embodiment of the present application, the service matched with the query request may be determined according to a function of the service and a requirement of the query request, for example, if the query request is query database information, in this embodiment of the present application, the preset service is the service matched with the query request.

An exemplary architecture corresponding to an information query method provided by the embodiment of the present application is exemplarily described below with a specific example.

Fig. 3 is a schematic diagram of an architecture corresponding to an information query method provided in the embodiment of the present application. The target source may be a browser, the target gateway may be zuul, the service registry may be Eureka, the service registry may be registered with other service systems, such as service system 1 and service system 2, and the default service may be Sidecar.

It should be noted that the architecture shown in fig. 3 can be implemented on one or more terminals. The terminal implementing the architecture may include a terminal device executing the information query method, and may also include other terminals besides the terminal device.

Generally, the valley distribution filter and the preset service may be implemented by a terminal device executing the information query method in the embodiment of the present application; while the other parts of the architecture, i.e. the target source, the target gateway, the service registry and other business systems, may be implemented by the terminal device running the preset service and the valley filter, or by one or more other terminals. In this case, the information may be transferred between the respective portions of the architecture by at least one of systems communication, wireless communication, wired communication, and the like, according to the distribution of the respective portions on the terminal.

It should be noted that fig. 3 is only an exemplary illustration of the architecture in the embodiment of the present application, and is not a limitation.

According to the embodiment of the application, when the preset service acquires the query request about the element to be queried from the target gateway, the first label corresponding to the element to be queried is obtained through the second hash function, and the query request from various sources can be acquired through the preset service and the target gateway, so that the requirements of various application scenarios can be met, and the security of the source of the query request can be guaranteed through the target gateway.

It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

Fig. 4 shows a block diagram of an information query apparatus provided in the embodiment of the present application, which corresponds to the information query method described in the above embodiment, and only shows the relevant parts in the embodiment of the present application for convenience of description.

Referring to fig. 4, the information inquiry apparatus 4 includes:

a storage module 401, configured to determine, based on at least one first hash function in a first hash function set, a corresponding storage location of each preset label in a preset storage space of a valley distribution filter, and store the corresponding storage location, where the first hash function set includes at least two first hash functions, the first hash functions are different and associated with each other, and for any preset label, the preset label has different storage locations in the preset storage space of the valley distribution filter based on each first hash function;

a setting module 402, configured to associate the valley distribution filter with a preset service, so that the preset service can invoke the valley distribution filter;

a processing module 403, configured to obtain, through a second hash function, a first tag corresponding to an element to be queried if it is determined that the preset service obtains a query request for the element to be queried;

a first query module 404, configured to query, based on the preset service, whether a preset tag that is the same as the first tag is stored in the preset storage space through the valley distribution filter;

a second querying module 405, configured to query whether target information about the element to be queried is stored in a cache if the preset storage space stores a preset tag that is the same as the first tag.

Optionally, the processing module 403 is specifically configured to:

and if the preset service is determined to acquire the query request about the element to be queried from the target gateway, obtaining a first label corresponding to the element to be queried through a second hash function.

Optionally, the processing module 403 is specifically configured to:

Optionally, in the information querying device 4, the address of the preset service is returned to the target gateway after the service registration center receives an address query request of the target gateway, where the address query request indicates that the target gateway requests the service registration center to query the address of the preset service, the address query request is generated when the target gateway obtains a query request about an element to be queried and verifies that a source of the query request is a target source, and the preset service is a service matched with the query request.

Optionally, the first query module specifically includes:

a calculating module, configured to calculate, based on at least one first hash function in the first hash function set, at least one first storage location corresponding to the first label in a preset storage space of the valley laying filter;

and the second query unit is used for querying whether a preset tag which is the same as the first tag is stored in each first storage position through the valley laying filter based on the preset service until each first storage position corresponding to the first tag is traversed or until the preset tag which is the same as the first tag is stored in the preset storage space is determined.

Optionally, the information query device 4 further includes:

and the third query unit is used for querying the target information of the element to be queried from the database if the target information of the element to be queried is not stored in the cache.

And the obtaining unit is used for obtaining the target information of the element to be inquired in the cache if the target information of the element to be inquired is stored in the cache.

Optionally, the storage module 401 specifically includes:

the first determining unit is used for determining the category of each preset label;

the device comprises a dividing unit, a storage unit and a processing unit, wherein the dividing unit is used for dividing a preset storage space of the valley laying filter so that the preset storage space comprises at least one sub-storage space, and each sub-storage space corresponds to one category;

the storage unit is used for determining and storing the storage position of each preset label in the corresponding sub-storage space based on at least one first hash function in the first hash function set;

the processing module 403 has:

the second determining unit is used for determining the category of the element to be queried if the preset service is determined to acquire the query request about the element to be queried;

a third determining unit, configured to determine, according to the category of the element to be queried, a second hash function corresponding to the element to be queried, where different categories correspond to different second hash functions;

the processing unit is used for obtaining a first label corresponding to the element to be queried through the corresponding second hash function;

the first query module 404 specifically includes:

a fourth determining unit, configured to determine, according to the category of the element to be queried, a sub-storage space corresponding to the element to be queried in the preset storage space;

and the fourth query unit is used for querying whether the corresponding sub-storage space stores a preset label which is the same as the first label or not through the valley distribution filter based on the preset service.

It should be noted that, for the information interaction, execution process, and other contents between the above-mentioned devices/units, the specific functions and technical effects thereof are based on the same concept as those of the embodiment of the method of the present application, and specific reference may be made to the part of the embodiment of the method, which is not described herein again.

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

Fig. 5 is a schematic structural diagram of a terminal device according to an embodiment of the present application. As shown in fig. 5, the terminal device 5 of this embodiment includes: at least one processor 50 (only one is shown in fig. 5), a memory 51, and a computer program 52 stored in the memory 51 and operable on the at least one processor 50, wherein the processor 50 implements the steps of any of the various embodiments of the information query method when executing the computer program 52.

The terminal device 5 may be a wearable device, an Augmented Reality (AR)/Virtual Reality (VR) device, a desktop computer, a notebook, a palmtop computer, a cloud server, or other computing devices. The terminal device may include, but is not limited to, a processor 50, a memory 51. Those skilled in the art will appreciate that fig. 5 is merely an example of the terminal device 5, and does not constitute a limitation of the terminal device 5, and may include more or less components than those shown, or combine some of the components, or different components, such as may also include input devices, output devices, network access devices, etc. The input device may include a keyboard, a touch pad, a fingerprint sensor (for collecting fingerprint information of a user and direction information of a fingerprint), a microphone, a camera, and the like, and the output device may include a display, a speaker, and the like.

The Processor 50 may be a Central Processing Unit (CPU), and the Processor 50 may be other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The storage 51 may be an internal storage unit of the terminal device 5, such as a hard disk or a memory of the terminal device 5. In other embodiments, the memory 51 may also be an external storage device of the terminal device 5, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the terminal device 5. Further, the memory 51 may include both an internal storage unit and an external storage device of the terminal device 5. The memory 51 is used for storing an operating system, an application program, a BootLoader (BootLoader), data, other programs, and the like, such as program codes of the computer programs. The above-mentioned memory 51 may also be used to temporarily store data that has been output or is to be output.

In addition, although not shown, the terminal device 5 may further include a network connection module, such as a bluetooth module Wi-Fi module, a cellular network module, and the like, which is not described herein again.

In this embodiment, when the processor 50 executes the computer program 52 to implement the steps in any of the above-mentioned information query method embodiments, the storage location corresponding to each preset label in the preset storage space of the valley distribution filter may be determined and stored based on at least one first hash function in a first hash function set, where the first hash function set includes at least two first hash functions, so that each preset label may have a plurality of corresponding storage locations in the preset storage space of the valley distribution filter through a plurality of first hash functions, and one of the storage locations is selected to store the preset label; and the first hash functions are different and associated with each other, so that in practical application, the storage positions corresponding to other first hash functions can be obtained according to the storage position corresponding to one of the first hash functions, and therefore, under some circumstances, a plurality of storage positions corresponding to the preset label can be quickly found through one first hash function, and one storage position capable of storing among the plurality of storage positions can be determined. In addition, because the framework and the programming language adopted by the valley laying filter may be different from the object (such as various applications) sending the query request, the valley laying filter is associated with a preset service so that the preset service can call the valley laying filter, and the problem that the framework and the programming language adopted by the valley laying filter are different from the object sending the query request can be solved, so that the valley laying filter can be called for various objects sending the query request through the preset service to carry out query, the requirements of various application scenes are met, and the universality of the valley laying filter is greatly improved. If the preset storage space stores the preset tag which is the same as the first tag, whether the target information of the element to be queried is stored in the query cache or not is judged, at the moment, the element to be queried can be filtered through the valley distribution filter, only effective query content is subjected to subsequent query on the cache and even the database, and therefore the situations of cache breakdown and the like are avoided, and normal use of the database is maintained.

The embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps in the above method embodiments.

The embodiments of the present application provide a computer program product, which when running on a terminal device, enables the terminal device to implement the steps in the above method embodiments when executed.

The integrated unit may be stored in a computer-readable storage medium if it is implemented in the form of a software functional unit and sold or used as a separate product. Based on such understanding, all or part of the processes in the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium and can implement the steps of the embodiments of the methods described above when the computer program is executed by a processor. The computer program includes computer program code, and the computer program code may be in a source code form, an object code form, an executable file or some intermediate form. The computer-readable medium may include at least: any entity or device capable of carrying computer program code to a photographing apparatus/terminal apparatus, a recording medium, computer Memory, Read-Only Memory (ROM), random-access Memory (RAM), an electrical carrier signal, a telecommunications signal, and a software distribution medium. Such as a usb-disk, a removable hard disk, a magnetic or optical disk, etc. In certain jurisdictions, computer-readable media may not be an electrical carrier signal or a telecommunications signal in accordance with legislative and patent practice.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus/network device and method may be implemented in other ways. For example, the above-described apparatus/network device embodiments are merely illustrative, and for example, the division of the above modules or units is only one logical function division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.

Claims

1. An information query method, comprising:

2. The information query method according to claim 1, wherein if it is determined that the preset service obtains the query request for the element to be queried, obtaining the first label corresponding to the element to be queried through a second hash function, includes:

3. The information query method of claim 2, wherein if it is determined that the preset service obtains the query request about the element to be queried from the target gateway, obtaining the first tag corresponding to the element to be queried through a second hash function, includes:

4. The information query method according to claim 3, wherein the address of the preset service is returned to the target gateway by the service registry after receiving an address query request of the target gateway, wherein the address query request indicates that the target gateway requests the service registry to query for the address of the preset service, and the address query request is generated by the target gateway when obtaining a query request about an element to be queried and verifying that the source of the query request is a target source, and the preset service is a service matching the query request.

5. The information query method of claim 1, wherein the querying, based on the preset service, whether the preset storage space stores a preset tag that is the same as the first tag through the valley fill filter includes:

calculating at least one first storage position corresponding to the first label in a preset storage space of the valley laying filter based on at least one first hash function in the first hash function set;

6. The information query method of claim 1, after determining whether target information about the element to be queried is stored in the query cache, further comprising:

if the target information about the element to be queried is not stored in the cache, querying a database about the target information about the element to be queried;

7. The information query method according to any one of claims 1 to 6, wherein the determining and storing the storage location corresponding to each preset label in the preset storage space of the valley laying filter based on at least one first hash function in the first hash function set includes:

determining the category of each preset label;

based on the preset service, whether a preset label which is the same as the first label is stored in the corresponding sub-storage space is inquired through the valley filter.

8. An information inquiry apparatus, comprising:

9. A terminal device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the information query method according to any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, implements the information query method according to any one of claims 1 to 7.