Similarity Queries on Structured Data in Structured Overlays

Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, but data heterogeneities often demand for more complex query types, particularly similarity queries. In this work, we suggest a vertical data organization, which allows for efficient processing of similarity queries on instance as well as on schema level, and we introduce corresponding physical similarity operators. Our novel approach is shown to be suitable in conjunction with P-Grid, as an example of robust, large-scaled and self-organizing P2P systems. 1 Motivation P2P systems have been gained much attention not only as a platform for file sharing or as a new paradigm in distributed systems, but also by the database community. Beside P2P-based IR systems and peer data management systems (PDMS) as an extension of federated database systems, structured P2P systems based on distributed hash tables (DHT) are ...

• Type: Conference
• Year: 2006
• Where: ICDE
• Authors: Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswirth, Roman Schmidt
• Keywords: Database, Distributed Hash Tables, ICDE 2006, P2P Systems, Structured P2p Systems