MAPS: Multi-Attribute Search in P2P Networks using Schema

Current peer-to-peer (P2P) infrastructures such as CAN, Chord and Tapestry provide scalable infrastructure for simple keyword based search. But, they cannot be applied directly in many real-life applications that use multi-attribute schema. In this paper, we present MAPS, an algorithm that supports multi-attribute schema and offers multi-attribute search capability in P2P network. The presented algorithm extends Tapestry routing algorithm and is capable of supporting complete as well as partial match of multi-attribute queries. We implemented the algorithm and conducted a number of experiments to study the performance behaviour of MAPS. A comparison with other multi-attribute search methods like MAAN demonstrates the usefulness of MAPS.