Supporting complex query with structured overlays in schema-based p2p system

Authors:
Min Yu;Zhanhuai Li;Longbo Zhang
Affiliations:
School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China;School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China;School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China
Venue:
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Year:
2006

Citing 5
Cited 0

Design issues and challenges for RDF- and schema-based peer-to-peer systems

ACM SIGMOD Record
Efficient query reformulation in peer data management systems

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
BATON: a balanced tree structure for peer-to-peer networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Similarity Queries on Structured Data in Structured Overlays

ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Data sharing through query translation in autonomous sources

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite of their advantages in scalability and routing efficiency, structured peer-to-peer(P2P) overlay networks fail to support complex queries in a network of peers with heterogeneous schemas, which limits their use in schema-based P2P systems. By using relation keywords as index key for schema info and partitioning tuples vertically, a method of indexing both schema and data with structured overlay is designed. And an algorithm based on these two levels of indices to support complex queries on multiple attributes is proposed. Qualitative analysis and comparison show that this work is closer to the goal of P2P data management than other projects.