FIFO (first-in, first-out)

Data System Architecture


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:

Discover More
Data System Architecture
Collection - Queue (FIFO)

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....
Data System Architecture
LIFO (last-in, first-out)

LIFO means last-in, first-out and is the queue operation where the last element added is the first element removed. The element removed is the youngest element in the queue whereas in a FIFO it's the oldest...
Data System Architecture
Queue - deque (Double Ended Queue)

A deque is a Double Ended QUEue meaning that the queue can insert, retrieve and remove at both ends. A deque implements then: FIFO (first-in, first-out) or LIFO (last-in, first-out). The below...
Robots Useragent
Robot - Rate Limiting

A page rate limiting of HTTP request that is implemented to control bot. A rate limiter caps how many requests a sender (user / IP address ) can issue in a specific window of time (e.g. 25 requests per...

Share this page:
Follow us:
Task Runner