Database Paper Browser

Back to papers

Efficient Algorithms for Evaluating XPath over Streams

Summary: Proposes two streaming XPath algorithms, LQ (lazy) and EQ (eager), for Univariate XPath over streams. They achieve the O(|D||Q|) streaming time bound in one pass—the first to do so; EQ offers optimal buffering-space, and experiments show practical gains over prior stream-querying methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3857
Venue
SIGMOD
Year
2007
Pagerank
4.1945683e-05
Overall Rank
12,439 | 13.47%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers