KR100792500B1 - Method and apparatus of process for massive data of rfid - Google Patents

Abstract

It is an object of the present invention to provide an RFID data processing apparatus and method for converting and processing RFID recognition data having various data formats into a schema of a predetermined rule.

The RFID data processing method according to the present invention includes the steps of generating data streams by converting data read from one or more RFID tags into a schema having a predetermined rule; Queuing the data stream; Dividing the queued data stream into data in units of RFID tags; And queuing the divided data and transmitting the queued data to an external device.

RFID, tag, queue

Description

RIFID apparatus and method for processing large data {METHOD AND APPARATUS OF PROCESS FOR MASSIVE DATA OF RFID}

1 is a diagram showing the configuration of an RFID recognition system according to a preferred embodiment of the present invention.

2 and 3 are detailed configuration diagrams of the schema information manager submodule of FIG. 1;

4 is a detailed block diagram of the input / output queue manager submodule of FIG. 1.

5 to 7 show information about a queue according to a preferred embodiment of the present invention.

FIG. 8 is a detailed configuration diagram of the queue information manager of FIG. 4. FIG.

FIG. 9 is a detailed configuration diagram of the queue handle information manager of FIG. 4. FIG.

10 is a conceptual diagram of a concurrent queue in accordance with a preferred embodiment of the present invention.

11 is a structural diagram of a multi-user queue according to a preferred embodiment of the present invention.

12 is a structural diagram of a multi-user callback queue according to a preferred embodiment of the present invention.

The present invention relates to an RFID recognition system, and more particularly, to an RFID data processing apparatus and method for processing data sensed from various kinds of RFID tags.

An RFID system for realizing a ubiquitous computing environment is a non-contact recognition system that attaches a small chip to various items and transmits and processes information of objects and surrounding environment information at a radio frequency.

Introduced since the 1980s, this system is dedicated short range communication (DSRC) or wireless identification system.It is a reader with read / decrypt function, RFID tag with unique information, operating software, network, etc. It consists of, and processes the information by identifying the tag of the thin flat form attached to the thing.

The RFID tag is composed of a transponder chip made of a semiconductor and an antenna, which is passive and active. While passives operate by receiving energy from a radio signal from a reader without an internal power source, an active RFID has a built-in RFID tag battery to operate on its own. It is also classified into a chip tag using a silicon semiconductor chip and a chipless tag composed only of an LC device, a plastic or a polymer device.

Such RFID systems are described in M. Ohkubo, K. Suzuki and S. Kinoshita, Hash-chain based forward-secure privacy protection scheme for low-cost RFID, In proceeding of the SCIS'04 , pp 719-724. And K. Rhee, J. Kwak, S. Kim and D. Won, Challenge-response based on RFID authentication protocol for distributed database envirionment, SPC'05 , LNCS 3450, and the like.

As described above, with the development of RFID technology, various companies have started to produce and sell various RFID tags. However, since the various RFID tags have different data formats for each manufacturer, the RFID tag processing system had to have an integrated processing function for data of various data types recognized from various RFID tags.

In addition, with the development of RFID technology and the ubiquitous era, the RFID tag processing system has to be equipped with a function capable of high-speed processing of a plurality of data recognized from a plurality of RFID tags.

SUMMARY OF THE INVENTION The present invention has been made to overcome the above-described problems, and an object thereof is to provide an RFID data processing apparatus and method for converting RFID recognition data having various data formats into a schema of a predetermined rule and processing the same.

In addition, another object of the present invention is to queue a plurality of RFID recognition data recognized from a plurality of RFID tags by queuing the RFID recognition data recognized from a plurality of RFID tags through a simultaneous queue, a multi-user queue, a multi-user callback queue. The present invention provides an RFID data processing apparatus and method.

RFID data processing method according to the present invention for achieving the above object and to solve the problems of the prior art, comprising the steps of: generating a data stream by converting data read from one or more RFID tags into a schema having a predetermined rule; Queuing the data stream; Dividing the queued data stream into data in units of RFID tags; And queuing the divided data and transmitting the queued data to an external device.

The present invention converts RFID recognition data having various data formats into a schema of a predetermined rule, thereby making it compatible with various RFID tags.

In addition, the present invention queues the RFID recognition data recognized from a plurality of RFID tags through a simultaneous queue, a multi-user queue, and a multi-user callback queue, thereby enabling a high speed processing of a plurality of RFID recognition data recognized from a plurality of RFID tags. do.

Hereinafter, a preferred embodiment of the RFID recognition system according to the present invention will be described in detail with reference to the accompanying drawings, and in the following description with reference to the accompanying drawings, the same or corresponding components regardless of reference numerals refer to the same reference numerals. And duplicate description thereof will be omitted.

1 is a view showing an RFID recognition system according to the present invention.

Referring to FIG. 1, the sensor 100 reads RFID recognition data from an RFID tag and provides the sensor data to the sensor data processor 102.

The sensor data processor 102 converts RFID recognition data into schemas of a predetermined rule to generate an input data stream and provide it to the data stream source manager module 104.

The sensor data processor 102 also provides an output data stream provided from the data stream source manager module 104 to an external service device 116.

In addition, the sensor data processor 102 provides the data stream source manager module 104 with the schema registration and deletion request provided from the external service device 116 or the like.

As the external service device 116, a device for providing various services is employed. For example, a web service system for an Internet service, an HTTPGeT service system for a service using a general computer, a jms service system, and the like. This can be

The data stream source manager module 104 includes a schema information manager submodule 106, an input / output queue manager submodule 108, an input queue 110, and an output queue 112.

The schema information manager submodule 106 provides the sensor data processor 102 with schema information for converting data read from each of the various RFID tags into a schema according to a predetermined rule.

In addition, the schema information manager submodule 106 performs registration and deletion of schema information at the request of the sensor data processor 102.

The input / output queue manager submodule 108 provides the input data stream provided from the sensor data processor 102 to the continuous query information manager submodule 114 through the input queue 110. In addition, the input / output queue manager submodule 108 outputs the output data stream provided from the continuous query information manager submodule 114 or the output data stream provided from the schema information manager submodule 106 to the output queue 112. Through the sensor data processor 102.

The input queue 110 provides an input data stream to the continuous query information manager submodule 114 under the control of the input / output queue manager submodule 108.

The output queue 112 then outputs an output data stream or schema from the continuous query information manager submodule 114, which is provided through the input / output queue manager submodule 108 under the control of the input / output queue manager submodule 108. The output data stream from the information manager submodule 106 is provided to the sensor data processor 102.

In this case, the input queue 110 and the output queue 112 provide a basic queue, a simultaneous queue, a multi-user queue, and a multi-user callback-queue, thereby enabling high-speed processing of a plurality of RFID recognition data.

The continuous query information manager submodule 114 divides the input data stream input through the input queue 110 into RFID tag units by using an xquery stream provided from the sensor data processor 102. The reference information (xquery stream) is RFID tag identification information, antenna identification information, time information, and the like, and is information for detecting individual ID tag identification information from an input data stream.

In addition, the continuous query information manager submodule 114 directly outputs the data through the output queue 112 or through the input / output queue manager submodule 108 when the data of the RFID tag unit is the first format (XML). Output through the queue 112.

If the data in the RFID tag unit is the second format TEXT, the data is converted into the first format XML through the schema information manager submodule 106, and then the output queue 112 is passed through the input / output queue manager submodule 108. Output through

The operation of the RFID recognition system configured as described above will be briefly described as follows.

When the sensor 100 reads the RFID tags as the RFID tags approach the sensor 100, the sensor 100 transmits the RFID recognition data to the sensor data processor 102.

The sensor data processor 102 obtains schema information and enqueue information preset corresponding to each of the RFID tags from a schema information manager submodule 106, and converts the RFID recognition data according to the schema information. Generate an input data stream and provide the generated input data stream to the continuous query information manager submodule 114 through the input queue 110 according to the enqueue information.

The continuous query information manager submodule 114 divides the input data stream provided through the input queue 110 into data in units of RFID tags using reference information (xquery stream), and each data is of a first format. If it is (XML), it is provided to the output queue 112 through the input / output queue manager submodule 108, or directly to the output queue 112. On the contrary, if each data is the second format (TEXT), the data is provided to the schema information manager submodule 106. The schema information manager submodule 106 converts the data of the second format TEXT into data of the first format XML and provides the output queue 112 through the input / output queue manager submodule 108.

The output queue 112 provides the data to the external service device 116 via the sensor data processor 102.

The external service device 116 receives the data, performs a predetermined function, guides the administrator, or stores the data in a database not shown.

Now, the schema registration and deletion processes among the functions of the schema information manager submodule 106 of the RFID recognition system will be described in more detail with reference to FIG. 2.

The schema information management submodule 106 includes a schema register unit 200 and a schema delete unit 202.

The schema registration unit 200 checks whether the schema registration request is generated (A1). Here, the schema registration request includes information about a schema name, schema original text, schema type, queue type, message type, queue capacity, and the like. In addition, the schema registration request may be provided from an external service device 116 such as an administrator terminal.

When the schema registration request is generated, the schema registration unit 200 transmits the schema original text to the caster XML Schema Parser 204 (A2). The caster XML schema parser 204 is a function unit for converting RFID recognition data to correspond to a schema, and may be provided in the sensor data processor 102.

In addition, the schema register unit 200 provides the schema name, schema type, message (data) type, schema original text, queue type information, and information on queue capacity to the sensor data storage manager block 206 and stores the information.

Thereafter, the schema registration unit 200 provides the input / output queue manager submodule 108 with enqueue handle request information including a queue name, such as a schema name, a queue type, a message type, a queue capacity, and the like.

The input / output queue manager submodule 108 assigns a predetermined enqueue handle according to the enqueue handle request information, and provides the enqueue handle to the schema register 200 (A4 and A5). The schema registration unit 200 provides the enqueue handle to the sensor data processor 102 that transmits the schema to the input queue 110. This completes the schema registration process.

The schema deletion unit 202 checks whether schema deletion request information is received (B1). The schema deletion request information includes at least schema name information.

When the schema deletion request information is received, the schema deletion unit 202 may include the input / output queue manager submodule 108, the continuous query information manager submodule 114, the authority information manager submodule 208, and the sensor data storage manager block. At 206, schema deletion request information including the schema name is provided. Accordingly, the input / output queue manager submodule 108, the continuous query information manager submodule 114, the authorization information manager submodule 208, and the sensor data storage manager block 206 delete all information and queues for the corresponding schema. (B2-B5).

Here, the authority information manager submodule 208 manages the authority for skiers and data that can be accessed for each user, and transmits the authority confirmation to the continuous query information manager submodule 114.

Now, a process of providing schema information among the functions of the schema information manager submodule 106 of the RFID recognition system will be described in more detail with reference to FIG. 3.

The schema information manager submodule 106 includes a schema tree provider 300, a meta information provider 302, and an enqueue handle provider 304 to provide schema information.

If the schema tree provider 300 provides schema tree request information including a schema name from the sensor data processor 102 (C1), the schema data provider 300 stores schema original request information including the corresponding schema name in the sensor data storage manager block 206. (C2). Here, the schema tree is information for defining a schema rule.

The sensor data storage manager block 206 provides a schema text to the schema tree provider 300 according to the schema text request information (C3), and the schema tree provider 300 provides the schema text to the caster XML schema. Provided to parser 204 (C4). The caster XML schema parser 204 parses the schema original text to generate a schema tree, and provides the schema tree to the schema tree provider 300 (C5). The schema tree providing unit 300 provides the schema tree to the sensor data processor 102 that has requested the request (C6).

When the meta information provider 302 is provided with schema meta information request information including a schema name from the sensor data processor 102 (D1), the meta data provider 302 sends the schema meta information request information including the corresponding schema name to the sensor data storage manager block. Request to 206 (D2). Here, the schema meta information includes a schema name list, schema existence, schema original text, schema type, queue message type, queue capacity, and the like.

When the schema metadata information request information is provided, the sensor data storage manager block 206 may metadata schema information including a schema name list, schema existence, schema text, schema type, queue message type, queue capacity, and the like. It provides to the provision part 302 (D3). The meta information provider 302 provides schema meta information provided by the sensor data storage manager block 206 to the sensor data processor 102 (D4).

When the enqueue handle providing unit 304 is provided with enqueue handle request information including a schema name from the sensor data processor 102 or the like (E1), the enqueue handle request information including the queue name corresponding to the schema name is provided. Provided to the input / output manager submodule 108 (E3). The input / output manager submodule 108 generates an enqueue handle according to the enqueue handle request information and provides the enqueue handle to the enqueue handle providing unit 304 (E2). The enqueue handle providing unit 304 provides the enqueue handle to the sensor data processor 102 (E4).

As described above, the schema information manager submodule 106 performs schema registration and deletion, provision of schema information, and the like so that the RFID recognition data read from various RFID tags can be converted into a schema of a predetermined rule.

The operation of the input / output queue manager submodule 108 will now be described in more detail.

The input / output queue manager submodule 108 is largely composed of a queue information manager 400 and a queue handle information manager 410.

The queue information manager 400 includes a base queue 402, a concurrent queue 404, a multi user queue 406, and a multi user callback queue. Queue 408.

Here, each of the queues will be briefly described with reference to FIG. 5, which shows the functions of the basic queue 402, the simultaneous queue 404, the multi-user queue 406, and the multi-user callback-queue 408.

The basic queue 402 provides a function of message enqueue and dequeue, message deletion, and queue information provision. The message enqueue is a function of adding a message and adding a time stamp when a message is input, and the message dequeue is a function of returning and deleting a message, and supports n message dequeues. Delete all messages deletes all messages stored in the queue. In addition, the queue information includes a queue type, a message type, a queue size, a queue capacity, and the like, and the queue types include a basic queue, a simultaneous queue, a multi-user queue, a multi-user callback queue, and the like. The message type indicates a type of a message stored in a queue. In the present invention, a first type (XML-STRING TYPE) and a second type (TEXT-TREE TYPE) are used. The queue size represents the number of messages stored in the queue, and the queue capacity represents the maximum number of messages that can be stored in the queue.

The concurrent queue 404 supports an environment in which the default queue 402 can be used in a multithreaded environment.

The multi-user queue 406 provides multiple handles to one concurrent queue 404 to provide an environment that allows multiple users to use a single queue at the same time.

The multi-user callback queue 408 provides the ability to call a particular object whenever a certain number of messages are enqueued to the multi-user queue 406.

The queue handle information manager 410 manages information on the enqueue handle 412 and the dequee handle 414, and the enqueue handle 412 and the dequee handle 414 will be described with reference to FIG. 6.

The enqueue handle 412 includes a message enqueue providing the enqueue function of the support queue and a queue information providing function providing the queue information of the support queue.

The dequeue handle 414 includes a function for managing a current position in a queue for each dequeue handle, a message dequeue function for providing a dequeue function for a support queue, a function for providing queue information of a support queue, and a current position of a support queue. It provides the ability to move to the position after the last message, set the callback function of the support queue, and cancel the callback function of the support queue. Here, setting and canceling the callback function of the support queue is provided only in the multi-user callback-queue.

As shown in FIG. 7, the number of the queue handle and the support queue is provided with one enqueue handle and one dequeue handle for the basic queue and the concurrent queue, and the multi-user queue and the multi-user callback-queue have one enqueue handle and dequeue. N handles are provided.

Detailed operations of the input / output queue manager submodule 108 will be described in more detail.

First, the processing procedure of the queue information manager 400 of the input / output queue manager submodule 108 will be described with reference to FIG. 8.

The queue information manager 400 includes a queue generator 800, a queue information provider 802, a queue delete unit 804, and a queue map unit 806.

The queue generating unit 800 includes a queue creation request including information such as a queue name, queue type, message type, queue capacity, etc. from an external service device 116 such as a schema information manager submodule 106 or an administrator terminal. When information is received (F1), the base queue (402), concurrent queue (404), multi-user queue (406), multi-user callback-queue ( Create one or more of the Multi User CallBack-Queue (408) (F2). After generation of the queue, the queue generator 800 stores the queue object reference information in the queue map unit 806 (F3). Here, the queue object reference information includes a queue name, a queue type, a queue capacity, and the like.

In addition, the queue generator 800 provides the queue object reference information to the queue handle information manager 410 (F4), and the enqueue handle 412 according to the queue object reference information from the queue handle information manager 410. It is provided (F5) and provided to the schema information manager submodule 106 (F6).

When the queue information providing unit 802 receives the queue information request information including the queue name from the schema information manager submodule 106 (G1), the queue information providing unit 802 includes corresponding queue name risk and queue object reference information according to the request. The queue information is read from the queue map unit 806 and provided to the schema information manager submodule 106 (G2 to G4). The queue information includes a list of queue names, whether a queue exists, queue object reference information, and the like.

When the queue deletion unit 804 receives queue deletion request information including a queue name from an external service device 116 such as a schema information manager submodule 106 or an administrator terminal (H1), the queue deletion unit 804 includes a corresponding queue name. The queue deletion request information is provided to the queue map unit 806 and the queue handle information manager 410 to delete all information on the queue (H2, H3).

The operation of the queue handle information manager 410 of the input / output queue manager submodule 108 will now be described in detail with reference to FIG. 9.

The queue handle information manager 410 includes a queue handle generation unit 900, a dequee handle information providing unit 902, a dequee handle deleting unit 904, and a dequee handle map unit 906.

When the queue handle generation unit 900 receives queue creation request information including a queue name and a handle type (J1), the queue handle generation unit 900 checks the queue name through the queue information manager 400 (J2 and J3), Generate enqueue or dequeue handles 412 and 414 (J4). After the creation of the enqueue handle or dequee handles 412 and 414, the queue handle generation unit 900 stores the queue handle object reference information in the dequee handle map 906 (J5), and generates the generated enqueue or dequee handle 412, 414) is provided to the device requesting the creation of the queue, for example the schema information manager submodule 106 (J6).

When the dequeue handle information providing unit 902 receives dequeue handle information request information including a queue name (K1), the dequeue handle information providing unit 902 receives a dequeue handle list corresponding to the queue name from the dequeue handle map unit 906 (K2, K3) Provide dequeue handle information to the requesting device (K4).

When the dequeue handle deletion unit 904 receives the dequeue handle deletion request information including the queue name (L1), the dequeue handle deleting unit 904 deletes the information on the dequeue handle corresponding to the queue name from the dequeue handle map unit 906 (L2). The dequeue handle list is received through the dequeue handle information providing unit 902 to confirm the dequeue handle deletion (L3 and L4).

Since the operation of the basic enqueue and dequeue of the queues as described above is the same as in the prior art, a detailed description of the basic enqueue and the dequeue is omitted, and the following description will be made in detail with reference to the drawings for the simultaneous queue, the multi-user queue, and the multi-user callback queue. Explain.

FIG. 10 illustrates a basic conceptual diagram of a simultaneous queue, in which first and second threads 1000 and 1006 sharing a single queue have synchronization units 1002 and 1008.

The synchronization units 1002 and 1008 may be generated when the queue 1004 is shared by synchronizing the front and rear information of the queue 1004 shared by the first and second threads 1000 and 1006. Prevent possible sharing violations.

11 illustrates a structure of a multi-user queue, in which multiple queue handles queue data through one queue. In the queue of FIG. 11, a reference counter of queue represents the number 2 of dequeue handles DH1 and DH2, and a reference reference of message represents data M1, M2, and M3. Indicates the number 2 of dequeue handles DH1 and DH2 to dequeue. That is, the message reference counter may be obtained by subtracting the number of message dequeues from the number of dequeue handles of the message enqueue.

Referring to FIG. 11, one or more enqueue handles EH1 and EH2 and one or more dequeue handles DH1 and DH2 are queuing data using one queue, and the one handle corresponds to one RFID tag. Thus, the present invention makes it possible to queue data received from multiple RFID tags into one queue.

12 illustrates a structure of a multi-user callback queue, in which a plurality of queue handles DH1 to DH3 and EH1 queue data through one queue, and each of the queue handles DH1 to DH3 and EH1 has different predetermined objects. (OBJ1 to OBJ3) are given.

Each queue handle implements an object assigned to the corresponding queue handle every time it is driven, and setting and releasing of the object may be changed according to a request of an administrator through an administrator terminal.

For example, as shown in FIG. 12B, when execution of the object identified by 2 is set for each execution of the third dequee handle DH3, the third dequee handle DH3 is performed to store callback reference information. This is done by loading the object from the map. In addition, during the execution of the object, a counter called a callback counter may be used to count the number of times the object is executed.

Embodiments of the present invention described above include a computer readable medium including program instructions for performing various computer-implemented operations. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts.

As described above, the present invention has an advantage of converting RFID recognition data having various data formats into a schema of a predetermined rule, thereby making it compatible with various RFID tags.

In addition, the present invention queues the RFID recognition data recognized from a plurality of RFID tags through a simultaneous queue, a multi-user queue, and a multi-user callback queue, thereby enabling a high speed processing of a plurality of RFID recognition data recognized from a plurality of RFID tags. This has the advantage.

As described above, the present invention has been described by way of limited embodiments and drawings, but the present invention is not limited to the above-described embodiments, which can be variously modified and modified by those skilled in the art to which the present invention pertains. Modifications are possible.

Accordingly, the spirit of the present invention should be understood only by the claims set forth below, and all equivalent or equivalent modifications thereof will belong to the scope of the present invention.

Claims (10)

In the RFID data processing method, Generating a data stream by converting data read from one or more RFID tags into a schema having a predetermined rule; Queuing the data stream; Dividing the queued data stream into data in units of RFID tags; Queuing the divided data and transmitting the queued data to an external device RFID data processing method comprising a. The method of claim 1, And at least one schema is provided according to a type of an RFID tag. The method of claim 1, The queuing of the data stream or data, RFID data processing method characterized in that a number of threads share a queue to queue. The method of claim 1, The queuing of the data stream or data, RFID queue processing method characterized in that a plurality of queue handles share a queue to queue. The method of claim 4, wherein Setting a predetermined object in the queue handle; And performing the predetermined object every time the queue handle is driven. In an RFID data processing apparatus, A sensor that reads data from one or more RFID tags; A sensor data processor configured to generate a data stream by converting the read data into a schema having a predetermined rule, and receiving data divided into data in units of RFID tags from the data stream and transmitting the received data to an external device; A data stream source manager module for receiving and queuing the data stream and queuing the data stream to the data sensor data processor when data divided into data in units of the RFID tag is provided; When the data stream is provided through the data stream manager, the continuous query information manager submodule divides the data into the RFID tag units and provides the data to the data stream manager. RFID data processing apparatus comprising a. The method of claim 6, The data stream source manager module, The registration and deletion of schemas are implemented differently according to various RFID tags, RFID data processing apparatus for providing the information on the registered schema to the sensor data processor. The method of claim 6, The data stream source manager module, RFID data processing apparatus for queuing the data stream or data by sharing a queue with multiple threads. The method of claim 6, The data stream source manager module, RFID data processing apparatus for queuing the data stream or data by sharing a queue with a plurality of queue handles. The method of claim 6, The data stream source manager module, And a predetermined object set in the corresponding queue handle every time the queue handle is driven.

Images