Article in Proceedings INPROC-2008-83

BibliographyMemon, Faraz; Tiebler, Daniel; Dürr, Frank; Rothermel, Kurt; Tomsu, Marco; Domschitz, Peter: OID: Optimized Information Discovery using Space Filling Curves in P2P Overlay Networks.
In: Proceedings of 14th International Conference on Parallel and Distributed Systems (ICPADS'08).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
pp. 311-319, english.
IEEE Computer Society, December 8, 2008.
ISBN: 978-0-7695-3434-3.
Article in Proceedings (Conference Paper).
CR-SchemaC.2.2 (Network Protocols)
C.2.3 (Network Operations)
C.2.4 (Distributed Systems)

In this paper, we present the system design and evaluation of a Space-Filling Curve (SFC)-based P2P information discovery system OID. The OID system uses multiple SFCs to significantly optimize the performance of multi-attribute range queries, particularly for applications with a large number of data attributes where a single big SFC-based index is inefficient. The basic idea is to have multiple SFCbased indices and select the best one to perform a query. We also introduce two tree-based query optimizations that increase the scalability of the system.

Full text and
other links
PDF (998340 Bytes)
The original publication is available at IEEE Xplore
CopyrightPublished in proceedings of 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS'08), pages 311-319, Melbourne, Australia, December 2008. © IEEE 2008
Department(s)University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems
Entry dateSeptember 1, 2008
   Publ. Department   Publ. Institute   Publ. Computer Science