Data

/ˈdeɪtə ˌmænɪpjʊˈleɪʃən/

noun — "modifying, analyzing, or controlling data."

Data Manipulation is the process of systematically accessing, transforming, organizing, or modifying data to achieve a desired outcome, extract information, or prepare it for storage, transmission, or analysis. It is a fundamental concept in computing, databases, programming, and digital systems, enabling the structured handling of both raw and processed information.

/ˈmɛtəˌdeɪtə/

noun — "data that describes other data."

Metadata is structured information that provides context, description, or additional attributes about other data. It does not typically contain the primary content itself but conveys essential properties, relationships, and management details that facilitate understanding, organization, retrieval, and processing of the main data. In computing, metadata is widely used in databases, filesystems, web services, multimedia, and distributed systems to enhance data management and interoperability.

/ˈdeɪtəˌbeɪs/

noun — "organized repository for structured data."

Database is a structured collection of data organized for efficient storage, retrieval, and management. It allows multiple users or applications to access, manipulate, and analyze data consistently and reliably. Databases are foundational in computing, enabling everything from enterprise resource management and financial systems to search engines and web applications. They ensure data integrity, concurrency control, and durability, supporting operational and analytical workloads simultaneously.

/ˈɪn.deks/

noun — "data structure for fast lookup."

Index is a specialized data structure used in computing and database systems to improve the speed and efficiency of data retrieval operations. It functions as a roadmap or table of contents, allowing a system to quickly locate the position of a desired item without scanning the entire dataset. Indexes are essential in relational and non-relational databases, search engines, file systems, and large-scale storage systems, where rapid access to specific records is critical.

/kwɪəri/

noun — "request for data or information."

Query is a formal request to a computing system, database, or service for specific information or data retrieval. In database systems, a query is a statement or expression used to specify criteria for selecting, filtering, updating, or manipulating data stored within tables, documents, or other structured formats. The term is used broadly in programming, networking, and information retrieval, encompassing operations from simple lookups to complex analytics and joins across multiple datasets.

/kjuː/

noun — "ordered collection for sequential processing."

Queue is an abstract data structure that stores a sequence of elements in a specific order for processing. The most common ordering principle is FIFO (First In, First Out), though variations like priority queues may alter the processing sequence. A queue ensures that elements are handled systematically, supporting predictable workflows and task management in computing systems.

/ˈfiː.foʊ/

noun — "first item in, first item out."

FIFO, short for First In, First Out, is a data handling or storage method in which the earliest added item is the first to be removed. This ordering principle is widely used in queues, memory buffers, and inventory accounting, ensuring that items are processed in the same order they were received.

/ˈlaɪ.foʊ/

noun — "last item in, first item out."

LIFO, short for Last In, First Out, is a data handling or storage method in which the most recently added item is the first to be removed. This ordering principle is used in stacks, memory management, and certain inventory accounting practices, ensuring that the latest entries are processed before earlier ones.

/ˈvɛktər/

noun … “Resizable sequential container.”

/daɪˈnæmɪk əˈreɪ/

noun … “Resizable contiguous memory collection.”

Dynamic Array is a data structure similar to an array but with the ability to grow or shrink at runtime. Unlike fixed-size arrays, dynamic arrays allocate memory on the heap and can expand when more elements are added, typically by allocating a larger block and copying existing elements. They balance the efficiency of indexed access with flexible memory usage.

Key characteristics of Dynamic Array include: