10. A computer program product comprising a computer-readable memory having computer program logic recorded thereon for enabling a processor to convert a query to a uniform resource indicator (URI), comprising: first computer program logic for enabling the processor to normalize an expression tree that is representative of a query into a normalized expression tree; second computer program logic for enabling the processor to transform the normalized expression tree into a resource bound expression tree, the second computer program logic including fourth computer program logic for enabling the processor to map a first sub-expression of the normalized expression tree to a first URI component; fifth computer program logic for enabling the processor to map a second sub-expression of the normalized expression tree to a second URI component; and sixth computer program logic for enabling the processor to validate the first and second URI components, the sixth computer program logic including computer program logic for enabling the processor to determine 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 computer program logic for enabling the processor to enable translation of the resource bound expression tree into the URI if each URI component is determined to be a legal addition to the resource bound expression tree; and third computer program logic for enabling the processor to translate the resource bound expression tree into a URI formatted according to a convention shared between a first computer system configured to transmit the URI 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.
10. A computer program product comprising a computer-readable memory having computer program logic recorded thereon for enabling a processor to convert a query to a uniform resource indicator (URI), comprising: first computer program logic for enabling the processor to normalize an expression tree that is representative of a query into a normalized expression tree; second computer program logic for enabling the processor to transform the normalized expression tree into a resource bound expression tree, the second computer program logic including fourth computer program logic for enabling the processor to map a first sub-expression of the normalized expression tree to a first URI component; fifth computer program logic for enabling the processor to map a second sub-expression of the normalized expression tree to a second URI component; and sixth computer program logic for enabling the processor to validate the first and second URI components, the sixth computer program logic including computer program logic for enabling the processor to determine 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 computer program logic for enabling the processor to enable translation of the resource bound expression tree into the URI if each URI component is determined to be a legal addition to the resource bound expression tree; and third computer program logic for enabling the processor to translate the resource bound expression tree into a URI formatted according to a convention shared between a first computer system configured to transmit the URI 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. 13. The computer program product of claim 10 , wherein the sixth computer program logic further comprises: computer program logic for enabling the processor to indicate an error if at least one URI component is determined to not be a legal addition to the resource bound expression tree.