Processing of tag data

• US 20050267886A1
• Filed: 08/15/2005
• Published: 12/01/2005
• Est. Priority Date: 05/09/2002
• Status: Abandoned Application

• Current Assignee: Autosoft R & D Limited
• Original Assignee: Autosoft R & D Limited
• Inventors: Pepper, Ian Anthony, Cagney, Austin
• Application Number:
  US11/203,186
• Publication Number:
  US 20050267886A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2477 Temporal data queries

Abstract

RFID tag data is stored as a tag object in a hierarchical database structure. Date/Time/periods of higher levels of granularity are encoded integrally in the database structure, avoiding need for an index for such time periods. The database controller identifies a relevant tag object and then drills down through relevant year, day and hour nodes to arrive at an observation at a leaf node. The observations are stored as objects having the relevant data values and the time periods of lowest granularity.

Claims

1. A method of processing tag observation data including a time stamp and an observation, the method comprising the steps of:

identifying time periods of the timestamp;

a database controller encoding a time-based structure of a database with at least one of the time periods of the time stamp so that said time-based structure is an integral index; and

storing the observation in a value level of the database which is accessed by traversing through the time-based structure according to the time stamp.

2. A method of processing tag data as claimed in claim 1, wherein the time-based structure comprises hierarchical levels of time periods of the time stamp, each lower level defining a shorter time period of the time stamp than an upper level.

3. A method of processing tag data as claimed in claim 1, wherein the database controller performs a database query by using an historical or current searching time to traverse through the time-based structure to reach the value level, and reading an observation from a part of the value level accessed by said traversal.

4. A method of processing tag data as claimed in claim 1, comprising the step of storing in the database a discrete tag object for each tag.

5. A method of processing tag data as claimed in claim 1, comprising the step of storing in the database a discrete tag object for each tag;

and wherein tag object identifiers are stored at a database level above the time-based structure.

6. A method of processing tag data as claimed in claim 1, comprising the step of storing in the database a discrete tag object for each tag;

and wherein tag identifier data is stored as an attribute object of the tag object.

7. A method of processing tag data as claimed in claim 1, comprising the step of storing in the database a discrete tag object for each tag;

and wherein tag identifier data is stored as an attribute object of the tag object; and

wherein an attribute is stored as an attribute ID value pair.

8. A method of processing tag data as claimed in claim 1, comprising the step of storing in the database a discrete tag object for each tag;

and wherein all observations for a tag are stored in database levels below that of the object for said tag.

9. A method of processing tag data as claimed in claim 1, comprising the step of storing in the database a discrete tag object for each tag;

and wherein data concerning an organization is stored in the database, and wherein the tag objects are located at a level below the organization data.

10. A method of processing tag data as claimed in claim 9, wherein the organization data is stored as organization objects, and the database controller maintains a look-up table mapping the organization objects.

11. A method of processing tag data as claimed in claim 9, wherein the organization data is stored as organization objects;

and wherein the controller links a plurality of databases by generating a linked list of organization objects.

12. A method of processing tag data as claimed in claim 1, wherein observations are stored as observation objects.

13. A method of processing tag data as claimed in claim 1, wherein observations are stored as observation objects;

and wherein the observation objects are grouped under an observation array database structure level.

14. A method of processing tag data as claimed in claim 1, wherein observations are stored as observation objects;

and wherein the observation objects are grouped under an observation array database structure level; and

wherein an observation array holds a database disk page.

15. A method of processing tag data as claimed in claim 1, comprising the further steps of filtering out tag mis-reads.

16. A method of processing tag data as claimed in claim 1, comprising the further steps of performing data aggregation and routing of tag data to at least one of a plurality of application servers.

17. A method of performing a write of tag observation data to a database, the method comprising the steps of:

locating a database node for the tag;

traversing nodes of a time-based database structure below that of the tag node using at least part of an observation time stamp, in which nodes for time periods of the time value of successively smaller granularity are traversed; and

writing the observation at a leaf node at the end of the path traversed through the database.

18. A method as claimed in claim 17, wherein the observation is written as an observation object having observation data attributes.

19. A method as claimed in claim 17, wherein the observation includes a time value at a smaller level of granularity than that of the lowest database time-encoded node.

20. A method of performing a read of a tag observation from a database, the method comprising the steps of:

locating a database node for the tag;

traversing nodes of a time-based database structure below that of the tag node using a searching time value, in which nodes for time periods of the searching time value of successively smaller granularity are traversed; and

reading data from an observation located at a leaf node at the end of the path traversed through the database.

22. A method as claimed in claim 20, wherein time periods of lowest granularity are stored with the observation, and the method comprises the steps of reading time values of a plurality of observations to identify that required;

and wherein the read is for a range of searching time values and the method comprises the step of reading all observations which have lowest granularity level time values within the range.

21. A method as claimed in 20, wherein time periods of lowest granularity are stored with the observation, and the method comprises the steps of reading time values of a plurality of observations to identify that required.

23. A database system comprising a storage device, an interface to receive tag observation data including an observation and a time stamp, and a database controller for:

identifying time periods of the timestamp;

encoding a time-based structure of a database with at least one of the time periods of the time stamp so that said time-based structure is an integral index; and

storing the observation in a value level of the database which is accessed by traversing through the time-based structure according to the time stamp.

24. A database system comprising a storage device, an interface to receive tag observation data including an observation and a time stamp, and a database controller for:

locating a database node for the tag;

traversing nodes of the database below that of the tag node using at least part of an observation time stamp, in which nodes for time periods of the time value of successively smaller granularity are traversed; and

writing the observation at a leaf node at the end of the path traversed through the database.

25. A database system comprising a storage device, an interface to receive tag observation data including an observation and a time stamp, and a database controller for:

locating a database node for the tag;

traversing nodes of a time-based database structure below that of the tag node using a searching time value, in which nodes for time periods of the searching time value of successively smaller granularity are traversed; and

reading data from an observation located at a leaf node at the end of the path traversed through the database.