Approximating query completeness by predicting the number of answers in DHT-based web applications

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 (NUIG), Galway, Ireland;National University Ireland Galway (NUIG), Galway, Ireland;Ecole Polytechnique Federale de Lausanne (EPFL), Lausanne, Switzerland
Venue:
Proceedings of the 10th ACM workshop on Web information and data management
Year:
2008

Citing 10
Cited 2

Improving Data Access in P2P Systems

IEEE Internet Computing
Completeness Information and Its Application to Query Processing

VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
PlanetLab: an overlay testbed for broad-coverage services

ACM SIGCOMM Computer Communication Review
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network

Proceedings of the 13th international conference on World Wide Web
Completeness of integrated information sources

Information Systems - Special issue: Data quality in cooperative information systems
Delay aware querying with seaweed

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Completeness Estimation of Range Queries in Structured Overlays

P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Querying the internet with PIER

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Top-k query evaluation with probabilistic guarantees

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Estimating the number of answers with guarantees for structured queries in p2p databases

Proceedings of the 17th ACM conference on Information and knowledge management

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

Proceedings of the 17th ACM conference on Information and knowledge management
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

Due to the rapid development of theWeb, applications based on the P2P paradigm gain more and more interest. Recently, such systems start to evolve to adopt standard database functionalities in terms of complex query processing support. This goes far beyond simple key lookups, as provided by standard DHT systems, which makes estimating the completeness of query answers a crucial challenge. In this paper, we discuss the semantics of completeness for complex queries in P2P database systems and propose methods based on the notion of routing graphs for estimating the number of expected query answers. Further, we discuss probabilistic guarantees for the estimated values and evaluate the proposed methods through an implemented system.