"... In PAGE 25: ....2.1 Path Queries In the flrst experiment, we compare our algorithm TJFast with the previous work PathStack to match path pattern without branching nodes. For this purpose we flrst use XMark benchmark data and four path queries4 shown in Table3 . Figure 8(c) shows the execution time for two algorithms.... ..."

Cited by 29

Table 3: Path Queries on XMark data Path Query

"... In PAGE 9: ....2.1 Path Queries In the flrst experiment, we compare our algorithm TJ- Fast with the previous work PathStack to match path pattern without branching nodes. For this purpose we flrst use XMark benchmark data and four path queries4 shown in Table3 . Figure 5(c) shows the ex- ecution time for two algorithms.... ..."

Table 1. Restricting extension combinations for path queries.

"... In PAGE 8: ... Note furthermore that overlapping ref- erential attributes of overlapping objects may refer to both local and remote objects, depending on the de- cision function. Table1 now lists relevant cases and restrictions on possible answer tuples. (dfd denotes the decision function for the referential attribute d).... In PAGE 8: ... RelevantExtensions hence returns fCOg when applied to CQ. When applied to DQ, it returns fDLE; DO; DREg, but since the ref- erential attribute `owner apos; (d) is locally exclusive, from Table1 we can infer that DRE cannot contain objects satisfying Q. The modi ed version of Q is now as fol- lows.... ..."