Editing Reference counting (section)

===Garbage collection===
As a collection algorithm, reference counting tracks, for each object, a count of the number of [[reference (computer science)|reference]]s to it held by other objects. If an object's reference count reaches zero, the object has become inaccessible, and can be destroyed.

When an object is destroyed, any objects referenced by that object also have their reference counts decreased. Because of this, removing a single reference can potentially lead to a large number of objects being freed. A common modification allows reference counting to be made incremental: instead of destroying an object as soon as its reference count becomes zero, it is added to a list of unreferenced objects, and periodically (or as needed) one or more items from this list are destroyed.

Simple reference counts require frequent updates. Whenever a reference is destroyed or overwritten, the reference count of the object it references is decremented, and whenever one is created or copied, the reference count of the object it references is incremented.

Reference counting is also used in file systems and distributed systems, where full non-incremental tracing garbage collection is too time-consuming because of the size of the object graph and slow access speed.<ref>{{cite journal|doi=10.1145/3156818|title=A Study on Garbage Collection Algorithms for Big Data Environments|journal=ACM Computing Surveys|volume=51|pages=1–35|year=2018|last1=Bruno|first1=Rodrigo|last2=Ferreira|first2=Paulo|s2cid=21388487}}</ref>