Patent Document ID: 8255410
Application ID: 12412544

Base Claim:
1. A method in a first computer system, comprising: normalizing an expression tree that is representative of a query into a normalized expression tree; transforming the normalized expression tree into a resource bound expression tree by mapping a first sub-expression of the normalized expression tree to a first uniform resource indicator (URI) component, mapping a second sub-expression of the normalized expression tree to a second URI component, and validating the first and second URI components by determining whether each URI component mapped from a sub-expression of the normalized expression tree is a legal addition to the resource bound expression tree; and translating the resource bound expression tree into a URI formatted according to a convention shared between the first computer system and a second computer system configured to respond to the URI in response to a determination that each URI component is a legal addition to the resource bound expression tree.

---

Claim 4:
4. The method of claim 1 , wherein said validating further comprises: indicating an error if at least one URI component is determined to not be a legal addition to the resource bound expression tree.