Terpstra, Wesley ; Behnel, Stefan ; Fiege, Ludger ; Kangasharju, Jussi ; Buchmann, Alejandro
Hrsg.: Bertino, Elisa (2004)
Bit Zipper Rendezvous: Optimal Data Placement for General P2P Queries.
Advances in database technology - EDBT 2004 : 9th International Conference on Extending Database Technology. Heraklion, Crete, Greece (March 14 - 18, 2004)
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
In many distributed applications, pairs of predicates and data have to be evaluated locally. This includes publish-subscribe, keyword search for documents, and selection queries on tuples. We will present the Bit Zipper Rendezvous as a peer-to-peer based solution to these problems. Though not as efficient as value-based partitioning approaches, the Bit Zipper's generality complements them. Where ooding to N nodes used to be the fall-back, the Bit Zipper is a replacement needing only O(pN). Finally, for the all-pairs variant of these problems, we will show the optimality of our approach.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2004 |
| Herausgeber: | Bertino, Elisa |
| Autor(en): | Terpstra, Wesley ; Behnel, Stefan ; Fiege, Ludger ; Kangasharju, Jussi ; Buchmann, Alejandro |
| Art des Eintrags: | Bibliographie |
| Titel: | Bit Zipper Rendezvous: Optimal Data Placement for General P2P Queries |
| Sprache: | Englisch |
| Publikationsjahr: | 2004 |
| Verlag: | Springer |
| Buchtitel: | Proceedings of the International Workshop on Peer-to-Peer Computing & Data Bases |
| Reihe: | LNCS |
| Band einer Reihe: | 2992 |
| Veranstaltungstitel: | Advances in database technology - EDBT 2004 : 9th International Conference on Extending Database Technology |
| Veranstaltungsort: | Heraklion, Crete, Greece |
| Veranstaltungsdatum: | March 14 - 18, 2004 |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | In many distributed applications, pairs of predicates and data have to be evaluated locally. This includes publish-subscribe, keyword search for documents, and selection queries on tuples. We will present the Bit Zipper Rendezvous as a peer-to-peer based solution to these problems. Though not as efficient as value-based partitioning approaches, the Bit Zipper's generality complements them. Where ooding to N nodes used to be the fall-back, the Bit Zipper is a replacement needing only O(pN). Finally, for the all-pairs variant of these problems, we will show the optimality of our approach. |
| Zusätzliche Informationen: | Received best paper award no printed proceedings - CD only |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Datenbanken und Verteilte Systeme 20 Fachbereich Informatik > Telekooperation |
| Hinterlegungsdatum: | 31 Dez 2016 12:59 |
| Letzte Änderung: | 13 Dez 2018 12:54 |
| PPN: | |
| Zugehörige Links: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum