2 search results - page 1 / 1 » Compact reachability labeling for graph-structured data |
APWEB
2005
Springer
13 years 10 months ago
2005
Springer
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...