Tracking large numbers of moving objects in an event processing system

Patent metadata

Field	Value
Publication number	US-9535761-B2
Application number	US-201514883815-A
Country	US
Kind code	B2
Filing date	Oct 15, 2015
Priority date	May 13, 2011
Publication date	Jan 3, 2017
Grant date	Jan 3, 2017

Abstract

Techniques for tracking large numbers of moving objects in an event processing system are provided. An input event stream can be received, where the events in the input event stream represent the movement of a plurality of geometries or objects. The input event stream can then be partitioned among a number of processing nodes of the event processing system, thereby enabling parallel processing of one or more continuous queries for tracking the objects. The partitioning can be performed such that each processing node is configured to track objects in a predefined spatial region, and the spatial regions for at least two nodes overlap. This overlapping window enables a single node to find, e.g., all of the objects within a particular distance of a target object, even if the target object is in the process of moving from the region of that node to the overlapping region of another node.

First claim

What is claimed is:

1. A method comprising:
receiving, by a computer system, an input event stream comprising a sequence of events, the sequence of events representing movement of a plurality of objects;
partitioning, by the computer system, the input event stream among a plurality of processing nodes to facilitate parallel tracking of the plurality of objects, wherein each processing node of the plurality of processing nodes is configured to track an object in the plurality of objects in a predefined spatial region, and wherein the predefined spatial region for at least two processing nodes in the plurality of processing nodes overlap; and
for a processing node in the plurality of processing nodes, determining whether to insert or update an event in a relation operated on by the processing node, wherein determining whether to insert or update the event in the relation operated on by the processing node comprises:
retrieving, from a bit vector associated with the processing node, a bit value associated with the object;
when the bit value is a first value:
transmitting to the processing node a command for inserting the event into the relation; and
setting the bit value to a second value; and
when the bit value is the second value, transmitting a command to the processing node for updating the event in the relation.

2. The method of claim 1 wherein the event includes an identifier associated with an object of the plurality of objects and a current position of the object.

3. The method of claim 2 wherein partitioning the input event stream comprises, for each event in the sequence of events:
determining a subset of processing nodes in the plurality of processing nodes configured to track the object in the plurality of objects in the predefined spatial region that encompasses a current position of the object; and
for each processing node in the plurality of processing nodes:
determining whether the processing node is in the subset;
if the processing node is in the subset, determining whether to insert or update the event in the relation operated on by the processing node; and
if the processing node is not in the subset, determining whether to delete the event from the relation operated on by the processing node.

4. The method of claim 3 , wherein determining whether to insert or update the event in the relation operated on by the processing node further comprises transmitting to processing node, a command for inserting the event into the relation if the bit value is zero and transmitting to the processing node, a command for updating the event in the stream if the bit value is one.

5. The method of claim 3 , wherein determining whether to delete the event from the relation operated on by the processing node further comprises:
retrieving, from the bit vector stored for the processing node, the bit value associated with the object; and
if the bit value is one:
transmitting to the processing node a command for deleting the event from the relation; and

clearing the bit value to zero.

6. The method of claim 3 , wherein determining the subset of processing nodes comprises performing, based on the current position of the object, a search into the R-tree index.

7. The method of claim 1 , wherein the predefined spatial regions for the plurality of processing nodes are indexed using an R-tree index.

8. The method of claim 1 , wherein the computer system is a load balancing node of an event processing system.

9. The method of claim 1 , wherein the sequence of events represent the movement of more than one million distinct objects.

10. The method of claim 1 , wherein the plurality of objects are motor vehicles.

11. The method of claim 1 , wherein the predefined spatial regions for the plurality of processing nodes are one-dimensional, two-dimensional, or three-dimensional regions.

12. A non-transitory computer readable medium having stored thereon program code executable by a processor, the program code comprising:
code that causes the processor to receive an input event stream comprising a sequence of events, the sequence of events representing movement of a plurality of objects;
code that causes the processor to partition the input event stream among a plurality of processing nodes to facilitate parallel tracking of the plurality of objects, wherein each processing node of the plurality of processing nodes is configured to track an object in the plurality of objects in a predefined spatial region, and wherein the predefined spatial region for at least two processing nodes in the plurality of processing nodes overlap; and
for a processing node in the plurality of processing nodes, code that causes the processor to determine whether to insert or update an event in a relation operated on by the processing node, wherein the code that causes the processor to determine whether to insert or update the event in the relation operated on by the processing node comprises:
code that causes the processor to retrieve, from a bit vector associated with the processing node, a bit value associated with the object;
when the bit value is a first value:
code that causes the processor to transmit to the processing node, a command for inserting the event into the relation; and
code that causes the processor to set the bit value to a second value; and
when the bit value is the second value, code that causes the processor to transmit a command to the processing node for updating the event in the relation.

13. The non-transitory computer readable medium of claim 12 , wherein each event includes an identifier associated with an object of the plurality of objects and a current position of the object.

14. The non-transitory computer readable medium of claim 13 , wherein partitioning the input event stream comprises, for each event in the sequence of events:
code that causes the processor to determine a subset of processing nodes in the plurality of processing nodes configured to track the object in the plurality of objects in the predefined spatial region that encompasses a current position of the object; and
for each processing node in the plurality of processing nodes:
code that causes the processor to determine whether the processing node is in the subset;
if the processing node is in the subset, code that causes the processor to determine whether to insert or update the event in the relation operated on by the processing node; and

if the processing node is not in the subset, code that causes the processor to determine whether to delete the event from the relation operated on by the processing node.

15. An event processing system comprising:
a load balancer node; and
a plurality of processing nodes, wherein the load balancer node is configured to:
receive an input event stream comprising a sequence of events, the sequence of events representing movement of a plurality of objects;
partition the input event stream among the plurality of processing nodes to facilitate parallel tracking of the plurality of objects, wherein each processing node of the plurality of processing nodes is configured to track an object in the plurality of objects in a predefined spatial region, and wherein the predefined spatial region for at least two processing nodes in the plurality of processing nodes overlap; and

for a processing node in the plurality of processing nodes, determine whether to delete an event from a relation operated on by the processing node, wherein determining whether to delete the event from the relation operated on by the processing node comprises:
retrieving, from a bit vector associated with the processing

Assignees

• Oracle Int Corp

Inventors

• Park Hoyong
• Hsiao Eric
• Piper Andy

Classifications

• G06F16/2379

  Updates performed during online database operations; commit processing · CPC title

• G06F16/2246

  Trees, e.g. B+trees · CPC title

• G06F9/5027 Primary

  the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title

• G06F16/2237

  Vectors, bitmaps or matrices · CPC title

• G06F9/542

  Event management; Broadcasting; Multicasting; Notifications · CPC title