An Efficient XPath Query Processor for XML Streams

Chen, Yi; Davidson, Susan B.; Zheng, Yifeng

doi:10.1109/icde.2006.18

Cited by 53 publications

(65 citation statements)

References 25 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the experiments, we have tested four methods on the tree matching: -TwigM [12] , -Gou's method [23] , -the method for the unordered tree matching (discussed in this paper, chen-1 for short), and -the method for the ordered tree matching (discussed in this paper, chen-2 for short). The theoretical computational complexities of these methods are summarized in Table 1.…”

Section: -Tested Methodsmentioning

confidence: 99%

“…The method proposed in [40] is a general strategy, but requires exponential time (O(|T|⋅2 |Q| )) in the worst case, as analyzed in [40]. The methods discussed in [32,33] [12]. The algorithm discussed in [23] greatly improves TwigM, running in O(|Q|⋅|T|) time and O(|Q|⋅r) caching space.…”

Section: Related Workmentioning

confidence: 99%

“…One is for the so-called XML streaming environment and the other is index-based. A great many strategies have been proposed to evaluate XPath queries in an XML streaming environment [2,12,18,23,27,32,33,39,40] . The methods discussed in [2,27] are based on finite state automata (FSA), but only able to handle single path queries, i.e., a query containing branching cannot be processed, as observed in [39].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Streaming Algorithms for Tree Matching Problems

Chen

Zou²

2012

IJCSAI

View full text Add to dashboard Cite

Abstract-With the growing importance of XML in data exchange, much research has been done in providing flexible query mechanisms to extract data from XML documents. In this paper, we focus on the query evaluation in an XML streaming environment, in which data streams arrive continuously and queries have to be evaluated even before all the data of an XML document are available. Two algorithms will be discussed. One is for the unordered tree matching, by which only ancestor-descendant and parent-child relationships are considered. It requires O(|T'|⋅leaf Q ) time, where T' is a subtree of document tree T, in which each node matches at least one node in query Q and leaf Q is the number of leaf nodes in Q. The other is for the ordered tree matching, by which the left-to-right order of nodes must also be taken into account. It runs in O(|T'|⋅|Q|) time. Furthermore, our algorithms achieve high time performance without trading off space requirements. They have the same caching space and buffering space overhead as state-of-the-art stream-querying algorithm. We show the efficiency and effectiveness of our algorithms by a lot of experiments.

show abstract

Section: -Tested Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Streaming Algorithms for Tree Matching Problems

Chen

Zou²

2012

IJCSAI

View full text Add to dashboard Cite

show abstract

“…ViST [26] also uses two index structures, namely S-Index (for SES-based labels) and D-Index (for ancestor-descendent labels). BLAS [43] uses a similar observation to develop a bi-labeling system for reducing the number of joins.…”

Section: Index-and Multi-index Support For Xml Processingmentioning

confidence: 99%

“…DataGuides [28], IndexFabric [41], T-Index [42], BLAS [43], FB-Index [44], XJoinIndex [45], APEX [46], and other covering indices [47], on the other hand, use pre-computed indexes. A DataGuide [28] is a structural summary of the database, and provides an efficient mechanism to enumerate matching nodes when a tag path starting from the root is given as input.…”

Section: Index-and Multi-index Support For Xml Processingmentioning

confidence: 99%

FMware: Middleware for Efficient Filtering and Matching of XML Messages with Local Data

Candan¹,

Dönderler²,

Yan³

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. XML message filtering systems are used for sifting through real-time messages to support business data mining and reporting. An XML message filtering system needs to (a) process registered filter predicates on multiple distributed real-time streams and (b) match and validate the filter results with local data to identify the relevant data that can be used for higher-level processing. Although efficient real-time filtering schemes exists, the matching phase of the operation where filter results have to be matched against local data to select those matches that are relevant to the particular task remains to be expensive as it requires expensive join operations. In this paper, we present an efficient middleware (FMware) for filtering and matching XML messages against locally available data. The proposed operator relies on a novel clusterdomain matching scheme to reduce the cost of the process. We analytically study the cost of the proposed middleware and experimentally show that it adaptively reduces the number of local data accesses and provides large savings in matching time with respect to cluster-unaware matching.

show abstract

Evaluating XPath Queries on XML Data Streams

Böttcher

Steinmetz

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An Efficient XPath Query Processor for XML Streams

Cited by 53 publications

References 25 publications

Efficient Streaming Algorithms for Tree Matching Problems

Efficient Streaming Algorithms for Tree Matching Problems

FMware: Middleware for Efficient Filtering and Matching of XML Messages with Local Data

Evaluating XPath Queries on XML Data Streams

Contact Info

Product

Resources

About