CN108595450A - One kind burying point data base construction method, bury point data base and buries a querying method - Google Patents
One kind burying point data base construction method, bury point data base and buries a querying method Download PDFInfo
- Publication number
- CN108595450A CN108595450A CN201711226187.7A CN201711226187A CN108595450A CN 108595450 A CN108595450 A CN 108595450A CN 201711226187 A CN201711226187 A CN 201711226187A CN 108595450 A CN108595450 A CN 108595450A
- Authority
- CN
- China
- Prior art keywords
- little
- bury
- data base
- point data
- burying
- 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.)
- Granted
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides one kind burying point data base construction method, buries point data base and buries a querying method, wherein burying point data base construction method and including：First time matching is carried out in burying source data a little containing history using the preset keyword that buries, and obtains burying row data a little containing history；The row data that history is buried a little are contained to each and carry out second of matching according to the combination of preset matching rule, history is obtained and buries a little；It is buried a little according to according to several history, structure buries point data base.Burying a querying method includes：The to be checked of input is received to bury a little；It is retrieved in point data base in above-mentioned bury using to be checked bury as search key.The present invention buries point data base by building automatically, can solve the problems, such as to bury point data base missing, while can inquire to be checked bury automatically in burying for structure in point data base and a little whether there is, and saves cost, improves efficiency.
Description
Technical field
The present invention relates to communications applications field, more particularly to one kind burying point data base construction method, buries point data base and bury
Point querying method.
Background technology
Items in commerce includes many service logic and product module, in order to obtain the user of service logic and product module
Behavioral data, we can add a large amount of procedure links and bury a little, but with service line fractionation and the continuous iteration of project, use
Bury a little more and more, situations such as causing different business to occur burying repetition.
In order to avoid burying conflict, service line product manager need to add bury when, need to inquire other products warps
Reason together confirm bury it is a little whether feasible, if repeatedly.But service line product manager confirmation bury a little whether repeat when it is not true
The data statistics of chisel, after project operation many years, only individual modules bury a record sheet, can not thumb all bury a little；
And a confirmation process is buried dependent on the communication between product manager, not only cost is big, but also efficiency is low.
Invention content
For conflicting between avoiding burying a little with what is be embedded to when addition is buried, the present invention provides one kind burying points
According to base construction method, buries point data base and bury a querying method.
One kind provided by the invention buries point data base construction method, including：
A keyword is buried using preset, first time matching is carried out in burying source data a little containing history, is contained
History buries row data a little；
The row data that history is buried a little are contained to each and carry out second of matching according to the combination of preset matching rule, are obtained
History is buried a little；
All row data are traversed, obtain burying several history that a keyword matches with described and burying a little, and according to institute
It states several history to bury a little, structure buries point data base.
Optionally, point data base construction method is buried of the present invention, containing history to each buries line number a little
It is matched according to carrying out second according to the combination of preset matching rule, including：
History is contained to each according to the first matching rule in the preset matching rule combination and buries line number a little
It is matched according to carrying out second；
When matching result meets preset condition, obtains history and bury a little；
When matching result is unsatisfactory for preset condition, next matching rule in the preset matching rule combination are chosen
Second of matching is then re-started, until having traversed all matching rules.
Optionally, point data base construction method is buried of the present invention, is buried a little according to described several history, structure
Point data base is buried, including：
Create the tables of data in database and the database；
Several described history are buried and are a little inserted into the tables of data, obtain burying point data base.
The present invention also provides it is a kind of using it is above-mentioned bury point data base construction method structure bury point data base.
The present invention also provides one kind burying a querying method, including：
The to be checked of input is received to bury a little；
It is retrieved in point data base in above-mentioned bury using to be checked bury as search key, obtains retrieval knot
Fruit simultaneously feeds back.
Optionally, it buries a querying method of the present invention, further includes：When to be checked bury is not buried a little described
When in point data base, to be checked bury a little is entered into described bury in point data base.
Point data base is buried the present invention also provides one kind and building equipment, and the equipment includes：Memory, processor and storage
On the memory and the computer program that can run on the processor, the computer program are held by the processor
The step of burying point data base construction method as described above is realized when row.
The present invention also provides one kind burying a query facility, and the equipment includes：It memory, processor and is stored in described
It is real when the computer program is executed by the processor on memory and the computer program that can run on the processor
The step of now burying querying method as described above.
The present invention also provides a kind of computer readable storage medium, it is stored with and buries on the computer readable storage medium
Point data base construction procedures, it is described bury when point data base construction procedures are executed by processor realize bury point data base as described above
The step of construction method.
The present invention also provides a kind of computer readable storage medium, it is stored with and buries on the computer readable storage medium
Point polling routine, described bury realize upper described the step of burying querying method when polling routine is executed by processor.
The present invention has the beneficial effect that：
It is provided by the invention to bury point data base construction method, bury point data base and bury a querying method, by building automatically
Point data base is buried, can solve the problems, such as to bury point data base missing, while can automatically be inquired in point data base in burying for structure
To be checked bury a little whether there is, and is not take up the time of other staff, saves cost, improves efficiency.
Description of the drawings
Fig. 1 is the flow diagram that first method embodiment of the present invention buries point data base construction method；
Fig. 2 is that two schematic diagrames buried a little are called in first method embodiment of the present invention；
Fig. 3 is the flow diagram that second method embodiment of the present invention buries a querying method；
Fig. 4 is to bury point data base construction method in present example 1 and bury the flow diagram of a querying method.
Specific implementation mode
The exemplary embodiment of the disclosure is more fully described below with reference to accompanying drawings.Although showing the disclosure in attached drawing
Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here
It is limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure
Completely it is communicated to those skilled in the art.
For conflicting between avoiding burying a little with what is be embedded to when addition is buried, the present invention provides one kind burying points
It according to base construction method, buries point data base and buries a querying method, the present invention will be described in further detail below in conjunction with attached drawing.
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, the present invention is not limited.
Fig. 1 is the flow diagram that first method embodiment of the present invention buries point data base construction method, as described in Figure 1, this
The point data base construction method that buries of invention first method embodiment includes the following steps：
S101：A keyword is buried using preset, first time matching is carried out in burying source data a little containing history, is obtained
Row data a little are buried containing history.
In the present invention, it is to report scheme for recording a kind of daily record of specific behavior to bury a little, specifically, described bury a pass
The known feature or rule buried a summary and induction and come out before according to keyword.
Specifically, the calling that operation encapsulation is reduced to a method can will be buried, it is only necessary to incoming specific business ginseng
Number such as pageType, actionType and spreading parameter, so that it may be buried a little with realizing one, i.e. a thing in a page
Part, our formal warps commonly use pageType_actionType to indicate, Fig. 2 is to be called in first method embodiment of the present invention
Two schematic diagrames buried a little.Wherein, pageType be bury a little defined in a field, be commonly used in representation page type；
ActionType be bury a little defined in a field, commonly used in indicate one action or event type, in conjunction with
PageType can indicate that one is completely buried a little, i.e., in some event of some page.
It buries source data a little specifically, described containing history and refers to burying source code a little comprising history.
Optionally, using it is preset bury that a keyword carries out matching for the first time in burying source data a little containing history can be with
To carry out canonical matching in burying source data a little containing history using the preset keyword that buries.
S102：The row data that history is buried a little are contained to each and carry out second according to the combination of preset matching rule
Match, obtains history and bury a little.
Optionally, the row data that history is buried a little are contained to each and carries out second according to the combination of preset matching rule
Match, including：
History is contained to each according to the first matching rule in the preset matching rule combination and buries line number a little
It is matched according to carrying out second；
When matching result meets preset condition, obtains history and bury a little；
When matching result is unsatisfactory for preset condition, next matching rule in the preset matching rule combination are chosen
Second of matching is then re-started, until having traversed all matching rules.
S103：All row data are traversed, several history for obtaining burying a keyword described in meeting are buried a little, according to described
Several history are buried a little, and structure buries point data base.
Optionally, it being buried a little according to several described history, structure buries point data base, including：
Create the tables of data in database and the database；
Several described history are buried and are a little inserted into the tables of data, obtain burying point data base.
The construction method for burying point data base that first method embodiment of the present invention provides, can bury a little containing history automatically
Source data in find out history and bury a little, and a structure is buried according to the history found and buries point data base, filled up the prior art
Blank.
The device of the invention embodiment is to be built using the point data base construction method that buries of first method embodiment of the present invention
Bury point data base.
Dot system is buried specifically, can be defined after obtaining burying point data base, this process mainly designs and buries dot system
Externally need the interface supported, such as query interface and insertion interface.Specifically, the point data base that buries is using lightweight
SQLite, the several interfaces that can be wanted with design, for example, initialization data library and import data, inquiry bury point, update bury
Point recommended information newly-increased buries a little etc..
Fig. 3 is that second method embodiment of the present invention buries the flow diagram of a querying method, as described in Figure 3, of the invention the
The querying method that buries of two embodiments of the method includes the following steps：
S301：The to be checked of input is received to bury a little.
Specifically, to be checked is buried a little in the form of pageType_actionType as parameter, input to according to this
The method structure of invention first method embodiment buries point data base.
S302：It is retrieved in point data base, is obtained in above-mentioned bury using to be checked bury as search key
Retrieval result is simultaneously fed back.
Specifically, feeding back query result after retrieval, it is a little all existing that inquiry, which may know that this is buried,.Its
In, the feedback form of retrieval result can be the storage form to be checked buried a little in burying point data base is shown, or
The printed words of " inquiry, which is buried, a little to be had existed " or " there is no inquiries to bury a little " are shown in display interface.
Further, a querying method is buried in second method embodiment of the present invention, further includes：It to be checked is buried when described
Point is a little entered into described bury in point data base not in described bury in point data base, by be checked bury.Specifically, to be checked
It buries a little to be input to as parameter in the form of pageType_actionType and bury in point data base, insert data into number automatically
It is fed back according to library, and by result, inquiry, which may know that, buries whether insertion succeeds.
What second method embodiment of the present invention provided buries a querying method, is built according to first method embodiment of the present invention
Bury and retrieve whether to be checked burying a little has existed in point data base, be not take up the time of other staff, save cost, carry
High efficiency.
Point data base is buried the present invention also provides one kind and building equipment, and the equipment includes：Memory, processor and storage
On the memory and the computer program that can run on the processor, the computer program are held by the processor
Following steps are realized when row：
Step 11：A keyword is buried using preset, first time matching is carried out in burying source data a little containing history, is obtained
Row data a little are buried to containing history.
In the present invention, it is to report scheme for recording a kind of daily record of specific behavior to bury a little, specifically, described bury a pass
The known feature or rule buried a summary and induction and come out before according to keyword.
Step 12：The row data that history is buried a little are contained to each and carry out second according to the combination of preset matching rule
Match, obtains history and bury a little.
Optionally, the row data that history is buried a little are contained to each and carries out second according to the combination of preset matching rule
Match, including：
History is contained to each according to the first matching rule in the preset matching rule combination and buries line number a little
It is matched according to carrying out second；
When matching result meets preset condition, obtains history and bury a little；
When matching result is unsatisfactory for preset condition, next matching rule in the preset matching rule combination are chosen
Second of matching is then re-started, until having traversed all matching rules.
Step 13：All row data are traversed, several history for obtaining burying a keyword described in meeting are buried a little, according to institute
It states several history to bury a little, structure buries point data base.
Optionally, it being buried a little according to several described history, structure buries point data base, including：
Create the tables of data in database and the database；
Several described history are buried and are a little inserted into the tables of data, obtain burying point data base.
The structure equipment provided by the invention for burying point data base can search in burying source data a little containing history automatically
Go out history to bury a little, and a structure is buried according to the history found and buries point data base, fills up the blank of the prior art.
The present invention also provides a kind of computer readable storage medium, it is stored with and buries on the computer readable storage medium
Point data base construction procedures, described bury when point data base construction procedures are executed by processor realize following steps：
Step 21：A keyword is buried using preset, first time matching is carried out in burying source data a little containing history, is obtained
Row data a little are buried to containing history.
In the present invention, it is to report scheme for recording a kind of daily record of specific behavior to bury a little, specifically, described bury a pass
The known feature or rule buried a summary and induction and come out before according to keyword.
Step 22：The row data that history is buried a little are contained to each and carry out second according to the combination of preset matching rule
Match, obtains history and bury a little.
Optionally, the row data that history is buried a little are contained to each and carries out second according to the combination of preset matching rule
Match, including：
History is contained to each according to the first matching rule in the preset matching rule combination and buries line number a little
It is matched according to carrying out second；
When matching result meets preset condition, obtains history and bury a little；
When matching result is unsatisfactory for preset condition, next matching rule in the preset matching rule combination are chosen
Second of matching is then re-started, until having traversed all matching rules.
Step 23：All row data are traversed, several history for obtaining burying a keyword described in meeting are buried a little, according to institute
It states several history to bury a little, structure buries point data base.
Optionally, it being buried a little according to several described history, structure buries point data base, including：
Create the tables of data in database and the database；
Several described history are buried and are a little inserted into the tables of data, obtain burying point data base.
Computer readable storage medium provided by the invention can be found out in burying source data a little containing history automatically
History is buried a little, and is buried a structure according to the history found and buried point data base, and the blank of the prior art has been filled up.
The present invention also provides one kind burying a query facility, and the equipment includes：It memory, processor and is stored in described
It is real when the computer program is executed by the processor on memory and the computer program that can run on the processor
Existing following steps：
S31：The to be checked of input is received to bury a little.
S32：It is retrieved in point data base, is examined in above-mentioned bury using to be checked bury as search key
Hitch fruit simultaneously feeds back.
Specifically, feeding back query result after retrieval, it is a little all existing that inquiry, which may know that this is buried,.Its
In, the feedback form of retrieval result can be the storage form to be checked buried a little in burying point data base is shown, or
The printed words of " inquiry, which is buried, a little to be had existed " or " there is no inquiries to bury a little " are shown in display interface.
Further, following steps are realized when the computer program is executed by the processor：It to be checked is buried when described
Point is a little entered into described bury in point data base not in described bury in point data base, by be checked bury.
It is provided by the invention to bury a query facility, in burying point data base what is built according to first method embodiment of the present invention
It retrieves whether to be checked burying a little has existed, is not take up the time of other staff, saves cost, improve efficiency.
The present invention also provides a kind of computer readable storage medium, it is stored with and buries on the computer readable storage medium
Point polling routine, described bury when a polling routine is executed by processor realize following steps：
S41：The to be checked of input is received to bury a little.
S42：It is retrieved in point data base, is examined in above-mentioned bury using to be checked bury as search key
Hitch fruit simultaneously feeds back.
Specifically, feeding back query result after retrieval, it is a little all existing that inquiry, which may know that this is buried,.Its
In, the feedback form of retrieval result can be the storage form to be checked buried a little in burying point data base is shown, or
The printed words of " inquiry, which is buried, a little to be had existed " or " there is no inquiries to bury a little " are shown in display interface.
Further, following steps are realized when the computer program is executed by the processor：It to be checked is buried when described
Point is a little entered into described bury in point data base not in described bury in point data base, by be checked bury.
Computer readable storage medium provided by the invention buries points what is built according to first method embodiment of the present invention
According to retrieving whether to be checked burying a little has existed in library, it is not take up the time of other staff, saves cost, improves effect
Rate.
Illustrate that burying for the present invention and buries a querying method at point data base construction method in order to more detailed, provides example 1.
Fig. 4 is to bury point data base construction method in present example 1 and bury the flow diagram of a querying method, such as Fig. 4
Shown, the construction method that present example 1 buries point data base includes the following steps：
Step 1：To institute's source code (referring herein to all java files), carry out by file filter.Based on of the invention real
Example 1 buries point methods, will meet all code lines for burying a keyword first and finds out, and is redirected to the text of a record
Part is labeled as Data 1.This file data, come a group organization data, is exactly specifically all to be one per a line to bury a little according to row,
Content includes that this buries source code file title a little, line number and buries point code.
Step 2：Although having been obtained for Data 1, the row data in Data 1 be not it is final bury a little, need
Further cleaning.Equally with behavior unit, all data of Data 1 are read, and preset place is executed after the reading of every a line
Logic is managed, is exactly specifically all to take out the real value of pageType and actionType in the trade.Due to encoding
When code literary style it is very much, have plenty of and directly write pageType, actionType with character string forms, some is use
Variable represents, also even contain many situations of binary operation, etc., therefore filter when, needs to write a variety of matchings
Rule.If meeting condition, by one file of write-in after pageType and actionType extractions, it is labeled as Data 2.
During carrying out matched to each row data, it may appear that some unascertainable row data, it can be by it as suspicious
It buries a little, is individually stored in another file, be labeled as Data 3.
Step 3：It regard Data 2 as input data, automatically creates database and tables of data and relevant literary name section；So
After will bury and a little still be operated by row, the batch operation for executing a database and being inserted into sentence is buried for each, that is,
It is entered into the table of database.
Step 4：To be checked is buried a little in the form of pageType_actionType as parameter, inputs to bury and is
System, system feed back query result after searching database, and whether inquiry may know that this is buried and a little have existed.
Step 5：It is buried need to be inserted into a little in the form of pageType_actionType as parameter, inputs to bury and be
System, system inserts data into database automatically, and result is fed back, inquiry may know that bury be inserted into whether at
Work(.
Step 4 and step 5 are practically without precedence relationship, they are the functions of burying dot system and supported.
The embodiment of the present invention bury point data base construction method and bury a querying method can be directly in macOS and linux
It is used on machine, while remote server can also be deployed to, the simple web front-end page of arranging in pairs or groups can accomplish that the page is visual
The operation of change, no matter which kind of pattern all only needs to decompress execution after downloading installation kit.
It is provided by the invention to bury point data base construction method, bury point data base and bury a querying method, by building automatically
Point data base is buried, can solve the problems, such as to bury point data base missing, while can automatically be inquired in point data base in burying for structure
To be checked bury a little whether there is, and is not take up the time of other staff, saves cost, improves efficiency.
Example the above is only the implementation of the present invention is not intended to restrict the invention, for those skilled in the art
For member, the invention may be variously modified and varied.Any modification made by all within the spirits and principles of the present invention,
Equivalent replacement, improvement etc., should be included within scope of the presently claimed invention.
Claims (10)
1. one kind burying point data base construction method, which is characterized in that including：
A keyword is buried using preset, first time matching is carried out in burying source data a little containing history, is obtained containing history
Bury row data a little；
The row data that history is buried a little are contained to each and carry out second of matching according to the combination of preset matching rule, obtain history
It buries a little；
All row data are traversed, obtain burying several history that a keyword matches with described and burying a little, and if according to described
Dry history is buried a little, and structure buries point data base.
2. burying point data base construction method as described in claim 1, which is characterized in that contain history to each and bury row a little
Data carry out second according to the combination of preset matching rule and match, including：
According to the first matching rule in the preset matching rule combination to each contain history bury row data a little into
Second of matching of row；
When matching result meets preset condition, obtains history and bury a little；
When matching result is unsatisfactory for preset condition, next matching rule weight in the preset matching rule combination is chosen
It is new to carry out second of matching, until having traversed all matching rules.
3. burying point data base construction method as described in claim 1, which is characterized in that it is buried a little according to several described history,
Structure buries point data base, including：
Create the tables of data in database and the database；
Several described history are buried and are a little inserted into the tables of data, obtain burying point data base.
4. it is a kind of using any one of claims 1 to 33 bury point data base construction method structure bury point data base.
5. one kind burying a querying method, which is characterized in that including：
The to be checked of input is received to bury a little；
It is retrieved, is obtained as search key burying in point data base described in claim 4 using to be checked bury
Retrieval result is simultaneously fed back.
6. burying a querying method as claimed in claim 5, which is characterized in that further include：
When it is described it is to be checked bury a little not in described bury in point data base when, by it is described it is to be checked bury a little to be entered into described bury point data
In library.
7. one kind burying point data base structure equipment, which is characterized in that the equipment includes：Memory, processor and it is stored in institute
The computer program that can be run on memory and on the processor is stated, when the computer program is executed by the processor
Realize the step of burying point data base construction method as claimed any one in claims 1 to 3.
8. one kind burying a query facility, which is characterized in that the equipment includes：Memory, processor and it is stored in the storage
On device and the computer program that can run on the processor, realized such as when the computer program is executed by the processor
Described in any one of claim 5 to 6 the step of burying querying method.
9. a kind of computer readable storage medium, which is characterized in that be stored on the computer readable storage medium and bury points
According to library construction procedures, described bury is realized when point data base construction procedures are executed by processor such as any one of claims 1 to 3 institute
State the step of burying point data base construction method.
10. a kind of computer readable storage medium, which is characterized in that be stored with to bury on the computer readable storage medium and a little look into
Program is ask, described bury realizes that burying as described in any one of claim 5 to 6 is inquired when a polling routine is executed by processor
The step of method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711226187.7A CN108595450B (en) | 2017-11-29 | 2017-11-29 | Buried point database construction method, buried point database and buried point query method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711226187.7A CN108595450B (en) | 2017-11-29 | 2017-11-29 | Buried point database construction method, buried point database and buried point query method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108595450A true CN108595450A (en) | 2018-09-28 |
| CN108595450B CN108595450B (en) | 2021-06-04 |
Family
ID=63633325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711226187.7A Active CN108595450B (en) | 2017-11-29 | 2017-11-29 | Buried point database construction method, buried point database and buried point query method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108595450B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825731A (en) * | 2019-09-18 | 2020-02-21 | 平安科技（深圳）有限公司 | Data storage method and device, electronic equipment and storage medium |
| CN112559278A (en) * | 2019-09-25 | 2021-03-26 | 腾讯科技（深圳）有限公司 | Method and device for acquiring operation data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030101128A1 (en) * | 2001-11-29 | 2003-05-29 | Abernethy William Randolph | State tracking system for a basket trading system |
| CN102946319A (en) * | 2012-09-29 | 2013-02-27 | 焦点科技股份有限公司 | System and method for analyzing network user behavior information |
| US8606825B1 (en) * | 2011-07-20 | 2013-12-10 | Google Inc. | Query response streams based on dynamic query library |
| CN104915296A (en) * | 2015-06-29 | 2015-09-16 | 北京金山安全软件有限公司 | Buried point testing method, data query method and device |
| CN106571949A (en) * | 2016-09-23 | 2017-04-19 | 北京五八信息技术有限公司 | Event tracking point processing method and apparatus |
| US9781160B1 (en) * | 2017-05-31 | 2017-10-03 | KnowBe4, Inc. | Systems and methods for discovering suspect bot IP addresses and using validated bot IP address to ignore actions in a simulated phishing environment |
-
2017
- 2017-11-29 CN CN201711226187.7A patent/CN108595450B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030101128A1 (en) * | 2001-11-29 | 2003-05-29 | Abernethy William Randolph | State tracking system for a basket trading system |
| US8606825B1 (en) * | 2011-07-20 | 2013-12-10 | Google Inc. | Query response streams based on dynamic query library |
| CN102946319A (en) * | 2012-09-29 | 2013-02-27 | 焦点科技股份有限公司 | System and method for analyzing network user behavior information |
| CN104915296A (en) * | 2015-06-29 | 2015-09-16 | 北京金山安全软件有限公司 | Buried point testing method, data query method and device |
| CN106571949A (en) * | 2016-09-23 | 2017-04-19 | 北京五八信息技术有限公司 | Event tracking point processing method and apparatus |
| US9781160B1 (en) * | 2017-05-31 | 2017-10-03 | KnowBe4, Inc. | Systems and methods for discovering suspect bot IP addresses and using validated bot IP address to ignore actions in a simulated phishing environment |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825731A (en) * | 2019-09-18 | 2020-02-21 | 平安科技（深圳）有限公司 | Data storage method and device, electronic equipment and storage medium |
| CN110825731B (en) * | 2019-09-18 | 2023-10-24 | 平安科技（深圳）有限公司 | Data storage method, device, electronic equipment and storage medium |
| CN112559278A (en) * | 2019-09-25 | 2021-03-26 | 腾讯科技（深圳）有限公司 | Method and device for acquiring operation data |
| CN112559278B (en) * | 2019-09-25 | 2024-02-09 | 腾讯科技（深圳）有限公司 | Method and device for acquiring operation data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108595450B (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102402605B (en) | Mixed distribution model for search engine indexing | |
| CN102171689B (en) | Method and system for providing search results | |
| CN101876983B (en) | Method for partitioning database and system thereof | |
| CN101681377B (en) | User-defined relevance ranking for search | |
| CN101206670B (en) | System and method for transferring non construction information to content | |
| CN102567329B (en) | Data query method and data query system | |
| CN101452487B (en) | Data loading method and system, and data loading unit | |
| CN105630938A (en) | Intelligent question-answering system | |
| CN102693273A (en) | Unsupervised message clustering | |
| CN1987861A (en) | System and method for processing database query | |
| CN102591969A (en) | Method for providing search results based on historical behaviors of user and sever therefor | |
| CN104077369B (en) | The coalignment and matching process of multi-dimensional data | |
| CN106599153A (en) | Multi-data-source-based waste industry search system and method | |
| US11308177B2 (en) | System and method for accessing and managing cognitive knowledge | |
| CN104714974A (en) | Method and device for parsing and reprocessing query statement | |
| CN108595450A (en) | One kind burying point data base construction method, bury point data base and buries a querying method | |
| CN101763424B (en) | Method for determining characteristic words and searching according to file content | |
| CN102270201B (en) | Multi-dimensional indexing method and device for network files | |
| CN103500222A (en) | Method and device for searching for chat object through communication software | |
| CN108170852A (en) | A kind of stock searching method of efficiently and accurately | |
| CN103886039B (en) | Using the optimization method and device of retrieval | |
| CN110245215B (en) | Text retrieval method and device | |
| CN103377187A (en) | Method, device and program for paragraph segmentation | |
| CN112446812B (en) | Automatic push method and terminal for government affair information based on blockchain | |
| CN105488170B (en) | A kind of approaches to IM and device of ERP system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |