Spatial Matching
Let ST be a 2D-PIR sequence of the form
[
(t1,xp1,yp1),
(t2,xp2,yp2),...
(tn,xpn,ypn) ]
Let P be a 2D-PIR pattern:
- a 2D-PIR sequence is a pattern, matching exactly
- the symbol
? matches any single component of
(ti,xpi,ypi)
- the symbol
.. matches any 2D-PIR sequence (shortest if multiple matches)
Let L* be the set of all subsequences of ST.
The spatial matching predicate is defined as:
|