Space and time efficient XML graph labeling

Details Space and time efficient XML graph labeling Space and time efficient XML graph labeling

2006-03-31

2009-02-17

Shah, Chirag G (Department: 2619)

Multiplex communications

Network configuration determination

Using a particular learning algorithm or technique

C370S400000, C370S408000

Reexamination Certificate

active

07492727

ABSTRACT:
There is provided a method for determining reachability between any two nodes within a graph. The inventive method utilizes a dual-labeling scheme. Initially, a spanning tree is defined for a group of nodes within a graph. Each node in the spanning tree is assigned a unique interval-based label, that describes its dependency from an ancestor node. Non-tree labels are then assigned to each node in the spanning tree that is connected to another node in the spanning tree by a non-tree link. From these labels, reachability of any two nodes in the spanning tree is determined by using only the interval-based labels and the non-tree labels.

REFERENCES:
patent: 7362974 (2008-04-01), De Patre et al.
patent: 2006/0034194 (2006-02-01), Kahan
Schmidt, A., et al., Xmark: A Benchmark for XML Data Management,Proceedings of the 28thVLDB Conference, (pp. 1-12), Hong Kong, China, 2002.
Cohen, E., et al., Reachability and distance queries via 2-hop labels,Proceedings of the 13thAnnual ACM-SIAM Symposium on Discrete Algorithms, (pp. 937-946), 2002.
Keseler, I., et al., EcoCyc: a comprehensive database resource forEscherichia coli, Nucleic Acids Research, V.33, Database issue, (pp. D334-D337), 2005.
Romero, P., et al., Computational prediction of human metabolic pathways from the complete human genome,Genome Biology, vol. 6(1) Article R2 (pp. 1-17), Dec. 2004.
Schenkel, R., et al., Efficient Creation and Incremental Maintenance of the HOPI Index for Complete XML Document Collections,Proceedings of the 21stInternational Conference on Data Engineering, ICDE 2005, (pp. 1-12) in 2005 IEEE.

Affiliated with

Also associated with

Rating

Space and time efficient XML graph labeling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Space and time efficient XML graph labeling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Space and time efficient XML graph labeling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4055100