Abstract
Efficient query processing in P2P systems poses a variety of challenges. As a special problem in this context we consider the evaluation of rank-aware queries, namely top-N and skyline, on structured data. The optimization of query processing in a distributed manner at each peer requires locally available statistics. In this paper, we address this problem by presenting approaches relying on the R-tree and histogram-based index structures. We show how this allows for optimizing rank-aware queries even over multiple attributes and thus significantly enhances the efficiency of query processing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hose, K., Karnstedt, M., Koch, A., Sattler, KU., Zinn, D. (2007). Processing Rank-Aware Queries in P2P Systems. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, JH., Ouksel, A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P DBISP2P 2006 2005. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71661-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-71661-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71660-0
Online ISBN: 978-3-540-71661-7
eBook Packages: Computer ScienceComputer Science (R0)