Support for Efficiently Processing Complex Queries over a P2P Substrate
Pedro Furtado · 2005
Recently, there has been some research emphasis on strategies to improve query functionality in distributed hash-table-based (DHT) peer-to-peer (P2P) systems, but no approach was able to define how complex schemas and queries can be implemented efficiently on top of it. In this paper, we propose a peer partitioned data management system (PPDM) for schema definition and query processing. We introduce "schema spaces" that allows complex schemas to be defined over a convenient set of nodes and define how simple and more complex schemas and queries are handled by the PPDM, laying the foundations for complex data management over P2P.