Answer:
The Distributed Pattern Matching (DPM) problem have provided mathematical analysis and simulation results for establishing the effectiveness of the proposed architecture. DPMS achieves many desirable properties of both the unstructured and structured P2P systems. Like unstructured systems DPMS supports partial keyword matching, utilizes the heterogeneity in peer capabilities, and does not place any hard restriction on index/document placement. Like structured systems, on the other hand, DPMS attains logarithmic bound on search complexity and offers guarantee on search completeness and discovery of rare items. Advertisement traffic in DPMS is comparable to that of DHT-based structured P2P systems. To our knowledge Distributed Pattern Matching (DPM) problem has never been addressed by any research activity in P2P context. 1 The index distribution architecture of DPMS is unique and has been designed specifically to solve the DPM problem. The novel aggregation scheme, proposed in this paper, can effectively reduce storage overhead at the indexing peers without incurring a significant decrease in query routing performance. However, the use of bloom filter for representing indices is not new. Many network applications use bloom filters. A comprehensive list of such applications can be found in [6]. The rest of this paper is organized as follows. Section II highlights and compares the approaches related to DPMS. The architecture and operation of DPMS are presented in section III. Mathematical analysis of search complexity in DPMS is provided in section IV.