CN101059802A - Method and system for calculating data flow maximum value and minimum value under sliding window - Google Patents
Method and system for calculating data flow maximum value and minimum value under sliding window Download PDFInfo
- Publication number
- CN101059802A CN101059802A CN 200610075648 CN200610075648A CN101059802A CN 101059802 A CN101059802 A CN 101059802A CN 200610075648 CN200610075648 CN 200610075648 CN 200610075648 A CN200610075648 A CN 200610075648A CN 101059802 A CN101059802 A CN 101059802A
- Authority
- CN
- China
- Prior art keywords
- data
- historical data
- value
- minimum
- historical
- 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
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention relates to a method for calculating the minimum and maximum values of dataflow in sliding window, and a relative system, wherein the method simulates present data into a waveform curvature, calculates the highest peak value or valley value and the value of novel data in the window, to take value between the two values, and stores the data at slope in the waveform shape as history data. When novel data is added or old data is deleted, the data is compared with stored history data to directly output the maximum or minimum values of present data, and adjust stored history data. The system comprises a device for calculating maximum and minimum values, a history data memory, and a history data refresh device. Compared with traditional method, the invention can avoid storing all history data, and avoid scanning all stored history data when calculates the maximum and minimum values. The invention can improve the property of data analysis system, to be used in bond information statistic analysis, website log content statistic analysis or the like.
Description
Technical field
The invention belongs to the data analysis process field, relate in particular to the maximal value of real-time calculating dynamic changing data and the method for minimum value.
Background technology
The application of data stream more and more widely.Data stream is different from the conventional relationship data, is not the limited data set that is stored on the disk, but unlimited, continuous, fast, real-time, the data acquisition that occurs with the form of stream.The application scenarios of data stream has the stock price information of equities exchange, the message registration data of the Monitoring Data of network monitoring system and system of monitoring road traffic, telecommunication department and the data on the internet site etc.
To an important application of data stream is exactly inquiry to the data flow data, for example, security exchange is required know ought be for the previous period in stock price minimum and maximum be any two stocks.But the mode that adopts traditional relational database is head it off effectively, because: in the practical application, storage space is limited, but data stream arrives endlessly.Concerning the application of data stream, satisfy the requirement of real-time.The data that traditional relational database technology often needs to scan in the external memory obtain Query Result, and at the requirement of data flow system, this implementation is unrealistic.Traditional database technology can not satisfy the search request of sustainable growth and fast-changing data flow data.Therefore the data flow data querying method suitable mutually with data flow characteristics must be proposed.
The calculating of maximal value and minimum value is a major issue in the data flow data inquiry.But present solution need scan current total data, and need preserve the interior whole historical datas of a period of time window, internal memory and computing power to computing machine are all had relatively high expectations, can not satisfy current growing data traffic and real-time requirement far away, be necessary to propose the new computing method that internal memory is few and the computing power requirement is low of occupying.
Summary of the invention
Need scan total data under the current window in order to solve prior art, and the deficiency of the total data under the preservation current window, can not satisfy the problem that current growing data traffic and real-time require, the purpose of this invention is to provide a kind of can the calculating moving window of requirement of real time under the method and system of data flow maximum value and minimum value.
To achieve these goals, the present invention is achieved through the following technical solutions a kind of method of calculating data flow maximum value and minimum value under the moving window, comprises that step is as follows:
Generate the historical data step: the data stream under the current moving window is calculated, generated the historical data that needs preservation;
Calculate current maximal value or minimum value step: when increasing new data or deletion legacy data, the historical data of these data and preservation relatively calculates current maximal value or minimum value;
Upgrade the historical data step: increase or the legacy data deletion according to new data, upgrade the historical data that to preserve.
To achieve these goals, the present invention is achieved through the following technical solutions a kind of system of calculating data flow maximum value and minimum value under the moving window, comprising: calculate minimum and maximum value device, history data repository, renewal historical data device, data input pin, data output end; Calculating minimum and maximum value device is connected with data output end with data input pin respectively, data input pin promptly has new data to enter moving window, the data that data output end is promptly had been friends in the past shift out moving window, also be that data increase and data deletion, calculate minimum and maximum value device and compare the current minimum and maximum value of acquisition according to the current historical data of history data repository input and the increase data or the deleted data of external data input end and data output end input; Two output terminals of history data repository are connected with the input end that calculates minimum and maximum value device with the input end that upgrades historical data device respectively, history data repository submits to historical data to give the renewal historical data device, and obtain the historical data that current up-to-date need keep, and the historical data of preserving submitted to calculate minimum and maximum value device to obtain current minimum and maximum value from upgrading historical data device; Upgrade historical data device and be connected with data output end with two external data input ends respectively, data input pin and data output end are respectively that data increase and data deletion; Upgrade the input end of historical data device and the input end and the output terminal interconnection of output terminal and history data repository, upgrade historical data device at first obtains preservation from history data repository historical data, be to increase new data or deletion legacy data according to external data input end and data output end then, the historical data that the need that calculating makes new advances keep outputs it to history data repository and preserves.
Beneficial effect of the present invention: compared with prior art, the present invention is by reducing the historical data that needs preservation, and the reduction system makes system can satisfy the requirement of current growing data traffic and real-time to the requirement of Computer Storage and computing power.
Characteristics of the present invention are the part historical datas that only need to preserve under the current window, and when calculating new maximal value or minimum value, do not need to scan the historical data that whole preservations are got off.
The present invention does not need to scan the historical data that whole preservations is got off when calculating new maximum (little) value.Use new method of the present invention to improve the performance of data analysis system.The present invention is applicable to the various Monitoring Data in equities information, statistical study, the analysis of web log file content statistics, the wireless sensor network, the fields such as statistical study of network monitoring system data and internet site data.
Description of drawings
By the detailed description below in conjunction with accompanying drawing, above-mentioned and others, feature and advantage of the present invention will become more apparent.In the accompanying drawing:
Fig. 1 is the maximin systematic schematic diagram that the present invention calculates data flow data under the moving window
Fig. 2 is the squiggle (calculating the maximal value situation) of the data fitting of data stream under the current moving window of the present invention.
Fig. 3 is the squiggle (calculated minimum situation) of the data fitting of data stream under the current moving window of the present invention.
Fig. 4 is a minimum and maximum value device synoptic diagram among the present invention
Fig. 5 is a historical data device synoptic diagram among the present invention
Fig. 6 upgrades the historical data device synoptic diagram among the present invention
Embodiment
Below in conjunction with accompanying drawing the present invention is specified.Be noted that the described example of executing only is considered as illustrative purposes, rather than limitation of the present invention.
As shown in Figure 1, the minimax valve system of data flow data under the calculating moving window of the present invention comprises among the figure: calculate minimum and maximum value device 1, history data repository 2, upgrade historical data device 3, data input pin 4, data output end 5.
The minimum and maximum value of the data stream under the system-computed moving window of the present invention.System is at first according to the input of the data under the current moving window 4, data output 5, calculate the historical data that current time need be preserved, the legacy data that upgrades the historical data of the previous moment that historical data device 3 preserves according to history data repository 2 and new data that current time increases or deletion generates the historical data that the need of current time are preserved, and upgrades historical data that historical data device 3 keeps the need of current time and exports to history data repository 2 and preserve.Calculate 1 basis of minimum and maximum value device calculates the data stream under the current moving window from the legacy data of the new data of the historical data of history data repository 2 input and current increase or deletion minimum and maximum value.
According to of the present invention, described step is as follows:
Step saves historical data: the data fitting under the current window is become a squiggle; Calculate the highest crest value in the squiggle or calculate minimum trough value; The historical data that the calculating maximal value need be preserved is the data of value between the value of the highest crest and latest data, and belongs to the data of the descending of squiggle; The historical data that calculated minimum need be preserved is the data of value between the value of minimum trough and latest data, and belongs to the data of the upward slope of squiggle.
Maximal value step after described calculating new data increases comprises: new data and historical data are compared, if smaller or equal to the maximal value in the historical data, then maximal value is constant; Otherwise maximal value is new data.
Minimum value step after described calculating new data increases comprises: new data and historical data are compared, if more than or equal to the minimum value in the historical data, then minimum value is constant; Otherwise minimum value is new data.
Maximal value step after the deletion of described calculating legacy data comprises: judge whether legacy data belongs to the historical data of preservation, then maximal value is constant not belong to the historical data of preservation, belongs to the then legacy data and the historical data comparison of historical data of preservation; If legacy data is not the historical data maximal value, then maximal value is constant; Otherwise the historical data maximal value behind this legacy data of calculating deletion is as current maximal value.
Minimum value step after the described calculating legacy data deletion comprises: judge whether legacy data belongs to the historical data of preservation, if do not belong to the historical data of preservation then the legacy data minimum value is constant, if belong to the historical data of preservation, then legacy data and historical data are relatively, if legacy data is not the historical data minimum value, then minimum value is constant; Otherwise the historical data minimum value behind the calculating deletion legacy data is as current minimum value.
Described new data increases the back and upgrades the historical data step: preserve the data of value between the new data of the highest crest and increase, and the data of descending that belong to squiggle are as historical data;
Described new data increases the back and upgrades the historical data step: preserve the data of value between the new data of minimum trough and increase, and the data of upward slope that belong to squiggle are as historical data;
The step of historical data is upgraded in described legacy data deletion back: judge whether legacy data belongs to the historical data of preservation, if do not belong to then historical data is constant; If belong to then delete historical data behind the legacy data as new historical data.
As shown in Figure 2, the squiggle that is the data fitting of data stream under the current moving window of the present invention calculates the maximal value situation: X-axis is a time shaft, if data enter moving window by the right side, shift out moving window from the left side, current data presented is all data in the moving window, and as seen from the figure, the X-axis left data is older, X-axis right side data are newer, and Y-axis is the value of data.As shown in Figure 2, when needs calculated maximal value, the historical data that needs to preserve was the part of overstriking in the squiggle, promptly only needs the data of save value between the value of the highest crest and latest data, and belongs to the data of squiggle descending.
As shown in Figure 3, be the squiggle calculated minimum situation of the data fitting of data stream under the current moving window of the present invention: X-axis is a time shaft, if data enter moving window by the right side, shift out moving window from the left side, current data presented is all data in the moving window, and as shown in Figure 3, the X-axis left data is older, X-axis right side data are newer, and Y-axis is the value of data.As shown in the figure, when the needs calculated minimum, the historical data that needs to preserve is the part of overstriking in the squiggle, promptly only needs the data of save value between the value of minimum trough and latest data, and belongs to the data that squiggle goes up a slope.
Fig. 4 is a minimum and maximum value device synoptic diagram among the present invention, among the figure:
Described minimum and maximum value device 1 comprises: read historical data device 1.1, calculation element 1.2; Read that historical data device 1.1 reads historical data and from saving historical data, read historical data device (1.1) to calculation element (1.2) input historical data and the data that increase or delete, calculation element (1.2) calculates and output data and maximum or minimum value.
Particularly, minimum and maximum value device 1 adopts the computing module of maximin to comprise: to calculate current maximin according to the data of input, the data of output, the historical data of preservation;
Fig. 5 is a historical data device synoptic diagram among the present invention, among the figure:
Described historical data device 2 comprises, storer 2.1, submission historical data device 2.2; Storer 2.1 feeds the historical data of preserving and submits historical data device 2.2 to and export historical data.
Particularly, historical data device 2, adopt the module that saves historical data to comprise: the output according to update module is saved in historical data in the storer of computing machine, and is responsible for submitting to historical data to give computing module when computing module calculates.
Fig. 6 upgrades the historical data device synoptic diagram among the present invention, among the figure:
Described renewal historical data device 3 comprises: data fitting device 3.1; Calculate the highest crest or minimum trough device 3.2; The calculating device 3.3 that saves historical data, data and match output data that data fitting device 3.1 receives under the current window, data fitting device 3.1 with calculate the highest crest or minimum trough device 3.2 and be connected and export the highest crest value or minimum trough value, the highest crest value or minimum trough value feed device 3.3 that calculating saves historical data and make it the calculating output historical data that saves historical data.
Particularly, upgrade historical data device 3, adopt the historical data update module of preserving to comprise: the historical data of preserving according to the Data Update needs of the historical data of existing preservation and input;
Data are successive must be from system's left side input data, and by system's right side output data (promptly have data deleted), system pre-defines the moving window size of calculating maximum or minimum value, then by calculating maximum or real-time maximum that calculates data under the current moving window or the minimum value of minimum value module.
According to the present invention, establishing initial data sequence is A=a
1, a
2..., a
k, a
K+1..., a
n, promptly total n data.Constantly there are new data to add and old data deletion afterwards.
If the data of adding are followed successively by: a
N+1, a
N+2..., a
N+k...; The data of deletion are followed successively by: a
1, a
2..., a
k...;
Detailed flow chart of data processing is as follows:
At first introduce the peaked flow process of computational data.
1. at first need according to the data under the current moving window, calculate the historical data that needs preservation; The step of the historical data of generate to need preserving comprises the data fitting under the current window is become a squiggle; Calculate the value of the highest crest (being maximal value); The historical data of preserving is that value is between the highest crest and the moving window latest data, and belongs to the data of squiggle descending.
If current data sequence is A=a
1, a
2..., a
k, a
K+1..., a
n, the moving window size is n, from the right side input system, from the left side outflow system, then leftmost data are the oldest data to data along time shaft, and rightmost data are up-to-date data.Current data is fitted to a squiggle, as shown in Figure 2.This squiggle has one to several crests and trough.As seen from the figure, a ' is the data at maximum crest place, then a ' is the maximal value of current data set: A[max]=a '. the place data of establishing the rightmost side (being current up-to-date data) of this squiggle are a "; the historical data that then needs to preserve is for being designated as the data of thick line between the two; be that value is between the two; and belong to the data of squiggle descending, and can be expressed as: A[history]={ a
i| a "＜=a
i＜=a ', a
i∈ A}.
2. when new data entry system, when promptly having new data to increase, calculate the maximal value under the current window; Upgrade the historical data of preserving:
If the data that increase newly are a
NewIf,
A[max then]
New=a
New.
Under other situations, A[max then]
New=A[max], promptly maximal value is constant;
3. as data output system, promptly old data deletion, calculate the maximal value under the current window:
If the legacy data of desire deletion is a
DelIf, a
Del∈ A[history], A[max then]
New=max{a
i| a
i≠ a
Del, a
i∈ A[history] };
If a
Del A[history], A[max then]
New=A[max];
4. when new data entry system, when promptly having new data to increase, upgrade the historical data of preserving
If the data that increase newly are a
NewIf,
A[history]
new＝a
new。
Under other situations, A[history then]
New={ a
i| a
New＜a
i＜=a ', a
i∈ A[history] }+a
New
5. as data output system, promptly old data deletion upgrades the historical data of preserving.
If the legacy data of desire deletion is a
DelIf, a
Del∈ A[history], A[history then]
New=A[history]-a
Del
If a
Del A[history], A[history then]
New=A[history];
The method of calculated minimum is basic identical with the peaked method of calculating, only need make following modification:
1. will need to calculate the value that the value of high crest changes minimum trough into;
2. the historical data of Bao Cuning is between minimum trough and moving window latest data and the data that belong to the squiggle upward slope of value;
3. the peaked part of other corresponding calculated changes calculated minimum into and gets final product.
Explanation at last: top description is to be used to realize the present invention and embodiment, and scope of the present invention should not described by this and limit.It should be appreciated by those skilled in the art,, all belong to claim of the present invention and come restricted portion in any modification or partial replacement that does not depart from the scope of the present invention.
Claims (13)
1, the method for data flow maximum value and minimum value under the calculating moving window is characterized in that step comprises as follows:
The generation step that saves historical data: the data stream under the current moving window is calculated, and generating needs the historical data of preserving;
Calculate current maximal value or minimum value step: when increasing new data or deletion legacy data, the historical data of these data and preservation relatively calculates current maximal value or minimum value;
Upgrade the historical data step: increase or the legacy data deletion according to new data, upgrade the historical data that to preserve.
2, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1 is characterized in that the described step that saves historical data: the data fitting under the current window is become a squiggle; Calculate the highest crest value in the squiggle or calculate minimum trough value; The historical data that the calculating maximal value need be preserved is the data of value between the value of the highest crest and latest data, and belongs to the data of the descending of squiggle; The historical data that calculated minimum need be preserved is the data of value between the value of minimum trough and latest data, and belongs to the data of the upward slope of squiggle.
3, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, maximal value step after described calculating new data increases comprises: new data and historical data are compared, if smaller or equal to the maximal value in the historical data, then maximal value is constant; Otherwise maximal value is new data.
4, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, minimum value step after described calculating new data increases comprises: new data and historical data are compared, if more than or equal to the minimum value in the historical data, then minimum value is constant; Otherwise minimum value is new data.
5, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, maximal value step after the described calculating legacy data deletion comprises: judge whether legacy data belongs to the historical data of preservation, then maximal value is constant not belong to the historical data of preservation, and then legacy data and historical data be relatively for the historical data that belongs to preservation; If legacy data is not the historical data maximal value, then maximal value is constant; Otherwise the historical data maximal value behind this legacy data of calculating deletion is as current maximal value.
6, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, minimum value step after the described calculating legacy data deletion comprises: judge whether legacy data belongs to the historical data of preservation, if do not belong to the historical data of preservation then the legacy data minimum value is constant, if belong to the historical data of preservation, then legacy data and historical data compare, if legacy data is not the historical data minimum value, then minimum value is constant; Otherwise the historical data minimum value behind the calculating deletion legacy data is as current minimum value.
7, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, described new data increases the back and upgrades the historical data step: preserve the data of value between the new data of the highest crest and increase, and the data of descending that belong to squiggle are as historical data.
8, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, described new data increases the back and upgrades the historical data step: preserve the data of value between the new data of minimum trough and increase, and the data of upward slope that belong to squiggle are as historical data.
9, the method for data flow maximum value and minimum value under the calculating moving window according to claim 1, it is characterized in that, the step of historical data is upgraded in described legacy data deletion back: judge whether legacy data belongs to the historical data of preservation, if do not belong to then historical data is constant; If belong to then delete historical data behind the legacy data as new historical data.
10, a kind of system of calculating data flow maximum value and minimum value under the moving window is characterized in that: comprising: calculate minimum and maximum value device (1), history data repository (2), upgrade historical data device (3), data input pin (4), data output end (5); Calculating minimum and maximum value device (1) is connected with data output end (5) with data input pin (4) respectively, data input pin (4) promptly has new data to enter moving window, the data that data output end (5) is promptly had been friends in the past shift out moving window, also be that data increase and data deletion, calculate minimum and maximum value device (1) and compare the current minimum and maximum value of acquisition according to the current historical data of history data repository (2) input and the increase data or the deleted data of external data input end (4) and data output end (5) input; Two output terminals of history data repository (2) are connected with the input end that calculates minimum and maximum value device (1) with the input end that upgrades historical data device (3) respectively, history data repository (2) submits to historical data to give renewal historical data device (3), and obtain the historical data that current up-to-date need keep, and the historical data of preserving submitted to calculate minimum and maximum value device (1) to obtain current minimum and maximum value from upgrading historical data device (3); Upgrade historical data device (3) and be connected with data output end (5) with two external data input ends (4) respectively, data input pin (4) and data output end (5) are respectively that data increase and data deletion; Upgrade the input end of historical data device (3) and the input end and the output terminal interconnection of output terminal and history data repository (2), upgrade the historical data that historical data device (3) at first obtains to preserve from history data repository (2), be to increase new data or deletion legacy data according to external data input end (4) and data output end (5) then, the historical data that the need that calculating makes new advances keep outputs it to history data repository (2) and preserves.
11, the system of data flow maximum value and minimum value under the calculating moving window according to claim 10, it is characterized in that: described minimum and maximum value device (1) comprising: read historical data device (1.1), calculation element (1.2), read that historical data device (1.1) reads historical data and from saving historical data, read historical data device (1.1) to calculation element (1.2) input historical data and the data that increase or delete, calculation element (1.2) calculates and output data and maximum or minimum value.
12, the system of data flow maximum value and minimum value under the calculating moving window according to claim 10 is characterized in that: described historical data device (2) comprises that the historical data of preservation feeds storer (2.1); Storer (2.1) feeds submission historical data device (2.2) with the historical data of preserving and historical data is exported.
13, the system of data flow maximum value and minimum value under the calculating moving window according to claim 10, it is characterized in that: described renewal historical data device (3) comprising: with the data fitting device (3.1) under the current window; Calculate the highest crest or minimum trough device (3.2); The device that calculating saves historical data (3.3), data fitting device (3.1) receives and output data, data fitting device (3.1) with calculate the highest crest or minimum trough device (3.2) and be connected and export the highest crest value or minimum trough value, the highest crest value or minimum trough value feed device (3.3) that calculating saves historical data and make it the calculating output historical data that saves historical data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100756480A CN100487698C (en) | 2006-04-17 | 2006-04-17 | Method and system for calculating data flow maximum value and minimum value under sliding window |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100756480A CN100487698C (en) | 2006-04-17 | 2006-04-17 | Method and system for calculating data flow maximum value and minimum value under sliding window |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101059802A true CN101059802A (en) | 2007-10-24 |
| CN100487698C CN100487698C (en) | 2009-05-13 |
Family
ID=38865908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100756480A Expired - Fee Related CN100487698C (en) | 2006-04-17 | 2006-04-17 | Method and system for calculating data flow maximum value and minimum value under sliding window |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100487698C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771398A (en) * | 2008-12-29 | 2010-07-07 | 上海申瑞电力科技股份有限公司 | Quadrilateral mutation filtering method for telemetry data |
| CN101908065A (en) * | 2010-07-27 | 2010-12-08 | 浙江大学 | On-line attribute abnormal point detecting method for supporting dynamic update |
| CN104012055A (en) * | 2012-12-13 | 2014-08-27 | 华为技术有限公司 | Method and apparatus processing data |
| CN108153591A (en) * | 2017-12-05 | 2018-06-12 | 深圳竹信科技有限公司 | Data flow real-time processing method, device and storage medium |
| CN109655020A (en) * | 2019-01-14 | 2019-04-19 | 北方民族大学 | One tooth footpath of gear is to comprehensive deviation and tangential comprehensive deviation detection method |
| CN112416930A (en) * | 2020-11-18 | 2021-02-26 | 国家基础地理信息中心 | Query method, storage method and related device for mixed time phase image map data |
| CN114333251A (en) * | 2021-12-29 | 2022-04-12 | 成都中科慧源科技有限公司 | Intelligent alarm, method, system, equipment and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11591936B2 (en) | 2019-09-04 | 2023-02-28 | Saudi Arabian Oil Company | Systems and methods for proactive operation of process facilities based on historical operations data |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5319583A (en) * | 1992-06-22 | 1994-06-07 | General Electric Company | Digital computer sliding-window minimum filter |
| JP2003529810A (en) * | 1999-03-24 | 2003-10-07 | ノキア ネットワークス オサケ ユキチュア | System and method for determining minimum and maximum values using last occurrence and sliding window technique |
| CN1136667C (en) * | 2000-07-25 | 2004-01-28 | 华为技术有限公司 | Data selecting method and device |
| US20030212652A1 (en) * | 2002-05-10 | 2003-11-13 | Gold Kevin C. | Max, min determination of a two-dimensional sliding window of digital data |
-
2006
- 2006-04-17 CN CNB2006100756480A patent/CN100487698C/en not_active Expired - Fee Related
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771398A (en) * | 2008-12-29 | 2010-07-07 | 上海申瑞电力科技股份有限公司 | Quadrilateral mutation filtering method for telemetry data |
| CN101771398B (en) * | 2008-12-29 | 2013-11-06 | 上海申瑞继保电气有限公司 | Quadrilateral mutation filtering method for telemetry data |
| CN101908065A (en) * | 2010-07-27 | 2010-12-08 | 浙江大学 | On-line attribute abnormal point detecting method for supporting dynamic update |
| CN104012055A (en) * | 2012-12-13 | 2014-08-27 | 华为技术有限公司 | Method and apparatus processing data |
| CN104012055B (en) * | 2012-12-13 | 2017-04-12 | 华为技术有限公司 | Method and apparatus processing data |
| CN108153591A (en) * | 2017-12-05 | 2018-06-12 | 深圳竹信科技有限公司 | Data flow real-time processing method, device and storage medium |
| CN109655020A (en) * | 2019-01-14 | 2019-04-19 | 北方民族大学 | One tooth footpath of gear is to comprehensive deviation and tangential comprehensive deviation detection method |
| CN112416930A (en) * | 2020-11-18 | 2021-02-26 | 国家基础地理信息中心 | Query method, storage method and related device for mixed time phase image map data |
| CN114333251A (en) * | 2021-12-29 | 2022-04-12 | 成都中科慧源科技有限公司 | Intelligent alarm, method, system, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100487698C (en) | 2009-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101059802A (en) | Method and system for calculating data flow maximum value and minimum value under sliding window | |
| WO2021052177A1 (en) | Log parsing method and device, server and storage medium | |
| Wu et al. | LSII: An indexing structure for exact real-time search on microblogs | |
| CN1932812A (en) | Method and apparatus for holding journal | |
| CN1975725A (en) | Method and system for managing journal | |
| US20040181533A1 (en) | Pre-formatted column-level caching to improve client performance | |
| CA2441607A1 (en) | Systems and methods for content delivery over a wireless communication medium to a portable computing device | |
| CN101034412A (en) | Information storing method, information search method and engine device | |
| CN101064730A (en) | Local and remote backup method for computer network data file | |
| CN101075239A (en) | Composite searching method and system | |
| CN102023978B (en) | Mass data processing method and system | |
| US20040181514A1 (en) | Byte-code representations of actual data to reduce network traffic in database transactions | |
| CN110069478A (en) | Multi-source heterogeneous data integrated system towards medical big data | |
| CN111737355A (en) | MongoDB metadata management-based heterogeneous data source synchronization method and system | |
| CN101046858A (en) | Electronic information comparing system and method and anti-garbage mail system | |
| CN1542627A (en) | System for reducing access actions of cache label array and method thereof | |
| CN107517266A (en) | A kind of instant communication method based on distributed caching | |
| CN110704439A (en) | Data storage method and device | |
| CN101043353A (en) | Process for improving data-handling efficiency of network management system | |
| CN115865099B (en) | Huffman coding-based multi-type data segment compression method and system | |
| CN1330326A (en) | Device and method for providing quick information service for multiple equipments | |
| CN1809054A (en) | SIP message based text decoder | |
| CN101051991A (en) | Data pushing system and method | |
| CN101075308A (en) | Method for editing e-mail | |
| CN110716900A (en) | Data query method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090513 Termination date: 20200417 |