Method and mechanism for performing spatial joins

• US 6,014,614 A
• Filed: 05/29/1998
• Issued: 01/11/2000
• Est. Priority Date: 05/29/1998
• Status: Expired due to Term

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle Corporation
• Inventors: Herring, John, Vretanos, Panagiotis, Agarwal, Nipun
• Primary Examiner(s): Assouad, Patrick
• Assistant Examiner(s): VO, HIEN XUAN
• Application Number:
  US09/086,499
• Time in Patent Office: 592 Days
• Field of Search: 707/1, 707/2, 707/5, 707/10, 707/100, 707/101, 707/102, 707/103, 707/104, 707/105, 707/200, 707/201, 707/202, 707/203, 707/204, 702/189, 702/190, 702/196, 382/173, 382/180, 382/284, 382/113, 382/294, 382/176, 382/203
• US Class Current: 702/196
• CPC Class Codes: G06F 16/2456 Join operations
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/5854 using shape and object relationship
• CPC Class Codes: G06T 17/005 Tree description, e.g. octree, quadtree
• CPC Class Codes: G06V 10/50 by performing operations within image blocks; by using histograms, e.g. histogram of oriented gradients [HoG]; by summing image-intensity values; Projection analysis
• CPC Class Codes: G06V 30/422 Technical drawings; Geographical maps

Abstract

A method and mechanism for performing a spatial join between two sets of objects employs a two-pass primary filter. The objects are decomposed into variable-sized cells no larger than a predetermined cell size and stored in respective spatial indexes. The spatial indexes include a code for the variable-size cells of the object and a code for the fixed-size supercell of the variable-size cells. The first pass can be implemented as an equijoin filtering operation using the fixed-size cell codes corresponding to the predetermined cell size, and the second pass as a join operation using the variable-size cell codes at smaller cell sizes.

Claims

1. A method of 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 method comprising the computer-implemented 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.

2. 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.

3. 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.

4. 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.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.

13. 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.

14. 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.

15. 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.

16. 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.

17. 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.

18. 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.

19. A method of performing a spatial join according to a spatial predicate of a set of first objects and a set of second objects, comprising the computer-implemented 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 at least part of the one of the first object exists, and a variable-length code identifying a location of a cell in which at least 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 at least part of the one of the second object exists, and a variable-length code identifying a location of a cell in which at least 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.

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

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

22. 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.

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

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

25. A method of performing a spatial join according to a spatial predicate of a set of first objects and a set of second objects, comprising the computer-implemented 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.

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

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

28. 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.

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

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