Support for efficiently processing complex queries over a P2P substrate

Author

Furtado, Pedro

Author_Institution

DEI/CISUC, Univ. de Coimbra, Portugal

Volume

2

fYear

2005

fDate

28-30 March 2005

Firstpage

303

Abstract

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.

Keywords

file organisation; peer-to-peer computing; query processing; P2P substrate; complex data management; distributed hash-table; peer partitioned data management system; peer-to-peer system; query functionality; query processing; schema definition; schema spaces; Conference management; Delta modulation; Fault tolerance; Floods; Indexing; Peer to peer computing; Query processing; Routing; Samarium; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on

ISSN

1550-445X

Print_ISBN

0-7695-2249-1

Type

conf

DOI

10.1109/AINA.2005.317

Filename

1423699