Tracking large numbers of moving objects in an event processing system

Patent metadata

Field	Value
Publication number	US-10353742-B2
Application number	US-201715795121-A
Country	US
Kind code	B2
Filing date	Oct 26, 2017
Priority date	May 13, 2011
Publication date	Jul 16, 2019
Grant date	Jul 16, 2019

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 event stream comprising a sequence of events representing movement of a plurality of objects, the event stream including a first event of the sequence of events, and the first event being associated with a first object of the plurality of objects; and
partitioning, by the computer system, the event stream among a plurality of processing nodes to facilitate parallel tracking of the plurality of objects using a plurality of bit vectors that correspond to the plurality of processing nodes, each of the plurality of bit vectors comprising a plurality of bit values corresponding to the plurality of objects, and the partitioning of the event stream comprising, for each event in the sequence of events:
determining, by the computer system using a first bit value of a first bit vector of the plurality of bit vectors that is associated with a first processing node of the plurality of processing nodes, that the first processing node is currently tracking the first object of the plurality of objects, the first bit value being associated with the first object;
changing, by the computer system, the first bit value from a second value to a first value that is different than the second value; and
transmitting, by the computer system, a command to the first processing node for deleting the first event from a first spatial-region-representing relation that is operated upon by the first processing node.

2. The method of claim 1 , wherein:
the plurality of processing nodes operate upon a plurality of spatial-region-representing relations,
wherein each event of the sequence of events includes an identifier of the associated object and a current spatial position of the object, and
wherein the partitioning the 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 objects in a predefined spatial region that encompasses the 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;
when the processing node is in the subset, determining whether to cause the event to be inserted or updated in a first spatial-region-representing relation operated on by the processing node; and
when the processing node is not in the subset, determining whether to cause the event to be deleted from the first spatial-region-representing relation operated on by the processing node.

3. The method of claim 2 , wherein determining whether to cause the event to be inserted or updated in the first spatial-region-representing 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 first spatial-region-representing 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 first spatial-region-representing relation.

4. The method of claim 3 , wherein the first value is zero, and wherein the second value is one.

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

6. The method of claim 5 , wherein the second value is one, and wherein the first value is zero.

7. The method of claim 1 , wherein partitioning the event stream further comprises:
determining, by the computer system, a first bit value of a first bit vector of the plurality of bit vectors that is associated with a first processing node of the plurality of processing nodes, the first bit value being associated with the first object; and
determining, by the computer system, a type of the command to be sent to the first processing node based on the first bit value.

8. The method of claim 7 , wherein the event stream further includes a second event of the sequence of events that is also associated with the first object, wherein the partitioning further includes:
determining, by the computer system, using a second bit value of the first bit vector, that the first processing node is currently tracking the first object; and
transmitting, by the computer system, another command to the first processing node for deleting one or more events associated with the first object from a first spatial-region-representing relation operated upon by the first processing node.

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

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

11. The method of claim 1 , 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, 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 event stream comprising a sequence of events, the sequence of events representing movement of a plurality of objects, the event stream including a first event of the sequence of events, and the first event being associated with a first object of the plurality of objects; and
code that causes the processor to partition the event stream among a plurality of processing nodes to facilitate parallel tracking of the plurality of objects using a plurality of bit vectors that correspond to the plurality of processing nodes, each of the plurality of bit vectors comprising a plurality of bit values corresponding to the plurality of objects, and the partitioning of the event stream comprising, for each event in the sequent of events:
determining, using a first bit value of a first bit vector of the plurality of bit vectors that is associated with a first processing node of the plurality of processing nodes, that the first processing node is currently tracking the first object of the plurality of objects, the first bit value being associated with the first object;
changing the first bit value from a second value to a first value that is different than the second value; and
transmitting a command to the first processing node for deleting the first event from a first spatial-region-representing relation that is operated upon by the first processing node.

13. The non-transitory computer readable medium of claim 12 , wherein the code that causes the processor to partition the event stream further comprises:
code that causes the processor to identify a first bit value of a first bit vector corresponding to the first processing node, the first bit value being associated with the first object; and
code that causes the processor to determine a type of the command to be sent to the first processing node based on the first bit value.

14. The non-transitory computer readable medi

Assignees

• Oracle Int Corp

Inventors

• Park Hoyong
• Hsiao Eric
• Piper Andy

Classifications

• G06F16/2246

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

• G06F9/5027 Primary

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

• G06F9/542

  Event management; Broadcasting; Multicasting; Notifications · CPC title

• G06F9/505 Primary

  considering the load · CPC title

• G06F16/2379

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