Directed non-cyclic graph walking system and method

Details Directed non-cyclic graph walking system and method Directed non-cyclic graph walking system and method

2005-07-26

2005-07-26

Ali, Mohammad (Department: 2177)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

06922692

ABSTRACT:
A system and method for efficiently walking a directed non-cyclic graph of data using multiple analysis tools. Provided is a graph walking system, including: a binding system for binding a graph observer with a data graph, for binding node patterns to node observers to generate at least one node pattern
ode observer pair, and for binding the data graph observer to at least one node pattern
ode observer pairing, and wherein each node pattern includes a computed set of target sub-node patterns; a node relationship graph (NRG), wherein each node in the NRG corresponds to at least one node in the data graph, and wherein each node in the NRG includes a computed set of valid sub-node patterns; graph walking logic for systematically walking through nodes in the data graph and corresponding nodes in the NRG; and a pattern testing system that determines if the set of target sub-node patterns for a node pattern matches the set of valid sub-node patterns for a corresponding NRG node when a node is encountered in the data graph.

REFERENCES:
patent: 4698752 (1987-10-01), Goldstein et al.
patent: 5379422 (1995-01-01), Antoshenkov
patent: 5386394 (1995-01-01), Kawahara et al.
patent: 5761664 (1998-06-01), Sayah et al.
patent: 5761667 (1998-06-01), Koeppen
patent: 5877775 (1999-03-01), Theisen et al.
patent: 6055539 (2000-04-01), Singh et al.
patent: 2003/0050915 (2003-03-01), Allemang et al.
patent: WO 99/08170 (1999-02-01), None
Li et al., “Object recognition based on graph matching implemented by a hopfield-style neural network”, Dept. of Electr. Eng., Worcester Polytech. Inst., MA, USA, Jun. 18-22, 1989, pp. 287-290 vol. 2.
Luo et al., “Strructural graph matching using the EM algorithm and singular value decomposition”, Dept. of Comp. Sci., york Univ., UK, IEEE, Oct. 2001, pp. 1120-1136.
Gamma, Helm, Johnson and Vlissides, “Design Patterns—Elements of Reusable Object-Oriented Software,” ISBN 0-201-63361-2, pp. 293-303, 1995.
Keqin, L., “A method for evaluating the expected load of dynamic tree embeddings in hypercubes,” International Journal of Foundations of Computer Science, vol. 11, No. 2, pp. 207-230, Jun. 2000.
Wagner, IA, Lindenbaum, M., Bruckstein, AM, “ANTS: agents on networks, trees, and subgraphs,” Future Generation Computer Systems, vol. 16, No. 8, pp. 915-926, Jun. 2000.
Wirth, HC, Steffan, J., “On minimum diameter spanning trees under reload costs,” Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG'99, Proceedings (Lecture Notes in Computer Science vol. 1665), Ascona, Switzerland, Jun. 17-19, 1999.
Kegin, L., “Barrel shifter—a close approximation to the completely connected network in supporting dynamic tree structured computations,” Proceedings of the IEEE 1997 National Aerospace and Electronics Conference, Dayton, Ohio, Jul. 14-17, 1997.
Shade, J., et al., “Hierarchical image caching for accelerated walkthroughs of complex environments,” Computer Graphics Proceedings, SIGGRAPH '96, New Orleans, LA, Aug. 4-9, 1996.

Affiliated with

Also associated with

Rating

Directed non-cyclic graph walking system and method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Directed non-cyclic graph walking system and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed non-cyclic graph walking system and method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3384047