Skip to main content
SpringerLink
Log in

Decay Models

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 37 Accesses

Definition

Decay models are applicable on data sets where data items are associated with points in a metric space (locations) and there is a notion of “significance” of a data item to a location, which decays (decreases) with the distance between the item and the location. This decrease is modeled by a decay function.

Each location has a “view” of the data set through a different weight distribution over the items: the weight associated with each item is its decayed weight which is a product of its original weight and a decay function applied to its distance from the observing location.

While global aggregates or statistics are computed over the set of items and their original weights, decaying aggregates or decaying statistics depend on the location with respect to which the aggregation is performed and on the decay function. Figure 1 illustrates a small network and the decaying sum with respect to all nodes.

Fig. 1
figure 1

Decaying sum over a network with respect to decay function \(...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Babcock B., Babu S., Datar M., Motwani R., Widom J. Models and issues in data stream systems. In: Proceeding of 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2002.

    Google Scholar 

  2. Bremler-Barr A., Cohen E., Kaplan H., and Mansour Y. Predicting and bypassing internet end-to-end service degradations. In: Proceeding of 2nd ACM SIGCOMM Workshop on Internet Measurement; 2002.

    Google Scholar 

  3. Cohen E. Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci. 1997;55:441–53.

    Article  MathSciNet  MATH  Google Scholar 

  4. Cohen E. and Kaplan H. Efficient estimation algorithms for neighborhood variance and other moments. In: Proceeding of 15th Annual ACM-SIAM Symposium on Discrete Algorithms; 2004.

    Google Scholar 

  5. Cohen E, Kaplan H. Spatially-decaying aggregation over a network: model and algorithms. J Comput Syst Sci. 2007;73:265–88.

    Article  MATH  Google Scholar 

  6. Cohen E. and Kaplan H. Summarizing data using bottom-k sketches. In: Proceeding of ACM SIGACT-SIGOPS 26th Symposium on the Principles of Distributed Computing; 2007.

    Google Scholar 

  7. Cohen E, Kaplan H, Oldham JD. Managing TCP connections under persistent HTTP. Comput Netw. 1999;31:1709–23.

    Article  Google Scholar 

  8. Cohen E. and Strauss M. Maintaining time-decaying stream aggregates. In: Proceeding of 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2003.

    Google Scholar 

  9. Cohen E, Strauss M. Maintaining time-decaying stream aggregates. J Algorithms. 2006;59:19–36.

    Article  MathSciNet  MATH  Google Scholar 

  10. Cormode G., Tirthapura S., and Xu B. Time-decaying sketches for sensor data aggregation. In: Proceeding of ACM SIGACT-SIGOPS 26th Symposium on the Principles of Distributed Computing; 2007.

    Google Scholar 

  11. Crespo A. and Garcia-Molina H. Routing indices for peer-to-peer systems. In: Proceeding of 18th International Conference on Data Engineering; 2002.

    Google Scholar 

  12. Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows. SIAM J Comput. 2002;31(6):1794–813.

    Article  MathSciNet  MATH  Google Scholar 

  13. Floyd S. and Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking, 1(4), 1993.

    Google Scholar 

  14. Gibbons P.B. and Tirthapura S. Distributed streams algorithms for sliding windows, In Proceeding of 14th Annual ACM Symposium on Parallel Algorithms and Architectures; p. 63–72 2002.

    Google Scholar 

  15. Guibas LJ, Knuth DE, Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica. 1992;7:381–413.

    Article  MathSciNet  MATH  Google Scholar 

  16. Hua M., Pei J., Fu A.W.C., Lin X., and Leung H.-F. Efficiently answering top-k typicality queries on large databases. In: Proceeding of 33rd International Conference on Very Large Data Bases; 2007.

    Google Scholar 

  17. Jacobson V. Congestion avoidance and control. In: Proceeding of ACM SIGMOD International Conference on Management of Data; 1988.

    Google Scholar 

  18. Keshav S, Lund C, Phillips S, Reingold N, Saran H. An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks. J Select Areas Commun. 1995;13(8):1371–82.

    Article  Google Scholar 

  19. Scott DW. Multivariate density estimation: Theory, practice and visualization. New York: Wiley; 1992.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs-Research, Florham Park, NJ, USA

    Edith Cohen

Authors
  1. Edith Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Edith Cohen .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. AT&T Labs - Research, AT&T, 1 AT&T Way, 07921, Bedminster, NJ, USA

    Divesh Srivastava

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Cohen, E. (2016). Decay Models. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_126-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_126-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation