Static information storage and retrieval – Interconnection arrangements
Reexamination Certificate
2005-11-30
2009-11-17
Luu, Pho M. (Department: 2824)
Static information storage and retrieval
Interconnection arrangements
C365S040000, C365S094000
Reexamination Certificate
active
07619913
ABSTRACT:
In an apparatus for managing area data, the first data structure for area management includes: a first index data structure including a first root node corresponding to a first set of areas containing a first area, first non-leaf nodes, and first leaf nodes; and a first data storage corresponding to the first leaf nodes. The second storage for area data stores one or more second data structures for area management constructed on the basis of area data collected from data in the first storage for area data based on one or more area attributes designated by a user. The second data structure for area management includes: a second index data structure including a second root node corresponding to a second set of areas containing second areas collected based on the one or more area attributes designated, second non-leaf nodes, and second leaf nodes; and a second data storage corresponding to the second leaf nodes. The storage for data associated with an area stores data associated with an area corresponding to the first areas and the second areas. The storage for region data stores a data structure for region management that is constructed on the basis of a node associated with a region which contains at least one or more of the first sets of areas. The data structure for region management includes a data structure in which at least one node for identifying the region links to either the first root node or the second root node.
REFERENCES:
patent: 6125367 (2000-09-01), Na
patent: 6137493 (2000-10-01), Kamimura et al.
patent: 6212392 (2001-04-01), Fitch et al.
patent: 6687688 (2004-02-01), Fujihara et al.
patent: 6732231 (2004-05-01), Don et al.
patent: 2001/0010048 (2001-07-01), Kobayashi
patent: 2001/0051947 (2001-12-01), Morimoto et al.
patent: 2002/0120370 (2002-08-01), Parupudi et al.
patent: 0942381 (1999-09-01), None
patent: 1217857 (2002-06-01), None
patent: 10-124528 (1998-05-01), None
patent: 11-328225 (1999-11-01), None
patent: 2001-195425 (2001-07-01), None
patent: 2001-209656 (2001-08-01), None
patent: 2001-318938 (2001-11-01), None
patent: 2002-073390 (2002-03-01), None
patent: 2002-334030 (2002-11-01), None
patent: 2003-263435 (2003-09-01), None
patent: 2004-005339 (2004-01-01), None
Instructions of “i-area” version 3.0, Mar. 29, 2004, NTT DoCoMo, Inc.
Samet, Hanan, “The Quadtree and Related Hierarchical Data Structures,” Computing Surveys, vol. 16, No. 2, Jun. 1984.
Beckmann, Norbert et al., “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles+,” Praktische Informatik, Universitaet Bremen, pp. 322-331, 1990.
Gaede, Volker, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, No. 2, Jun. 1998.
Guttman, Antonin, “R-Trees: A Dynamic Index Structure for Spatial Searching,” University of California, Berkeley, pp. 47-57, 1984.
Samet, Hanan, “Data Structures for Quadtree Approximation and Compression,” Communications of the ACM, vol. 28, No. 9, pp. 973-993, Sep. 1985.
Hewlett--Packard Development Company, L.P.
Luu Pho M.
LandOfFree
Device, method and program for managing area information does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Device, method and program for managing area information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Device, method and program for managing area information will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4142669