Collection - Queue (FIFO)

Data System Architecture


A queue is collection:

  • that follows by default a first-in, first-out methodology
  • where the first element is the first element to be retrieved / removed
  • where the concept of first may be defined.

For instance, first may be define as

If the queue has a fixed size (capacity), adding an element will delete the oldest one.


wiki/Queueing_theory is the mathematical study of waiting lines



Documentation / Reference

Discover More
Data System Architecture
(Collection|Container) Data Type (Set, Bag, Sequence)

A collection is a abstract data type for grouping together multiple values. It's therefore sometime known as a container and creates a aggregation relationship A collection is: an object that groups...
Event Centric Thinking
(Stream|Pipe|Message Queue|Event Processing)

From an abstract point of view, a stream is a sequence of aninfinite cardinality (size) delivered at unknown time intervals. list Streams: are inputs and outputs of operations may be also buffers...
Data Modeling Chebotko Logical
Cassandra - Queue

This article is queue in cassandra. Queue are not well supported in cassandra because deleted items are tombstones . Cassandra must scan past in order to read from the front of the queue....
Data System Architecture
Collection - Priority Queue

A priority queue is a queue where the first element to be retrieved is an element that has the highest priority attribute. An element with high priority is served before an element with low priority....
Data System Architecture
Collection - Stack (LIFO)

A stack implements a LIFO methodology. The last element added is the first element retrieved (“last-in, first-out”).
Data System Architecture
Data - Transaction (Trans(versal?) actions)

A single logical operation on the data is called a transaction. A physical operation is called a request and therefore a transaction is a queue of request. For example, a transfer of funds from one bank...
Card Puncher Data Processing
Data Processing - Reactive Stream Processing

Reactive Streams is the standard/specification for reactive data processing (ie observer, asynchronous processing) The characteristics are: functional programming fashion non-blocking backpressure...
Card Puncher Data Processing
Data Processing - Buffer (Batch concept in code)

Buffers are catalog containers of a (fixed|variable with max) amount of data or operations. memoryblocksdisk Without buffer, each read or write request is handled directly by the underlying layer (OS,...
Data System Architecture
FIFO (first-in, first-out)

FIFO means first-in, first-out and is the queue operation where the element removed is the oldest one in the queue (whereas in a LIFO it's the youngest one) You will find this operation: in a basic...
Undraw File Manager Re Ms29
File - Special File

A special file is a type of file that define devices for the system or temporary files created by processes. There are three basic types of special files: FIFO (first-in, first-out), block,...

Share this page:
Follow us:
Task Runner