Name
Abstract | ||
|---|---|---|
We address the XPath evaluation problem over XML streams. We consider a fragment of XPath called Conjunctive XPath (CXP). We present an algorithm that eagerly evaluates a CXP query Q against a streaming XML data D in O((|Q|+n2)|D|) time and O(|Q|height(D)+n·maxcands(Q,D)) space, where n is the number of location steps in Q and maxcands(Q,D) is the maximum number of nodes of D that can be candidates for answer nodes, at any one instant. The result improves the previous work of Ramanan (2009) which lazily evaluates Q against D in O((|Q|+n·height(D))|D|) time using the same space. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-34109-0_26 | SPIRE |
Keywords | Field | DocType |
cxp query q,xml stream,conjunctive xpath,answer node,eager xpath evaluation,location step,xpath evaluation problem,xml data,previous work,maximum number | Streaming XML,Programming language,XML,Computer science,XPath | Conference |
Volume | ISSN | Citations |
7608 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kazuhito Hagio | 1 | 1 | 1.06 |
| Takashi Ohgami | 2 | 1 | 0.72 |
| Hideo Bannai | 3 | 620 | 79.87 |
| Masayuki Takeda | 4 | 902 | 79.24 |