Estimating the number of answers with guarantees for structured queries in p2p databases

Authors:
Marcel Karnstedt;Kai-Uwe Sattler;Michael Haß;Manfred Hauswirth;Brahmananda Sapkota;Roman Schmidt
Affiliations:
TU Ilmenau, Ilmenau, Germany;TU Ilmenau, Ilmenau, Germany;TU Ilmenau, Ilmenau, Germany;National University Ireland Galway, Galway, Ireland;National University Ireland Galway, Galway, Ireland;Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 3
Cited 4

Improving Data Access in P2P Systems

IEEE Internet Computing
Delay aware querying with seaweed

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Approximating query completeness by predicting the number of answers in DHT-based web applications

Proceedings of the 10th ACM workshop on Web information and data management

A DHT-based infrastructure for ad-hoc integration and querying of semantic data

IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Approximating query completeness by predicting the number of answers in DHT-based web applications

Proceedings of the 10th ACM workshop on Web information and data management
Distributed processing of continuous join queries using DHT networks

Proceedings of the 2009 EDBT/ICDT Workshops
Scalable distributed indexing and query processing over Linked Data

Web Semantics: Science, Services and Agents on the World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating the number of answers for structured queries can help approximating query completeness, but is especially challenging. In this paper, we propose to use routing graphs in order to achieve this. We introduce the general approach and briefly discuss further aspects like overhead and guarantees.