Bibliograph.
Daten | Memon, 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).
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik.
S. 311-319, englisch.
IEEE Computer Society, 8. Dezember 2008.
ISBN: 978-0-7695-3434-3.
Artikel in Tagungsband (Konferenz-Beitrag).
|
|---|
| CR-Klassif. | C.2.2 (Network Protocols)
C.2.3 (Network Operations)
C.2.4 (Distributed Systems)
|
|---|
| Kurzfassung | 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.
|
|---|
Volltext und
andere Links | PDF (998340 Bytes)
The original publication is available at IEEE Xplore
|
|---|
| Copyright | Published in proceedings of 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS'08), pages 311-319, Melbourne, Australia, December 2008. © IEEE 2008 http://dx.doi.org/10.1109/ICPADS.2008.57 |
|---|
| Kontakt | faraz.memon@ipvs.uni-stuttgart.de |
|---|
| Abteilung(en) | Universität Stuttgart, Institut für Parallele und Verteilte Systeme, Verteilte Systeme
|
|---|
| Projekt(e) | SuperP2P
|
|---|
| Eingabedatum | 1. September 2008 |
|---|