Bucket (computing)

Bucket (computing)

In computing, the term bucket can have several meanings. It is used both as a live metaphor, and as a generally accepted technical term in some specialised areas. A bucket is most commonly a type of data buffer or a type of document or in which data is divided into regions.

Features of a bucket

Various usages relate to different features. There is no usage that is consistent with every one of these features.

*The contents of a bucket are unsorted.
*A bucket has a fixed size, which is determined when it is created.
*A bucket has a limited number of states:
**It may be empty.
**It may be full or partly full. Some usages further distinguish:
***It may be partly full.
***It may be full. Some usages further distinguish:
****It may be exactly full.
****It may be overflowing.
*A bucket must exist before anything can be put into it.

Types of bucket

Bit bucket

This is a humorous but common phrase. Something goes into the bit bucket when it is deleted, generally irreversibly and quite often wrongly, such as files or emails that just disappear.

It has been commonly suggestedFact|date=January 2008 that this usage dates from the days when punched cards and/or punched tape were commonFact|date=January 2008. Card and paper-tape punches each had a receptacle for the 'chips' punched from the cards or tape to create the holes (rectangular in a card, round in a paper tape), which often looked like a bucket and was known by this name. By analogy it was jokingly suggestedFact|date=January 2008 that the CPU, which in those days was an equipment rack of similar size to a large peripheral unit, contained a similar receptacle for lost data.

Documentation bucket

A bucket is a document of no definite size to which information of interest is added with no structure. Many software packages have a README file which is a bucket containing the very latest information. In IBM culture, such a file is known as a bucket and is opened for critical fixes and fix packages.

Bucket (buffer)

Buffers known as buckets are used:

*In the bucket sort algorithm.
*In bucket elimination algorithms.
*In the token bucket (TB) algorithm for network traffic shaping.
*In the leaky bucket (LB) algorithm for network traffic shaping.
*In bucket brigade algorithms.


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Bucket sort — Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting… …   Wikipedia

  • bucket list — noun a) A list of things to accomplish before ones death. b) <!used in computing: search bgc for cites from before 2007 …   Wiktionary

  • Category:Computing terminology — From Technical terminology: Technical terminology is the specialized vocabulary of a field. These terms have specific definitions within the field, which is not necessarily the same as their meaning in common use. Jargon is similar, but more… …   Wikipedia

  • EBB — Electronic Bulletin Board (Governmental » Military) * Euskadi Buru Batzar (International » Spanish) * Eccentric Bottom Bracket (Community » Sports) * Economic Bulletin Board (Business » International Business) * Entebbe, Kampala, Uganda (Regional …   Abbreviations dictionary

  • Data buffer — In computer science, a buffer is a region of a physical memory storage used to temporarily hold data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a… …   Wikipedia

  • HTB — Hierarchical Token Bucket (Computing » Networking) * Hyperion 2002 Term Trust, Inc. (Business » NYSE Symbols) * Terre De Bas, Guadeloupe (Regional » Airport Codes) …   Abbreviations dictionary

  • Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… …   Wikipedia

  • Hash function — A hash function is any well defined procedure or mathematical function for turning some kind of data into a relatively small integer, that may serve as an index into an array. The values returned by a hash function are called hash values, hash… …   Wikipedia

  • Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

  • Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”