We discuss the way of using keyword search in the case of P2P connected relational databases. Each peer is then an agent deciding about translation and propagation of a keyword query, as well as about the way of merging partial answers. The way of merging (partial or total) is essential for both efficiency of execution and information contents in the final answer. We prove a theorem stating a necessary condition for deciding about the strategy of merging made by a peer.