Hello,
I am studying the paper "Storing and Querying Large XML Instances".
[https://files.basex.org/publications/Gruen%20%5B2010%5D,%20Storing%20and%20Querying%20Large%20XML%20Instances.pdf]
This is very interesting and helpful to read! I apologize I fail to
understand the following in 3.4.2.1 Staircase Join:
"In the partitioned plane, the scanned areas are made disjunct, i.e.,
scanning is canceled whenever the pre value of the currently scanned
node equals the pre value of the next context node."
Since pre values are unique (?), I couldn't follow how the next
context node would have the same pre value. For the partitioning
step, I had the impression the next context node is not the same as
the current context node, nor would it be a descendant of the current
context node.
Thank you,
Yasir