Method and mechanism for performing spatial joins

Claim 3

The method of claim 1, further comprising the steps of: receiving a first input indicative of said predetermined cell size; and receiving a second input indicative of a number of cells; wherein the step of decomposing the plurality of first objects and the plurality of second objects into respective sets of one or more cells includes the step of decomposing the plurality of first objects and the plurality of second objects into the respective sets of one or more cells based on the first input and the second input.

Claim 4

The method of claim 2, further comprising the steps of: generating codes for corresponding cells of said respective sets of one or more cells of the plurality of first objects and the plurality of second objects, said codes identifying a location and a size of the corresponding cell within said space; and building a first spatial index and a second spatial index based on said codes.

Claim 5

The method of claim 3, wherein the step of generating codes for corresponding cells includes the step of generating binary hyperspatial codes for the corresponding cells.

Claim 6

The method of claim 3, wherein the step of filtering pairs of the first objects and the second objects, respectively, includes the step of filtering said pairs based on said first spatial index and said second index.

Claim 7

The method of claim 5, wherein the step of determining second candidate pairs of the first objects and the second objects, respectively, that indicate a first object and a second object that share overlapping cells at cell sizes smaller than the predetermined cell size includes the step of determining said second candidate pairs of the first objects and the second objects by performing a join operation on the first spatial index and the second spatial index.

Claim 8

The method of claim 6, further comprising the step of: generating second codes for the corresponding cells of said respective sets of one or more cells of the plurality of first objects and the plurality of second objects, said second codes identifying a location of a cell at said predetermined cell size containing the respective cell; wherein the step of building a first spatial index and a second spatial index based on said codes includes the step of building said first spatial index and said second spatial index based on said codes and said second codes.

Claim 9

The method of claim 7, wherein the step of generating second codes for the corresponding cells includes the step of truncating corresponding codes for the corresponding cells to a prescribed number of digits based on said predetermined cell size.

Claim 10

The method of claim 8, wherein the step of determining first candidate pairs of the first objects and the second objects, respectively, includes the step of determining first candidate pairs of the first objects and the second objects, respectively, by an equijoin operation on the first spatial index and a second spatial index using the second codes.

Claim 11

A computer-readable medium bearing instructions for determining which of a plurality of first objects interacts within a space with which of a plurality of second objects according to a spatial predicate, said instructions, when executed by one or more processors, arranged to cause the one or more processors to perform the steps of: decomposing the plurality of first objects and the plurality of second objects into respective sets of one or more cells, wherein each cell of the respective sets of one or more cells defines a region in said space and has a cell size no larger than a predetermined cell size; filtering from among pairs of the first objects and second objects, respectively, to determine first candidate pairs of the first objects and the second objects, respectively, that share common cells at the predetermined cell size, and filtering from among the first candidate pairs of the first objects and second objects, respectively, to determine second candidate pairs of the first objects and the second objects, respectively, that share overlapping cells of cell sizes smaller than the predetermined cell size; and selecting from among the second candidate pairs resulting pairs of the first objects and the second objects that indicate a first object that interacts with the second object according to the spatial predicate.

Claim 12

A computer-readable medium bearing instructions for determining which of a plurality of first objects interacts within a space with which of a plurality of second objects according to a spatial predicate, said instructions, when executed by one or more processors, arranged to cause the one or more processors to perform the steps of: decomposing the plurality of first objects and the plurality of second objects into respective sets of one or more cells, wherein each cell of the respective sets of one or more cells defines a region in said space and has a cell size no larger than a predetermined cell size; filtering from among pairs of the first objects and second objects, respectively, to determine first candidate pairs of the first objects and the second objects, respectively, that share common cells at the predetermined cell size, and filtering from among the first candidate pairs of the first objects and second objects, respectively, to determine second candidate pairs of the first objects and the second objects, respectively, that share overlapping cells of cell sizes smaller than the predetermined cell size; and selecting from among the second candidate pairs resulting pairs of the first objects and the second objects that indicate a first object that interacts with the second object according to the spatial predicate.

Claim 13

The computer-readable medium of claim 10, wherein said instructions are further arranged to cause the one or more processors to perform the steps of: receiving a first input indicative of said predetermined cell size, and receiving a second input indicative of a number of cells; and wherein the step of decomposing the plurality of first objects and the plurality of second objects into respective sets of one or more cells includes the step of decomposing the plurality of first objects and the plurality of second objects into the respective sets of one or more cells based on the first input and the second input.

Claim 14

The computer-readable medium of claim 11, wherein said instructions are further arranged to cause the one or more processors to perform the steps of: generating codes for corresponding cells of said respective sets of one or more cells of the plurality of first objects and the plurality of second objects, said codes identifying a location and a size of the corresponding cell within said space; and building a first spatial index and a second spatial index based on said codes.

Claim 15

The computer-readable medium of claim 12, wherein the step of generating codes for corresponding cells includes the step of generating binary hyperspatial codes for the corresponding cells.

Claim 16

The computer-readable medium of claim 12, wherein the step of filtering pairs of the first objects and the second objects, respectively, includes the step of filtering said pairs based on said first spatial index and said second index.

Claim 17

The computer-readable medium of claim 14, wherein the step of determining second candidate pairs of the first objects and the second objects, respectively, that indicate a first object and a second object that share overlapping cells at cell sizes smaller than the predetermined cell size includes the step of determining said second candidate pairs of the first objects and the second objects by performing a join operation on the first spatial index and the second spatial index.

Claim 18

The computer-readable medium of claim 15, wherein said instructions are further arranged to cause the one or more processors to perform the steps of: generating second codes for the corresponding cells of said respective sets of one or more cells of the plurality of first objects and the plurality of second objects, said second codes identifying a location of a cell at said predetermined cell size containing the respective cell; wherein the step of building a first spatial index and a second spatial index based on said codes includes the step of building said first spatial index and said second spatial index based on said codes and said second codes.

Claim 19

The computer-readable medium of claim 16, wherein the step of generating second codes for the corresponding cells includes the step of truncating corresponding codes for the corresponding cells to a prescribed number of digits based on said predetermined cell size.

Claim 20

The computer-readable medium of claim 17, wherein the step of determining first candidate pairs of the first objects and the second objects, respectively, includes the step of determining first candidate pairs of the first objects and the second objects, respectively, by an equijoin operation on the first spatial index and a second spatial index using the second codes.

Claim 23

The method of claim 19, wherein the step of performing the first join operation includes the step of performing an equijoin operation.

Claim 24

The method of claim 19, wherein the variable-length codes contains as least as many digits the fixed-length codes.

Claim 25

A computer-readable medium bearing instructions for performing a spatial join according to a spatial predicate of a set of first objects and a set of second objects, said instructions arranged, when executed by one or more processors, to cause the one or more processors to perform the steps of: building a first spatial index for the set of first objects, said first spatial index including an entry indicating an identifier for one of the first objects, a fixed-length code identifying a location of a cell in which part of the one of the first object exists, and a variable-length code identifying a location of a cell in which part of the one of the first object exists; building a second spatial index for the set of second objects, said second spatial index including an entry indicating an identifier for one of the second objects, a fixed-length code identifying a location of a cell in which part of the one of the second object exists, and a variable-length code identifying a location of a cell in which part of the one of the second object exists; performing a first join operation on the first spatial index and the second spatial index based on the fixed-length codes; performing a second join operation on results of the first join operation based on the variable length codes; and performing a spatial join operation on results of the second join operation based on the spatial predicate.

Claim 26

A computer-readable medium bearing instructions for performing a spatial join according to a spatial predicate of a set of first objects and a set of second objects, said instructions arranged, when executed by one or more processors, to cause the one or more processors to perform the steps of: building a first spatial index for the set of first objects, said first spatial index including an entry indicating an identifier for one of the first objects, a fixed-length code identifying a location of a cell in which part of the one of the first object exists, and a variable-length code identifying a location of a cell in which part of the one of the first object exists; building a second spatial index for the set of second objects, said second spatial index including an entry indicating an identifier for one of the second objects, a fixed-length code identifying a location of a cell in which part of the one of the second object exists, and a variable-length code identifying a location of a cell in which part of the one of the second object exists; performing a first join operation on the first spatial index and the second spatial index based on the fixed-length codes; performing a second join operation on results of the first join operation based on the variable length codes; and performing a spatial join operation on results of the second join operation based on the spatial predicate.

Claim 27

The computer-readable medium of claim 22, wherein the step of performing the first join operation includes the step of performing an equijoin operation.

Claim 28

The method of claim 22, wherein the variable-length codes contains as least as many digits the fixed-length codes.

Claim 31

The method of claim 25, wherein the step of performing the first join operation includes the step of performing an equijoin operation.

Claim 32

The method of claim 25, wherein the variable-length codes contains as least as many digits the fixed-length codes.

Claim 33

A computer-readable medium performing a spatial join according to a spatial predicate of a set of first objects and a set of second objects, said instructions arranged, when executed by one or more processors, to cause the one or more processors to perform the steps of: performing a first join operation between the set of first objects and the set of second objects based on fixed-length codes identifying cells in which at least part of the first objects and second objects exist; performing a second join operation on results of the first join operation based on the variable length codes identifying cells in which at least part of the first objects and second objects exist; and performing a spatial join operation on results of the second join operation based on the spatial predicate.

Claim 34

A computer-readable medium performing a spatial join according to a spatial predicate of a set of first objects and a set of second objects, said instructions arranged, when executed by one or more processors, to cause the one or more processors to perform the steps of: performing a first join operation between the set of first objects and the set of second objects based on fixed-length codes identifying cells in which at least part of the first objects and second objects exist; performing a second join operation on results of the first join operation based on the variable length codes identifying cells in which at least part of the first objects and second objects exist; and performing a spatial join operation on results of the second join operation based on the spatial predicate.

Claim 35

The computer-readable medium of claim 28, wherein the step of performing the first join operation includes the step of performing an equijoin operation.

Claim 36

The computer-readable medium of claim 28, wherein the variable-length codes contains as least as many digits the fixed-length codes.