Search-based Contextual Routing via Isomorphic URIs

Introduction
It is the intent of this paper to describe a system whereby a strong isomorphic relationship is retained between a data resource request and the data returned by a resource via a search-based method to derive contextual meaning from compliant Uniform Resource Identifiers (URI) . URIs retaining a strong isomorphic relationship between a resource request and returned data as described within the scope of this paper will be referred to as Isomorphic Uniform Resource Identifiers (IURIs). Further, a primary method used to retain a strong isomorphic relationship between IURIs and the returned data will be referred to as Search-based Contextual Routing (SbCR).

Resource Request and Return Relationships
A resource request (REQ) as a URI and a resource return (RET) as data will express an isomorphic exchange where elements of a URI can be correspondingly mapped unto the returned data structure and where a data’s structure can be correspondingly mapped onto the elements of a URI – simply, the process must be reversible. Many transformations between the original REQ and RET may occur, though a corresponding mapping must largely be retained to qualify as an isomorphic exchange.

Today, many such corresponding mappings of URIs and data are implemented on the internet — however, the strength of isomorphism and the methods in which the data is mapped varies wildly. The varying degrees of isomorphism and data mapping, though usually URI-compliant, make it difficult to reliably request data from a given resource without intimate knowledge of how that resources is structured…

This is an excerpt, find the full text here:
Search-based Contextual Routing via Isomorphic Uniform Resource Identifiers

You can see Search-based Contextual Routing in action at: IPR Wire
(tip: click around and play with the URIs)