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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (150 KB)

Source

Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents

Napa Valley, California, USA

POSTER SESSION: Poster session 2 database table of contents

Pages 1407-1408

Year of Publication: 2008

ISBN:978-1-59593-991-3

Authors

Marcel Karnstedt	TU Ilmenau, Ilmenau, Germany
Kai-Uwe Sattler	TU Ilmenau, Ilmenau, Germany
Michael Haß	TU Ilmenau, Ilmenau, Germany
Manfred Hauswirth	National University Ireland Galway, Galway, Ireland
Brahmananda Sapkota	National University Ireland Galway, Galway, Ireland
Roman Schmidt	Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland

Sponsors

ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 50, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458304 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Karl Aberer , Magdalena Punceva , Manfred Hauswirth , Roman Schmidt, Improving Data Access in P2P Systems, IEEE Internet Computing, v.6 n.1, p.58-67, January 2002 [doi>10.1109/4236.978370]
	2	Marcel Karnstedt , Kai-Uwe Sattler , Michael Haß , Manfred Hauswirth , Brahmananda Sapkota , Roman Schmidt, Approximating query completeness by predicting the number of answers in DHT-based web applications, Proceeding of the 10th ACM workshop on Web information and data management, October 30-30, 2008, Napa Valley, California, USA [doi>10.1145/1458502.1458514]
	3	M. Karnstedt, K. Sattler, M. Richtarsky, J. Müller, M. Hauswirth, R. Schmidt, and R. John. UniStore: Querying a DHT-based Universal Storage. In ICDE'07 Demonstrations Program, pages 1503--1504, 2007.
	4	Dushyanth Narayanan , Austin Donnelly , Richard Mortier , Antony Rowstron, Delay aware querying with seaweed, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea

CITED BY 2

	Marcel Karnstedt , Kai-Uwe Sattler , Michael Haß , Manfred Hauswirth , Brahmananda Sapkota , Roman Schmidt, Approximating query completeness by predicting the number of answers in DHT-based web applications, Proceeding of the 10th ACM workshop on Web information and data management, October 30-30, 2008, Napa Valley, California, USA
	Marcel Karnstedt , Kai-Uwe Sattler , Manfred Hauswirth , Roman Schmidt, A DHT-based infrastructure for ad-hoc integration and querying of semantic data, Proceedings of the 2008 international symposium on Database engineering & applications, September 10-12, 2008, Coimbra, Portugal