Name
Abstract | ||
|---|---|---|
Abstract - Many XML applications over the Internet favor high-performance single-pass streaming XPath evalua tion. Finite automata-based,algorithms,suffer from potent ially combinatorial,explosion,of dynamic,states for match ing descendant,axes. We present QuickXScan for streamin g evaluation,of,XPath queries,containing,child,and descendant,axes with complex,predicates. Using a tr ee representation for an XPath query, it employs a mat ching grid, a compact tree of interrelated stacks as in t he holistic |
Year | Venue | Keywords |
|---|---|---|
2006 | International Conference on Internet Computing | finite automata |
Field | DocType | Citations |
Programming language,Computer science,XPath | Conference | 4 |
PageRank | References | Authors |
0.39 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guogen Zhang | 1 | 53 | 32.52 |
| Qinghua Zou | 2 | 133 | 11.09 |