Efficient filtering of XML documents with XPath expressions
By Chee Yong Chan, Pascal Felber, Minos N. Garofalakis, Rajeev Rastogi. Proceedings / International Conference on Data Engineering, 2002
425 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/92856bea85576ad75fdca92a30b1559183c9d6ea
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Anne-Marie Kermarrec
- M. Franklin
- Johannes Gehrke
- Rachid Guerraoui
- Mirek Riedewald
- Christoph E. Koch
- Georg Gottlob
- Reinhard Pichler
In Signal Processing
- M. Franklin
- Johannes Gehrke
- Mirek Riedewald
- Dan Suciu
- Ashish Kumar Gupta
- Christoph E. Koch
- Georg Gottlob
- Reinhard Pichler
Citations in the corpus
- Towards Expressive Publish/Subscribe Systems (2006, background): “Work on large-scale filtering of streaming XML documents handles query languages that are fragments of XPath, which is more expressive than pub/sub [13, 10, 18, 17].”
- Stream processing of XPath queries with predicates (2003, methodology): “It builds a separate FSM for each query; as a result it does not exploit commonality that exists among the path expressions; XTrie [4] indexes sub-strings of path expressions that only contain parent-child operators, and shares the processing of only these common sub-strings among the queries;”
- The many faces of publish/subscribe (2003, methodology): “…grammar, such as SQL [Hapner et al. 2002; Oracle 2002; Lewis 1999], OMG s Default Filter Constraint Language [OMG 2002b], XPath [Altinel and Franklin 2000; Chan et al. 2002a; Diao et al. 2002], or some proprietary language [Banavar et al. 1999a; Carzaniga et al. 2001; Segall and Arnold 1997].”
- Path sharing and predicate evaluation for high-performance XML filtering (2003, methodology): “5Note that the performance of XTrie was also compared with that of XFilter [Chan et al. 2002] for a similar workload.”
- Efficient algorithms for processing XPath queries (2002, background): “Recently, there has been some work on the query evaluation problem for very restrictive fragments of XPath (usually in the context of data stream processing) [Altinel and Franklin 2000; Chan et al. 2002b; Green et al. 2003; Peng and Chawathe 2003; Gupta and Suciu 2003; Bar-Yossef et al. 2004] and on”