In EDS ansehen

Distributed top- k query processing by exploiting skyline summaries.

Gespeichert in:
Bibliographische Detailangaben
Titel: Distributed top- k query processing by exploiting skyline summaries.
Autoren: Vlachou, Akrivi, Doulkeridis, Christos, Nørvåg, Kjetil
Quelle: Distributed & Parallel Databases; Aug2012, Vol. 30 Issue 3/4, p239-271, 33p
Schlagwörter: QUERYING (Computer science), DISTRIBUTED computing, RELEVANCE ranking (Information science), DATA analysis, CLIENT/SERVER computing, DISTRIBUTED databases
Abstract: Recently, a trend has been observed towards supporting rank-aware query operators, such as top- k, that enable users to retrieve only a limited set of the most interesting data objects. As data nowadays is commonly stored distributed over multiple servers, a challenging problem is to support rank-aware queries in distributed environments. In this paper, we propose a novel approach, called DiTo, for efficient top- k processing over multiple servers, where each server stores autonomously a fraction of the data. Towards this goal, we exploit the inherent relationship of top- k and skyline objects, and we employ the skyline objects of servers as a data summarization mechanism for efficiently identifying the servers that store top- k results. Relying on a thresholding scheme, DiTo retrieves the top- k result set progressively, while the number of queried servers and transferred data is minimized. Furthermore, we extend DiTo to support data summarizations of bounded size, thus restricting the cost of summary distribution and maintenance. To this end, we study the challenging problem of finding an abstraction of the skyline set of fixed size that influences the performance of DiTo only slightly. Our experimental evaluation shows that DiTo performs efficiently and provides a viable solution when a high degree of distribution is required. [ABSTRACT FROM AUTHOR]
Copyright of Distributed & Parallel Databases is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:Recently, a trend has been observed towards supporting rank-aware query operators, such as top- k, that enable users to retrieve only a limited set of the most interesting data objects. As data nowadays is commonly stored distributed over multiple servers, a challenging problem is to support rank-aware queries in distributed environments. In this paper, we propose a novel approach, called DiTo, for efficient top- k processing over multiple servers, where each server stores autonomously a fraction of the data. Towards this goal, we exploit the inherent relationship of top- k and skyline objects, and we employ the skyline objects of servers as a data summarization mechanism for efficiently identifying the servers that store top- k results. Relying on a thresholding scheme, DiTo retrieves the top- k result set progressively, while the number of queried servers and transferred data is minimized. Furthermore, we extend DiTo to support data summarizations of bounded size, thus restricting the cost of summary distribution and maintenance. To this end, we study the challenging problem of finding an abstraction of the skyline set of fixed size that influences the performance of DiTo only slightly. Our experimental evaluation shows that DiTo performs efficiently and provides a viable solution when a high degree of distribution is required. [ABSTRACT FROM AUTHOR]
ISSN:09268782
DOI:10.1007/s10619-012-7094-2