Method and apparatus for populating an index table

Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S705000, C707S741000, C707S745000, C707S752000, C707S756000

Reexamination Certificate

active

07991779

ABSTRACT:
A disclosed embodiment relates to a system for populating an index table. The system comprises a component that decomposes a spatial object into a set of object pairs, a component that employs a value associated with the object pairs to sort the set of object pairs into a sequence of object pairs, a component that uses a sliding border analysis to create a subset of the sequence of object pairs depending upon a position of the object pair in the sequence of object pairs, and a component that populates the index table with the subset of object pairs.

REFERENCES:
patent: 5170353 (1992-12-01), Verstraete
patent: 5461712 (1995-10-01), Chelstowski et al.
patent: 5511190 (1996-04-01), Sharma et al.
patent: 5600763 (1997-02-01), Greene et al.
patent: 5717911 (1998-02-01), Madrid et al.
patent: 5724570 (1998-03-01), Zeller et al.
patent: 5819255 (1998-10-01), Celis et al.
patent: 5822747 (1998-10-01), Graefe et al.
patent: 5963956 (1999-10-01), Smartt
patent: 5968109 (1999-10-01), Israni et al.
patent: 6021405 (2000-02-01), Celis et al.
patent: 6029173 (2000-02-01), Meek et al.
patent: 6339772 (2002-01-01), Klein et al.
patent: 6389074 (2002-05-01), Andrew
patent: 6438741 (2002-08-01), Al-omari et al.
patent: 6684219 (2004-01-01), Shaw et al.
patent: 6711560 (2004-03-01), Levy et al.
patent: 6721725 (2004-04-01), Levy et al.
patent: 6745174 (2004-06-01), Levy et al.
patent: 6745198 (2004-06-01), Luo et al.
patent: 6920446 (2005-07-01), Wang et al.
patent: 7035869 (2006-04-01), Smartt
patent: 2004/0103094 (2004-05-01), Levy et al.
patent: 2004/0193622 (2004-09-01), Peleg et al.
patent: 2004/0193654 (2004-09-01), Peleg et al.
“Spatial Data Structures” University of Maryland, 1995 by Hanan Samet.
Webber et al., “Linear-Time Border-Tracing Algorithms for Quadtrees”, Algorithmica, 1992.
Aref, et al., “A Window Retrieval Algorithm for Spatial Databases Using Quadtrees.”
Blakeley et al., Efficiently Updating Materialized Views, 1986 ACM 0-89791-191-1/86/0500/0061, Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1.
Hjaltason, Gisili R., et al., Improved Bulk-Loading Algorithms for Quadtrees, Proc. of the 7th Intl. Symposium on GIS (ACM GIS '99), Kansas City, MO, Nov. 1999, pp. 110-115.
Hjaltason, Gisil R., et al., Speeding Up Bulk-Loading of Quadtrees, Proc. of the 5th Intl. ACM Workshop on Advances in GIS, Las Vegas, NV, Nov. 1997, pp. 50-53.
Mumick et al., “Maintenance of Data Cubes and Summary Tables in a Warehouse,” pp. 100-111, 1997.
Samet, Hanan, Spatial Data Structures, Modern Database Systems: The Object Model, Interoperability, and Beyond, W. Kim, ed., Addison Wesley/ACM Press, Reading, MA, 1995, pp. 361-385.
U.S. Appl. No. 10/690,762, filed Oct. 22, 2003, Peleg et al.
U.S. Appl. No. 10/691,175, filed Oct. 22, 2003, Peleg et al.
U.S. Appl. No. 10/814,579, filed Mar. 31, 2004, Drory et al.
U.S. Appl. No. 10/813,843, filed Mar. 31, 2004, Peleg et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for populating an index table does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for populating an index table, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for populating an index table will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2710020

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.