Keynote 3 - Distributed Pattern Matching

Summary form only given. Since the advent of P2P technology experts from industry and academia have proposed a number of search techniques - none of which is able to provide satisfactory solution to the conflicting requirements of search efficiency and flexibility. Structured search techniques, mostly DHT-based, are bandwidth efficient while semi(un)-structured techniques are flexible. But, neither achieves both ends. This paper introduces a generic framework called distributed pattern matching to address the search problem in distributed environments while achieving both search flexibility and efficiency.