Containment and equivalence for an XPath fragment

By Gerome Miklau, Dan Suciu. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

297 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/3c8e181170faca4a455ba23e2fe744ff0667d7b5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Christoph E. Koch
2. Georg Gottlob
3. Reinhard Pichler

In Computer Networks and Communications

1. Christoph E. Koch
2. Georg Gottlob
3. Reinhard Pichler

Citations in the corpus

• 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. 2002; Green et al. 2003; Peng and Chawathe 2003; Gupta and Suciu 2003; Bar-Yossef et al. 2004] and on…”