ISE02-3: TSR: Temporal Subspace Routing for Peer-to-Peer Data Sharing

In this paper we present the temporal subspace routing (TSR) technique for peer-to-peer environments that allows transparent exchange of information defined using metadata and queries based on user interests. The system unifies generic semantic matching, routing, caching, and access control. The technique supports continuous queries that are matched against metadata profiles of remote resources. Both queries and profiles are defined as subspaces of a multi-dimensional content space. Matched objects may be downloaded or synchronized. We present a generic data structure with optimizations for matching in this environment and discuss several use cases where the system may be applied. The mechanism utilizes the covering relation between queries and profiles. This allows automatic taxonomies of downloaded profiles and queries. Our main application is peer- to-peer and ad hoc metadata-based resource and file sharing.