CN102662988B - Method for filtering redundant data of RFID middleware - Google Patents
Method for filtering redundant data of RFID middleware Download PDFInfo
- Publication number
- CN102662988B CN102662988B CN201210066651.1A CN201210066651A CN102662988B CN 102662988 B CN102662988 B CN 102662988B CN 201210066651 A CN201210066651 A CN 201210066651A CN 102662988 B CN102662988 B CN 102662988B
- Authority
- CN
- China
- Prior art keywords
- data
- rfid data
- rfid
- hash table
- label
- 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.)
- Expired - Fee Related
Links
- 238000001914 filtration Methods 0.000 title claims abstract description 32
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000008569 process Effects 0.000 claims abstract description 10
- 230000005540 biological transmission Effects 0.000 claims abstract description 8
- 230000006870 function Effects 0.000 claims description 12
- 238000013507 mapping Methods 0.000 claims description 11
- 239000011159 matrix material Substances 0.000 claims description 3
- 238000012545 processing Methods 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 5
- 238000012217 deletion Methods 0.000 description 3
- 230000037430 deletion Effects 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method for filtering redundant data of RFID middleware, which comprises: creating a multistage hash table used for storing RFID data in the memory, wherein label nodes of the RFID being created in the multistage hash table; determining whether or not a RFID data flow exists , if not, the process is ended, if so, ending the process if the RFID does not exist and performing the next step if the RFID exists; determining all states of RFID data in the RFID data flow; and filtering theredundant data in the light of the states of the RFID data. Through establishing establishing the multistage hash table in the memory, distributing the RFID data received by the middleware tothe multistage hash table, and filtering the redundant data, the method realizes filtering of mass redundancy RFID data. This invention achieves mass redundancy RFID data filtering and substantially reduces the transmission quantity of a network, thereby providing more valuable and cleaner RFID data to upper level applications. The method substantially improves the RFID data filtering efficiency by using the storage structure of the multistage hash table.
Description
Technical field
The present invention relates to field of radio frequency communication data processing method, especially a kind of redundant data filter method for RFID middleware.
Background technology
RFID(Radio Frequency Identification) be a kind of technology of utilizing radiofrequency signal and Space Coupling Technology of Multi to realize contactless automatic identification.RFID middleware, by complicacy and the kind of shielding reader, for upper system provides unified calling interface and unified data layout, provides the filtration of data simultaneously for application system, clean, and data are collected statistics etc., for operation system provides powerful support.In large-scale RFID application, the original RFID data volume that RFID reader reads in each read-write cycle is very huge, as the second generation (Gen2) the RFID reader specification that EPC global standard specifies has been made regulation to the rate of reading of reader: p.s. 1800 electronic tags.This means, a medium sized depot that has 30 readers can produce 4.8 ten thousand data in peak period one second, packet is containing the Id of reader, RFID data, the time of reading etc., general 20 bytes of its size, will produce the data of G up to a hundred every day, need data volume to be processed very huge.
How in real time valuable information that RFID data comprise is processed and how fully to be extracted to the RFID raw data of magnanimity and become the important content of RFID middleware research.And the original RFID data of collecting from reader at these, exist a large amount of repetitions, in actual application, to the real valuable significant data of operation system few, process directly original data transmission in operation system if do not added, can bring huge bandwidth waste the internal memory to system and processor to cause heavy data processing load.
The method of the RFID data of current conventional processing redundancy mainly contains two kinds, a kind ofly mainly store original RFID data by create a temporary table in database, then by looking into and change the filtration that realizes data in the additions and deletions of temporary table, the method is easy to realize, but while processing large-scale RFID data, relate to a large amount of magnetic disc i/os, inefficiency, does not have practical value.More conventional method is by open up a sheet of core buffer in middleware system, store interim RFID data, carry out redundancy filtration, because internal memory operation has the lifting of several orders of magnitude on treatment effeciency than magnetic disc i/o, and middleware needs to process in real time a large amount of RFIDRFID data, therefore require its filter algorithm to there is lower searching the time, require algorithm low to resource occupation simultaneously.Tradition redundant data filter algorithm is mainly with linear linked list; tree; queues etc. are as store data structure, and as linear linked list need travel through whole chained list searching RFID data, each inquiry all needs to expend a large amount of searching the time; tree structure needs to maintain a metastable sequence; complicated operation, time complexity can only reach O (lgn) in theory, in extensive or real-time application; still cannot meet the demand of data high-speed processing, have certain efficiency defect.
Summary of the invention
The technical problem to be solved in the present invention is: a kind of filter algorithm of multistage Hash table of the RFID of being applied to middleware is provided, carries out efficient redundant data filtration treatment with the RFID data to from reader.
In order to solve the problems of the technologies described above, the technical solution adopted in the present invention is:
For a redundant data filter method for RFID middleware, comprise the following steps:
In internal memory, create for storing the multistage Hash table from the RFID data of reader, in described multistage Hash table, create and be useful on inquiry, delete the label node of these RFID data;
Judge whether RFID data stream, finished if not process, if carry out next step;
Inquire about the label node in multistage Hash table according to the label ID of RFID data, judge the state of each RFID data in RFID data stream;
According to the state of each RFID data, it is carried out to redundant data filtration treatment.
Be further used as preferred embodiment, described label ID is the binary sequence for these RFID data of unique identification, and the memory location of described RFID data in multistage Hash table is the mapping function based on label ID.
Be further used as preferred embodiment, the label node defining in described multistage Hash table comprises: label ID, label read the time first, label last reads time and reading times.
Be further used as preferred embodiment, the state of described RFID data comprises: unknown, catch and existed; Described unknown state refers to that these RFID data do not exist in multistage Hash table; Described trap state refers to that these RFID data have existed but not confirmed in multistage Hash table; Described existence refers to that these RFID data are identified in multistage Hash table.
Be further used as preferred embodiment, describedly according to the state of each RFID data, it carried out to redundant data filtration treatment and comprise:
Under unknown state, these RFID data are stored in multistage Hash table, and be this RFID data generating labels node, these RFID data are filtered out as redundant data in whole data transmission channel, proceed to trap state;
Under trap state, what judge nearest twice RFID data reads whether overtime threshold value of mistiming, if these RFID data are removed and proceed to unknown state from multistage Hash table, upgrade if not the label node of these RFID data and judge whether the reading times of these RFID data reaches frequency threshold value, keep trap state if do not reach frequency threshold value, these RFID data are filtered out as redundant data, these RFID data are added to output queue if reach frequency threshold value, offer upper system as the clean data after filtering, and proceed to existence,
Under existence, what judge nearest twice RFID data reads whether overtime threshold value of mistiming, if these RFID data are removed and proceed to unknown state from multistage Hash table, upgrade if not the label node of these RFID data and directly these RFID data filtered out as redundant data.
Be further used as preferred embodiment, the establishment of described multistage Hash table comprises the following steps:
Be defined in the label node of storing RFID data in multistage Hash table, described label node comprises: label ID, label read the time first, label last reads time and reading times;
Setting-up time threshold value, frequency threshold value and label data scale, described time threshold is characterized in this time RFID data and is repeatedly read and regards as repeating data; It is to stablize data that described frequency threshold value characterizes the RFID data of only having reading times to reach this numerical value; Described label data scale characterizes the capacity of this multistage Hash table interior label node;
Set maximum barrelage M and the exponent number N of multistage Hash table;
In internal memory, apply for M*N storage space, with two-dimensional array HashTable[M] [N] represent, as the Hash matrix of storage RFID data;
Set up the corresponding relation of RFID data and this RFID data memory location in multistage Hash table with the mapping function based on label ID.
Be further used as preferred embodiment, described time threshold, frequency threshold value and label data scale can be adjusted.
The invention has the beneficial effects as follows: the present invention by setting up multistage Hash table in internal memory, the RFID data allocations that middleware is received is in multistage Hash table, and carry out redundant data filtration treatment by the state that judges these RFID data, realize the filtration of magnanimity redundancy RFID data, greatly reduce the transmission quantity of network, thereby for upper layer application provides more totally, more valuable RFID data, and the inventive method, by utilizing the storage organization of multistage Hash table, has promoted the filtration efficiency of RFID data greatly.
Brief description of the drawings
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described further:
Fig. 1 is the flow chart of steps of the present invention for the redundant data filter method of RFID middleware;
Fig. 2 is the state machine structural representation of RFID data of the present invention;
Fig. 3 is the process flow diagram that the multistage Hash table of the present invention creates;
Fig. 4 is the structural representation of the multistage Hash table of the present invention;
Fig. 5 is the flow chart of steps that the present invention is based on the redundant data filter method preferred embodiment of multistage Hash table;
Fig. 6 is the data storing schematic diagram of multistage Hash table structure in the preferred embodiment of the present invention.
Embodiment
The present invention's employing is set up multistage Hash table and is carried out the RFID data that storing received arrives in internal memory, and carries out redundant data filtration treatment according to the state of each RFID data, can filter out efficiently the RFID data of repetition.
With reference to Fig. 1, a kind of redundant data filter method for RFID middleware, comprises the following steps:
In internal memory, create for storing the multistage Hash table from the RFID data of reader, in described multistage Hash table, create and be useful on inquiry, delete the label node of these RFID data;
Judge whether RFID data stream, finished if not process, if carry out next step;
Inquire about the label node in multistage Hash table according to the label ID of RFID data, judge the state of each RFID data in RFID data stream;
According to the state of each RFID data, it is carried out to redundant data filtration treatment.
Be further used as preferred embodiment, the label node defining in described multistage Hash table comprises: label ID, label read time tFirstRead first, label last reads time tLastRead and reading times tagCnt.
Described label ID is the binary sequence for these RFID data of unique identification, and the memory location of described RFID data in multistage Hash table is the mapping function based on label ID.
With reference to Fig. 2, be further used as preferred embodiment, the state of described RFID data comprises: unknown (unknown), catch (captured) and had (observed); Described unknown state refers to that these RFID data do not exist in multistage Hash table; Described trap state refers to that these RFID data have existed but not confirmed in multistage Hash table; Described existence refers to that these RFID data are identified in multistage Hash table.
Be further used as preferred embodiment, the form of the RFID data of obtaining from reader in the present invention is limited, described RFID data comprise: the timestamp of Reader ID, RFID data encoding and RFID data.Now illustrate, the form of supposing RFID data is all with <reader, epc, time> tlv triple exists as metadata, reader represents Reader ID, epc represents RFID data encoding, both can unique identification, and time is the timestamp that represents that reader is read.Reader is, with such form, RFID data are sent to middleware.
Be further used as preferred embodiment, describedly according to the state of these RFID data, it carried out to redundant data filtration treatment and comprise:
Before RFID data are read first, RFID data are in unknown state; When middleware receives RFID data <reader, epc, when time>, whether first from multistage Hash table, search these RFID data exists by mapping function, judge that if find these RFID data, in catching or existence, judge that if do not find these RFID data are in unknown state;
Under unknown state, these RFID data are stored in multistage Hash table according to mapping function, and be this RFID data generating labels node, setting label node data is tagCnt=1, upgrading tFirstRead and tLastRead is the current time of reading currentTime.These RFID data are filtered out as redundant data in whole data transmission channel, proceed to trap state;
Under trap state, what judge nearest twice RFID data reads whether overtime threshold value of mistiming, if these RFID data are removed and proceed to unknown state from multistage Hash table, upgrade if not the label node of these RFID data and judge whether the reading times of these RFID data reaches frequency threshold value, keep trap state if do not reach frequency threshold value, these RFID data are filtered out as redundant data, these RFID data are added to output queue Queue if reach frequency threshold value, offer upper system as the clean data after filtering, and proceed to existence,
Under existence, what judge nearest twice RFID data reads whether overtime threshold value of mistiming, if these RFID data are removed and proceed to unknown state from multistage Hash table, upgrade if not the label node of these RFID data and directly these RFID data filtered out as redundant data.
Be further used as preferred embodiment, with reference to Fig. 3, the establishment of described multistage Hash table comprises the following steps:
Be defined in the label node of storing RFID data in multistage Hash table, described label node comprises: label ID, label read time tFirstRead first, label last reads time tLastRead and reading times tagCnt;
The form of label node for example, can be set in actual applications as follows:
struct?TagNode
{
TagId: long // label ID is also the key of Hash table
TFirstRead:time // expression label node is read the time first, as time threshold
thresholdtiming initial time
TLastRead:time // record the time that label node reads for the last time
TagCnt:long // record label node at a time threshold
thresholdthe number of times reading
}
Setting-up time threshold value
threshold, frequency threshold value TagCnt
thresholdand label data scale DataScaleSize, described time threshold
thresholdbe characterized in this time RFID data and be repeatedly read and regard as repeating data, can directly filter out.If the time difference reading double exceeds this time threshold
threshold, think different events.This value can be adjusted according to actual service conditions, and obtaining static data can its threshold value of corresponding increase as scanning stock, and obtaining dynamic data needs to turn down this threshold value as the RFID data of transport tape.
Described frequency threshold value TagCnt
thresholdsign only has RFID data that reading times reaches this numerical value for stablize data, and just confirmation reads this RFID data, if think that lower than this threshold value the data of misreading, this threshold value can adjust according to actual business; Described label data scale DataScaleSize characterizes the capacity of this multistage Hash table interior label node;
Set maximum barrelage M and the exponent number N of multistage Hash table; Described maximum barrelage M sets according to label data scale DataScaleSize, operated by rotary motion M=2*DataScaleSize, and the exponent number N of definite Hash table simultaneously, generally unsuitable excessive, if excessive, multistage Hash table may be degenerated to multilinked list.
In internal memory, apply for M*N storage space, with two-dimensional array HashTable[M] [N] represent, and as the Hash matrix of storage RFID data, wherein N represents the exponent number of Hash table, and M represents the maximum barrelage of Hash table;
Set up the corresponding relation of RFID data and this RFID data memory location in multistage Hash table with the mapping function based on label ID, because RFID data are unique, the key that enters multistage Hash table as it using label ID, sets up mapping function f, calculates f (tagId)=(tagId+M) % primTable[n], wherein tagId is label ID, M is the maximum barrelage of Hash table, primTable[n] represent the barrelage of this rank Hash table, n=1,2,3 ... N.With reference to Fig. 4, calculate the barrelage primTable[n of every rank Hash table], get front n and be less than the prime number of maximum barrelage M as the barrelage on every rank, from big to small successively as the barrelage on each rank, and be stored in array primTable, the object of this practice is the hash-collision that provides less.
The f (tagId) calculating, as hash value, is the memory address of these RFID data in this rank Hash bucket.By mapping function f, for multistage Hash table provides the method for inquiry, amendment, deletion and the increase of RFID data.
Preferably, described time threshold
threshold, frequency threshold value TagCnt
thresholdand label data scale DataScaleSize can adjust according to practical situations.
Fig. 5 is the flow chart of steps that the present invention is based on the preferred real embodiment of redundant data filter method of multistage Hash table, with reference to Fig. 5:
According to actual RFID traffic use, determine default parameter, comprise getting and effectively read time threshold
threshold, confirm the effective frequency threshold value TagCnt of data
threshold, and label data scale DataScaleSize creates multistage Hash table in internal memory, and create to RFID data inquire about, revise, the label node of the operation such as deletion.
As shown in Figure 2, define the state machine of the state conversion of RFID data, determine the criterion of RFID data filtering.
When there being RFID data <reader
n, epc
n, time
nwhen > arrives, first confirm the state of these RFID data, exist in Hash table by inquiring about these RFID data, and the time of reading, and confirm with reading times.
And before further confirming the state of RFID data, need to first judge that whether these RFID data are in effectively reading in interval, if the i.e. up-to-date time of reading and the last interval overtime threshold value that reads
thresholdif, exceeding the record that reads of RFID data before representing and lost efficacy, it is as reading and process first.
these RFID data, not in Hash table, represent that these RFID data are in unknown state;
these RFID data, in Hash table, but are less than and confirm the effective reading times threshold value of data effectively reading reading times in the time, represent that these RFID data are in captured state;
these RFID data, in Hash table, but are greater than and confirm the effective reading times threshold value of data effectively reading reading times in the time, represent that these RFID data are in observed state.
After determining the state of RFID data, this label node in Hash table up-to-date read to the time and reading times is upgraded, by checking total read-write number of times of label node and the time interval of reading, as shown in Figure 2, determine the state conversion process of RFID data.
when RFID data are during in unknown state, it is added in multistage Hash table by establishing the memory location that function f calculates, the reading times tagCnt that sets it is 1 time, upgrading tFirstRead and tLastRead is the current time of reading currentTime, and these RFID data are temporarily filtered out and proceed to captured state as redundant data.
when RFID data are during in captured state, show to have existed these RFID data in multistage Hash table, whether judgement reads the time interval at time threshold
thresholdin, if currentTime-tLastRead>
threshold, show that these RFID data lost efficacy, be updated to unknown state, and by data filtering processing; If currentTime-tLastRead≤
threshold, upgrading reading times tagCnt=tagCnt+1, tLastRead is currentTime, then judges whether reading times tagCnt just arrives the frequency threshold value TagCnt effectively reading
thresholdif just, these RFID data proceed to observed state, these RFID data add in queue Queue as the clean data after filtering, for upper-layer service system call; If be less than the frequency threshold value TagCnt effectively reading
threshold, these RFID data are still in observed state, and now these RFID data, still as unstable data, are temporarily filtered out.
when RFID data are during in observed state, show in multistage Hash table, to have had these RFID data, and the number of times of reading exceedes frequency threshold value, now again read this RFID data, whether judgement reads the time interval at time threshold
thresholdin, if currentTime-tLastRead>
threshold, show that these RFID data lost efficacy, be updated to unknown state, and by data filtering processing; If currentTime-tLastRead≤
threshold, upgrading reading times tagCnt=tagCnt+1, tLastRead is currentTime, and these RFID data filter out as redundant data, and in actual application, most RFID data are all in this state.
This method, by the filtration channel using multistage Hash table as RFID middleware, has effectively realized the accurate filtration of magnanimity redundancy RFID data fast, has greatly reduced the transmission quantity of network, has reduced the data processing scale of business, has saved a large amount of processing times.
Below in conjunction with Fig. 6, example of the present invention is once described.
The first step, is configured with parameters in close relations such as scenes with RFID practical application scale for more of the present invention, the definite time threshold that effectively reads of this example
thresholdfor 100s, effectively reading times threshold value TagCnt
thresholdbe set to 5, the exponent number of Hash bucket is 10, supposes that label data scale DataScaleSize is 10000, and establishing maximum Hash barrelage M is 20000, can be with two-dimensional array HashTable[20000] [10] represent.
Calculate the barrelage on every rank, in this example, using 20000 as maximum barrelage, the barrelage of every 1 rank to the 10 rank Hash buckets is set as 19997,19993 successively, 19991,19979,19973,19963,19961,19949,19937,19927, be stored in primTable array.
If have a collection of RFID data to arrive at 10S simultaneously, as 100 label ID values RFID data that are 0000000100, 99 RFID data that label ID value is 000000099, 98 RFID data that label ID value is 00000000098, 2 RFID data that label ID value is 0000000002, 1 RFID data that label ID value is 0000000001, the RFID data that are 0000000100 for label ID value for example, according to f (tagId)=(tagId+M) % primTable[n], it is at the index position index=(100+20000) of the first rank Hash bucket % 19997, be the first Hash bucket position, rank 103, in like manner 0000000099 in position 102, 0000000098 in position 101 0000000001 in position 4.
Because it is 5 times that the threshold value of effective degree is read in setting, 5 following RFID data are all only stored in Hash table, do not export.After filtering, output, in queue, only has (0000000100,000000099 ... 000000006,000000005) totally 96 RFID data values, the scale of data lowers greatly.
The RFID data that label ID value scope is 000000005-0000000100 are now all located observed state, if now arrive middleware in the RFID of this scope data, it will be redundant data and filter out.
The RFID data of label ID value 000000001-000000004 are in captured state, if the RFID data that now label ID value is 0000000004 pass to middleware, its value just arrives the threshold value of effective degree, it will join in queue as clean data, and its RFID data transfer observed state to.If there are the RFID data that label ID value is 0000000003 to arrive, total read-write number of times only has 4 times, and still in captured state, it is still filtered as unstable data.
The RFID data that label ID value is 000000101 if now have arrive, because in Hash table not these RFID data read record, so in unknown state, now added in Hash table before reading, this RFID data mode also transfers captured to.
If effectively read time threshold at 100s
thresholdin, all do not have the RFID data that label ID value is 0000000100 to read record, after 101s, when the RFID data that label ID value is 0000000100 are read again, effectively read time threshold owing to exceeding, so these RFID data read and record reality and lost efficacy, in unknow state, now again read,, as reading processing first, its reading times is set to 1, reads the time first, the up-to-date time of reading all can be set to the current time, and these RFID data will proceed to captured state.
The RFID data that label ID value is 000020097 if now have arrive, calculate since the first rank Hash table, its index=(20097+20000) % 19997 its values are 103, because the RFID data of this barrel existing 0000000100, in hash-collision, then calculate the 2nd rank, its index=(20097+20000) % 19993, its value is 111, so these RFID data are stored in the position that the index position of second-order is 111.
The present invention, by constructing the data structure of multistage Hash table as the pipeline of filtration, has realized the filtration of magnanimity redundancy RFID data, has greatly reduced the transmission quantity of network, thereby for upper layer application provides more clean, valuable RFID data.
The present invention is by the state of definition RFID data, by setting-up time threshold value and reading times threshold value, can effectively filter those born unstable due to RFID technology, and unreliable brought misreads, and the situations such as mutiread are brought cleaner data.
According to the evaluation criterion of algorithm, the quality of weighing a data processing algorithm mainly contains the parameter of three aspects: time complexity, space complexity and average length of search.
Three evaluation indexes of the present invention are as follows:
time complexity: the present invention adopts multistage Hash table, the scale of Dynamic Matching RFID data, effectively utilize the unique characteristic of RFID data, using its label ID as key, in the multistage Hash table of design, making the number of the bucket on every rank is prime numbers, utilize like this number of key% bucket to draw the index position at Hash bucket, make each RFID data in the enough scatterings in the position of Hash table, at utmost reduce conflict, realize simple, through test comparison, its search efficiency can maintain the constant order of magnitude, it is the time complexity of O (1), than the O (n) of linear linked list, the O (lgn) of tree construction, efficiency has the lifting of matter by contrast.
space complexity: the essence of hash function is being traded space for time, by introducing multiple Hash buckets as auxiliary space, space complexity is O (n)
average length of search: average length of search refers to the search length of all nodes in a structure by the weighted value of searching probability.General in the situation that, the present invention all can find by Hash mapping the memory location of target labels within the time of constant.The worst situation is need to search n time exactly, and n represents the exponent number of Hash table.
More than that better enforcement of the present invention is illustrated, but the invention is not limited to described embodiment, those of ordinary skill in the art can also make all equivalent variations or replacement under the prerequisite without prejudice to spirit of the present invention, and the distortion that these are equal to or replacement are all included in the application's claim limited range.
Claims (4)
1. for a redundant data filter method for RFID middleware, it is characterized in that, comprise the following steps:
In internal memory, create for storing the multistage Hash table from the RFID data of reader, in described multistage Hash table, create and be useful on inquiry, delete the label node of these RFID data;
Judge whether RFID data stream, finished if not process, if carry out next step;
Inquire about the label node in multistage Hash table according to the label ID of RFID data, judge the state of each RFID data in RFID data stream, the state of described RFID data comprises: unknown, catch and existed; Described unknown state refers to that these RFID data do not exist in multistage Hash table; Described trap state refers to that these RFID data have existed but not confirmed in multistage Hash table; Described existence refers to that these RFID data are identified in multistage Hash table;
According to the state of each RFID data, it is carried out to redundant data filtration treatment, comprising:
Under unknown state, these RFID data are stored in multistage Hash table, and be this RFID data generating labels node, these RFID data are filtered out as redundant data in whole data transmission channel, proceed to trap state;
Under trap state, what judge nearest twice RFID data reads whether overtime threshold value of mistiming, if these RFID data are removed and proceed to unknown state from multistage Hash table, upgrade if not the label node of these RFID data and judge whether the reading times of these RFID data reaches frequency threshold value, keep trap state if do not reach frequency threshold value, these RFID data are filtered out as redundant data, these RFID data are added to output queue if reach frequency threshold value, offer upper system as the clean data after filtering, and proceed to existence,
Under existence, what judge nearest twice RFID data reads whether overtime threshold value of mistiming, if these RFID data are removed and proceed to unknown state from multistage Hash table, upgrade if not the label node of these RFID data and directly these RFID data filtered out as redundant data;
The establishment of described multistage Hash table comprises the following steps:
Be defined in the label node of storing RFID data in multistage Hash table, described label node comprises: label ID, label read the time first, label last reads time and reading times;
Setting-up time threshold value, frequency threshold value and label data scale, described time threshold is characterized in this time RFID data and is repeatedly read and regards as repeating data; It is to stablize data that described frequency threshold value characterizes the RFID data of only having reading times to reach this numerical value; Described label data scale characterizes the capacity of this multistage Hash table interior label node;
Set maximum barrelage M and the exponent number N of multistage Hash table;
In internal memory, apply for M*N storage space, with two-dimensional array HashTable[M] [N] represent, as the multistage Hash matrix of storage RFID data;
Set up the corresponding relation of RFID data and this RFID data memory location in multistage Hash table with the mapping function based on label ID.
2. a kind of redundant data filter method for RFID middleware according to claim 1, it is characterized in that: described label ID is the binary sequence for these RFID data of unique identification, the memory location of described RFID data in multistage Hash table is the mapping function based on label ID.
3. a kind of redundant data filter method for RFID middleware according to claim 1, is characterized in that: the label node defining in described multistage Hash table comprises: label ID, label read the time first, label last reads time and reading times.
4. a kind of redundant data filter method for RFID middleware according to claim 1, is characterized in that: described time threshold, frequency threshold value and label data scale can be adjusted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210066651.1A CN102662988B (en) | 2012-03-14 | 2012-03-14 | Method for filtering redundant data of RFID middleware |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210066651.1A CN102662988B (en) | 2012-03-14 | 2012-03-14 | Method for filtering redundant data of RFID middleware |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102662988A CN102662988A (en) | 2012-09-12 |
| CN102662988B true CN102662988B (en) | 2014-10-29 |
Family
ID=46772479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210066651.1A Expired - Fee Related CN102662988B (en) | 2012-03-14 | 2012-03-14 | Method for filtering redundant data of RFID middleware |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102662988B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104077673B (en) * | 2013-03-28 | 2018-12-28 | 中国科学院信息工程研究所 | A kind of large numbers of items centralized monitoring method based on RFID technique |
| CN103530383A (en) * | 2013-10-18 | 2014-01-22 | 重庆邮电大学 | Method for filtering safe RFID middleware redundant data |
| CN103646107B (en) * | 2013-12-25 | 2017-02-08 | 重庆梅安森科技股份有限公司 | RFID (Radio Frequency Identification) middleware event handling method used in coal safety supervision and management system |
| CN104766108A (en) * | 2015-03-06 | 2015-07-08 | 中国十七冶集团有限公司 | Optimizing processing method for FID electronic tag in BIM model |
| CN104766107A (en) * | 2015-03-06 | 2015-07-08 | 中国十七冶集团有限公司 | System utilizing RFID electronic product code to collect data in BIM |
| CN105228185B (en) * | 2015-09-30 | 2017-03-22 | 中国人民解放军国防科学技术大学 | Method used for identifying identity of fuzzy redundant node in communication network |
| CN105760413B (en) * | 2015-12-07 | 2018-10-23 | 重庆川仪自动化股份有限公司 | Management method based on the RFID data of Hash table in MES system |
| CN106411654A (en) * | 2016-10-27 | 2017-02-15 | 任子行网络技术股份有限公司 | Method and device for processing network traffic analysis |
| CN108133597B (en) * | 2018-01-26 | 2020-07-07 | 江苏本能科技有限公司 | Radio frequency identification information uploading method and system |
| CN111065190B (en) * | 2019-12-05 | 2022-01-28 | 华北水利水电大学 | Intelligent light control method and system based on Zigbee communication |
| CN112183141B (en) * | 2020-10-09 | 2024-05-14 | 北京计算机技术及应用研究所 | Open space RFID multi-antenna system data acquisition and cleaning method |
| CN113656662A (en) * | 2021-08-13 | 2021-11-16 | 浙江工业大学 | Redundant data cleaning method for RFID data stream |
| CN114398405A (en) * | 2022-01-18 | 2022-04-26 | 政采云有限公司 | Method, device and medium for processing repeated data |
| CN116578758B (en) * | 2023-07-12 | 2023-12-05 | 深圳汉德霍尔科技有限公司 | RFID data acquisition and data processing method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075193A (en) * | 2011-02-11 | 2011-05-25 | 中国科学院软件研究所 | Method based on time and position relationship for compressing and uncompressing RFID events |
| CN102156893A (en) * | 2011-03-24 | 2011-08-17 | 大连海事大学 | Cleaning system and method thereof for data acquired by RFID device under network |
| CN102184229A (en) * | 2011-05-11 | 2011-09-14 | 中国科学院软件研究所 | Memory data storage method of huge RFID (Radio Frequency Identification Device) label information |
| US20110282812A1 (en) * | 2010-05-17 | 2011-11-17 | Microsoft Corporation | Dynamic pattern matching over ordered and disordered data streams |
-
2012
- 2012-03-14 CN CN201210066651.1A patent/CN102662988B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110282812A1 (en) * | 2010-05-17 | 2011-11-17 | Microsoft Corporation | Dynamic pattern matching over ordered and disordered data streams |
| CN102075193A (en) * | 2011-02-11 | 2011-05-25 | 中国科学院软件研究所 | Method based on time and position relationship for compressing and uncompressing RFID events |
| CN102156893A (en) * | 2011-03-24 | 2011-08-17 | 大连海事大学 | Cleaning system and method thereof for data acquired by RFID device under network |
| CN102184229A (en) * | 2011-05-11 | 2011-09-14 | 中国科学院软件研究所 | Memory data storage method of huge RFID (Radio Frequency Identification Device) label information |
Non-Patent Citations (4)
| Title |
|---|
| 史喜阳.嵌入式RFID数据采集方案及其关键技术研究.《重庆大学硕士学位论文》.2009,46-51. |
| 基于RFID Reader的过滤技术的设计与实现;杨大宇;《上海交通大学硕士学位论文》;20080229;全文 * |
| 嵌入式RFID数据采集方案及其关键技术研究;史喜阳;《重庆大学硕士学位论文》;20090630;46-51 * |
| 杨大宇.基于RFID Reader的过滤技术的设计与实现.《上海交通大学硕士学位论文》.2008,全文. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102662988A (en) | 2012-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102662988B (en) | Method for filtering redundant data of RFID middleware | |
| US9280551B2 (en) | De-duplication deployment planning | |
| CN110191156B (en) | Data processing method and device based on block chain | |
| CN104112010A (en) | Data storage method and device | |
| CN113485792B (en) | Pod scheduling method in kubernetes cluster, terminal equipment and storage medium | |
| CN109254957A (en) | A kind of archive management system based on big data | |
| CN104462096A (en) | Public opinion monitoring and analysis method and device | |
| JP2013045208A (en) | Data generation method, device and program, retrieval processing method, and device and program | |
| CN209373598U (en) | Real time data and external data association process system | |
| CN102075193B (en) | Method based on time and position relationship for compressing and uncompressing RFID events | |
| CN117035687A (en) | Power grid business fixed asset process configuration method, system and computer storage medium | |
| CN112307318A (en) | Content publishing method, system and device | |
| CN111159107B (en) | Data processing method and server cluster | |
| CN105468728A (en) | Cross-section data acquisition method and system | |
| CN102479211A (en) | Mass data processing system and method on basis of database | |
| CN106919574B (en) | Method for processing remote synchronous file in real time | |
| CN204790999U (en) | Big data acquisition of industry and processing system | |
| CN102025546B (en) | Method and equipment for generating, transmitting and reading network equipment performance files | |
| CN104462422A (en) | Object processing method and device | |
| JP6103021B2 (en) | Data generation method, apparatus and program, search processing method, apparatus and program | |
| CN101827175A (en) | Method and system for storing sorted call bills by catalog | |
| CN101771566A (en) | Method, device and system for transmitting performance data between web masters | |
| CN105893599A (en) | Comparison method and system for time sequence data | |
| CN111401819A (en) | Intersystem data pushing method and system | |
| KR100872149B1 (en) | The RFID middleware device and method using the continuous query index |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Jiang Lianxin Inventor after: Tan Hongzhou Inventor before: Jiang Lianxin |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: JIANG LIANXIN TO: JIANG LIANXIN TAN HONGZHOU |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Jiang Lianxin Inventor after: Chen Rongjun Inventor after: Tan Hongzhou Inventor before: Jiang Lianxin Inventor before: Tan Hongzhou |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: JIANG LIANXIN TAN HONGZHOU TO: JIANG LIANXIN CHEN RONGJUN TAN HONGZHOU |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141029 Termination date: 20210314 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |