Abstract
Query processing in overlay networks has been receiving significant attention from researchers recently. Such systems offer flexibility and de-centralization. The challenge is to add representation and query capacity in such a networked environment, resulting in a peer-to-peer data management system. The issue of how schemas can be incorporated and queried in p2p while abiding to the de-centralized and flexible philosophy has not been properly handled. In this paper we analyze constructs and strategies to build database-like schemas and process simple queries over those schemas on P2P. For this we describe schema spaces, attribute value locators and data shipment issues. We also engage in experimental work to analyze our proposals using a network simulator to test the strategies with different networked scenarios.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cai, M., Frank, M., Chen, J., Szekely, P.: A Scalable Distributed RDF Repository based on A Structured Peer-to-Peer Network. In: Proceedings of the 13th international conference on World Wide Web, New York, NY, USA
Cai, M., Frank, M., Chen, J., Szekely, P.: MAAN: A multi-attribute addressable network for grid information services. In: 4th Int’l Workshop on Grid Computing (2003)
Harvey, N., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: USENIX Symposium on Internet Technologies and Systems (2003)
Huebsch, R., et al.: Querying the Internet with PIER. In: VLDB 2003, pp. 321–332 (2003)
Ng, T.E., Zang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: The 21st IEEE INFOCOMM (June 2002)
Ratnasamy, S., Handley, M., Karp, R.M., Shenker, S.: Topologically-Aware Overlay Construction and Server Selection. In: INFOCOM 2002 (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: ACM SIGCOMM (2001)
RDF Schema, World-Wide Web Consortium, http://www.w3.org/TR/rdf-schema
Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6(1) (2002)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)
Szymaniak, M., et al.: Scalable Latency Estimation. In: Intl. Conf. on Parallel and Distributed Systems, ICPADS, Newport Beach, USA (July 2004)
Triantafillou, P., Pitoura, T.: Towards a Unified Framework for Complex Query Processing Over Structured Peer-to-Peer Data Networks. In: HDMS 2003 (2003)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Report CSD-01-1141, UC Berkeley (2001)
Zegura, E., Calvert, K., Bhattacharjee, S.: How to Model an Internetwork. In: Proceedings IEEE Infocom. 1996, CA (May 1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furtado, P. (2005). Schemas and Queries over P2P. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_79
Download citation
DOI: https://doi.org/10.1007/11546924_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)