Efficient determination of homogeneous rectangles in a...

Details Efficient determination of homogeneous rectangles in a... Efficient determination of homogeneous rectangles in a...

2006-09-26

2006-09-26

Al-Hashemi, Sana (Department: 2164)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07113955

ABSTRACT:
Determining maximal empty rectangles in a binary matrix includes building values in a staircase data structure for each successive entry in the matrix. The values in the staircase data structure are removed where the values correspond to maximal rectangles having the successive entry in the bottom right corner of the rectangle. The values in the staircase data structure for each successive entry being determinable from values in the staircase data structure for a preceding entry in the matrix. The maximal empty rectangles providing a basis for generating efficient relational join operations on defined relational tables.

REFERENCES:
patent: 6110707 (2000-08-01), Newgard et al.
patent: 6134540 (2000-10-01), Carey et al.
patent: 6377261 (2002-04-01), Fernandez et al.
patent: 6416714 (2002-07-01), Nova et al.
patent: 6480836 (2002-11-01), Colby et al.
patent: 6493699 (2002-12-01), Colby et al.
patent: 6519604 (2003-02-01), Acharya et al.
patent: 6610482 (2003-08-01), Fodor et al.

Affiliated with

Also associated with

Rating

Efficient determination of homogeneous rectangles in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient determination of homogeneous rectangles in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient determination of homogeneous rectangles in a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3553661