Skip to main content
SpringerLink
Log in

Maintenance strategies for routing indexes

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hose, K., Roth, A., Zeitz, A., Sattler, K., Naumann, F.: A research agenda for query processing in large-scale peer data management systems. Inform. Syst. J. 33, 597–610 (2008)

    Article  Google Scholar 

  2. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: ICDCS’02, pp. 23–32 (2002)

  3. Petrakis, Y., Koloniari, G., Pitoura, E.: On using histograms as routing indexes in peer-to-peer systems. In: DBISP2P’04, pp. 16–30 (2004)

  4. Hose, K., Klan, D., Sattler, K.: Distributed data summaries for approximate query processing in PDMS. In: IDEAS’06, pp. 37–44 (2006)

  5. Hose, K., Quasebarth, J., Sattler, K.: Interoperability in peer data management systems. In: SDSI’07, pp. 152–171 (2007)

  6. Halevy, A., Ives, Z., Suciu, D., Tatarinov, I.: Schema mediation in peer data management systems. In: ICDE’03 (2003)

  7. Poosala, V., Ioannidis, Y.: Selectivity estimation without the attribute value independence assumption. In: VLDB’97, pp. 486–495 (1997)

  8. Muralikrishna, M., DeWitt, D.: Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In: SIGMOD’88, pp. 28–36 (1988)

  9. Gunopulos, D., Kollios, G., Tsotras, V., Domeniconi, C.: Approximating multi-dimensional aggregate range queries over real attributes. In: SIGMOD’00, pp. 463–474 (2000)

  10. Gibbons, P., Matias, Y., Poosala, V.: Fast incremental maintenance of approximate histograms. In: VLDB’97, pp. 466–475 (1997)

  11. Chen, C., Roussopoulos, N.: Adaptive selectivity estimation using query feedback. SIGMOD Rec. 23(2), 161–172 (1994)

    Article  Google Scholar 

  12. Stillger, M., Lohman, G.M., Markl, V., Kandil, M.: LEO–DB2’s LEarning Optimizer. In: VLDB’01, pp. 19–28 (2001)

  13. Aboulnaga, A., Chaudhuri, S.: Self-tuning histograms: building histograms without looking at data. SIGMOD Rec. 28(2), 181–192 (1999)

    Article  Google Scholar 

  14. Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: a multidimensional workload-aware histogram. SIGMOD Rec. 30(2), 211–222 (2001)

    Article  Google Scholar 

  15. Srivastava, U., Haas, P.J., Markl, V., Kutsch, M., Tran, T.M.: ISOMER: consistent histogram construction using query feedback. In: ICDE’06, p. 39 (2006)

  16. Hose, K.: Processing rank-aware queries in schema-based P2P networks. Ph.D. thesis, TU Ilmenau (2009)

  17. Saito, Y., Shapiro, M.: Optimistic replication. Comput. Surveys 37(1), 42–81 (2005)

    Article  Google Scholar 

  18. Gray, J., Helland, P., O’Neil, P., Shasha, D.: The dangers of replication and a solution. In: SIGMOD’96, pp. 173–182 (1996)

  19. Eugster, P., Guerraoui, R., Kermarrec, A., Massoulié, L.: From epidemics to distributed computing. IEEE Comput. 37(5), 60–67 (2004)

    Google Scholar 

  20. Aboulnaga, A., Haas, P., Kandil, M., Lightstone, S., Lohmann, G., Markl, V., Popivanov, I., Raman, V.: Automated statistics collection in DB2 UDB. In: VLDB’2004, pp. 1158–1169 (2004)

  21. Dar, S., Franklin, M., Jónsson, B., Srivastava, D., Tan, M.: Semantic data caching and replacement. In: VLDB’96, pp. 330–341 (1996)

  22. Hose, K., Lemke, C., Quasebarth, J., Sattler, K.: SmurfPDMS: a platform for query processing in large-scale PDMS. In: BTW 2007, LNI, vol. 103, pp. 621–624 (2007)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automation, TU Ilmenau, P.O. Box 100565, 98684, Ilmenau, Germany

    Katja Hose, Christian Lemke & Kai-Uwe Sattler

Authors
  1. Katja Hose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Lemke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai-Uwe Sattler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katja Hose.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hose, K., Lemke, C. & Sattler, KU. Maintenance strategies for routing indexes. Distrib Parallel Databases 26, 231 (2009). https://doi.org/10.1007/s10619-009-7048-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10619-009-7048-5

Keywords

Search

Navigation