Reducing index size for multi-level grid indexes

• US 7,779,038 B2
• Filed: 10/31/2007
• Issued: 08/17/2010
• Est. Priority Date: 05/10/2002
• Status: Expired due to Fees

• Current Assignee: Hulu LLC (The Walt Disney Company)
• Original Assignee: International Business Machines Corporation
• Inventors: Adler, David William, Stolze, Knut
• Primary Examiner(s): Woo; Isaac M
• Application Number:
  US11/931,786
• Publication Number:
  US 20080052303A1
• Time in Patent Office: 1,021 Days
• Field of Search: 707600-831
• US Class Current: 707/791
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
• CPC Class Codes: G06F 16/5854 using shape and object relationship
• CPC Class Codes: Y10S 707/955 Object-oriented
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

The number of index entries in a grid index for indexing geometric shapes is reduced by establishing a pool storage area for geometric shapes, selecting a threshold number of grid cells which a geometric shape may overlap, storing the shape in the grid index if a geometric shape overlaps a number of grid cells not exceeding the threshold number, and storing the shape in the pool storage area if the geometric shape overlaps a number of grid cells which exceeds the threshold number.

Claims

1. A computer system for indexing objects, comprising:

an index comprised of a plurality of index entries for storing indicators of first objects, wherein the index is a grid index comprising a plurality of grid cells, the first and second objects are geometric shapes;

a pool storage area for storing an indicator of second objects that are not stored in the index, wherein a number of index entries for the second objects if stored in the index is greater than a threshold number, wherein the pool storage area is for storing indicators of geometric shapes that overlap more than a preselected threshold number of grid cells if the grid index is laid over said geometric shapes;

means for determining how many grid cells a geometric shape overlies;

means for storing the shape in the grid index if a geometric shape overlaps a number of cells that does not exceed the threshold number;

means for storing the shape in the pool storage area if a geometric shape overlaps a number of grid cells exceeding the threshold number;

means for querying the grid index by initially evaluating the grid index to produce a group of one or more possible candidates based on the grid cells that respective geometric shapes in the index overlap;

means for querying the pool by adding the geometric shapes stored in the pool to said group of possible candidates to produce an interim group of possible candidates;

means for detecting geometric shapes in the grid index and pool that overlap a query area by filtering the interim group of possible candidates by comparing minimum bounding rectangles of the interim group of possible candidates with the query area to produce filtered candidates; and

means for determining geometric shapes among the filtered candidates that overlap the query area.

2. A computer program for reducing a number of index entries for use in an index for indexing an object, the computer program having program instructions executable by a computer and recorded on a computer-readable medium, the computer program comprising:

program instructions for determining a number of index entries for the object;

program instructions for, if the number of index entries does not exceed a threshold number, storing the index entries in the index, wherein the index is a grid index comprised of a plurality of grid cells, the object is a geometric shape, and said determining a number of index entries is based on how many grid cells the object overlaps;

program instructions for, if the number of index entries exceeds the threshold number, storing an indicator of the object in a pool storage area;

subsequent to the storing of an indicator of a geometric shape in the pool storage area and in response to a query, evaluating the grid index to produce a group of one or more possible candidates based on grid cells that respective geometric shapes in the index overlap;

adding the geometric shapes stored in the pool storage area to said group of possible candidates to produce an interim group of possible candidates; and

filtering the interim group of possible candidates by comparing approximations of the geometric shapes of the interim group of possible candidates with a query area specified in the query to produce filtered candidates.

3. The computer-program of claim 2, wherein the approximations of the possible candidates are minimum bounded rectangles (MBRs) of the possible candidates, and said filtering is performed by comparing for each possible candidate, the MBR of the candidate with the query area and designating the candidate as a final candidate if the MBR of the candidate and the query area overlap.

4. The computer-program of claim 3, further comprising determining for each final candidate if the geometric shape corresponding to the final candidate overlaps the query area.

5. A computer system for reducing a number of index entries for use in an index for indexing an object, comprising:

an index capable of storing a plurality of index entries; and

a pool storage area capable of storing indicators of objects;

means for determining a number of index entries for the object;

means for, if the number of index entries does not exceed a threshold number, storing the index entries in the index, wherein the index is a grid index comprised of a plurality of grid cells, the object is a geometric shape, and said determining a number of index entries is based on how many grid cells the object overlaps;

means for, if the number of index entries exceeds the threshold number, storing an indicator of the object in a pool storage area;

means for subsequent to the storing of an indicator of a geometric shape in the pool storage area and in response to a query, evaluating the grid index to produce a group of one or more possible candidates based on grid cells that respective geometric shapes in the index overlap;

means for adding the geometric shapes stored in the pool storage area to said group of possible candidates to produce an interim group of possible candidates; and

means for filtering the interim group of possible candidates by comparing approximations of the geometric shapes of the interim group of possible candidates with a query area specified in the query to produce filtered candidates.

6. The computer system of claim 5, wherein the approximations of the possible candidates are minimum bounded rectangles (MBRs) of the possible candidates, and said filtering is performed by comparing for each possible candidate, the MBR of the candidate with the query area and designating the candidate as a final candidate if the MBR of the candidate and the query area overlap.

7. The computer system of claim 6, further comprising determining for each final candidate if the geometric shape corresponding to the final candidate overlaps the query area.