TY - JOUR
AU - Sattler, Kai-Uwe
AB - Query processing in large-scale unstructured P2P networks is a crucial part of operating such systems. In order to avoid expensive flooding of the network during query processing so-called routing indexes are used. Each peer maintains such an index for its neighbors. It provides a compact representation (data summary) of data accessible via each neighboring peer. An important problem in this context is to keep these data summaries up-to-date without paying high maintenance costs. In this paper, we investigate the problem of maintaining distributed data summaries in P2P-based environments without global knowledge and central instances. Based on a classification of update propagation strategies, we discuss several approaches to reduce maintenance costs and present results from an experimental evaluation.
TI - Maintenance strategies for routing indexes
JO - Distributed and Parallel Databases
DO - 10.1007/s10619-009-7048-5
DA - 2009-07-09
UR - https://www.deepdyve.com/lp/springer-journals/maintenance-strategies-for-routing-indexes-pcYlCStr4r
SP - 231
EP - 259
VL - 26
IS - 3
DP - DeepDyve
ER -