Algebraic Query Optimization for Distributed Top-k Queries
| dc.contributor.author | Neumann, Thomas | |
| dc.contributor.author | Michel, Sebastian | |
| dc.contributor.editor | Kemper, Alfons | |
| dc.contributor.editor | Schöning, Harald | |
| dc.contributor.editor | Rose, Thomas | |
| dc.contributor.editor | Jarke, Matthias | |
| dc.contributor.editor | Seidl, Thomas | |
| dc.contributor.editor | Quix, Christoph | |
| dc.contributor.editor | Brochhaus, Christoph | |
| dc.date.accessioned | 2020-02-11T13:22:07Z | |
| dc.date.available | 2020-02-11T13:22:07Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient algebraic optimization of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query are distributed across a number of data peers and the computational costs include network latency, bandwidth consumption, and local peer work. We use a dynamic programming approach to find the optimal execution plan using compact data synopses for selectivity estimation that is the basis for our cost model. The optimized query is executed in a hierarchical way involving a small and fixed number of communication phases. We have performed experiments on real web data that show the benefits of distributed top-k query optimization both in network resource consumption and query response time. | en |
| dc.identifier.isbn | 978-3-88579-197-3 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/31808 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | Datenbanksysteme in Business, Technologie und Web (BTW 2007) – 12. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS) | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-103 | |
| dc.title | Algebraic Query Optimization for Distributed Top-k Queries | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 343 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 324 | |
| gi.conference.date | 07.-09.03.2007 | |
| gi.conference.location | Aachen | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1