-
1 Data structure
-
2 data record
"A data structure that is a collection of fields (elements), each with its own name and type. Unlike an array, whose elements all represent the same type of information and are accessed using an index, the elements of a record represent different types of information and are accessed by name. A record can be accessed as a collective unit of elements, or the elements can be accessed individually." -
3 data format
"The structure or appearance of a unit of data, such as a field, or text in a message body." -
4 data entity
An information structure that represents the data characteristic of an entity. -
5 data layout
The arrangement and structure of data in a chart. -
6 spinlock
A locking mechanism associated with a global data structure. This mechanism ensures that only one thread can get access to the data structure at any given time. -
7 accessor
"A data structure or group of structures created by the consumer that describes how row or parameter data from the data store is to be laid out in the consumer's data buffer, enabling providers to optimize access. An accessor is a collection of bindings." -
8 hash table
A data structure that carries out a mathematical calculation on a field identifier to determine where a data element in a large table or index is located. -
9 associative array
A data structure that carries out a mathematical calculation on a field identifier to determine where a data element in a large table or index is located. -
10 access token
"A data structure that contains authentication and authorization information for a user. Windows creates the access token when the user logs on and the user's identity is confirmed. The access token contains the user's security ID (SID), the list of groups that the user is a member of, the list of privileges held by that user. Each process or thread started for the user inherits a copy of the access token. In some cases a user may have more than one access token, with different levels of authority." -
11 bitmap
"A data structure in memory that represents information in the form of a collection of individual bits. A bit map is used to represent a bit image. Another use of a bit map in some systems is the representation of the blocks of storage on a disk, indicating whether each block is free (0) or in use (1)." -
12 nest
"To embed one construct inside another. For example, a database may contain a nested table (a table within a table), a program may contain a nested procedure (a procedure declared within a procedure), and a data structure may include a nested record (a record containing a field that is itself a record)." -
13 object type
"An opaque data structure that defines a protected entity that is implemented and manipulated by the operating system. For example, the system service that reads a file operates on an open file object." -
14 security descriptor
"A data structure that contains security information associated with a protected object. Security descriptors include information about who owns the object, who can access it and in what way, and what types of access are audited." -
15 tree
"A data structure containing zero or more nodes that are linked together in a hierarchy. If any nodes are present, one node is the root; each node except the root is the child of one and only one other node, and each node has zero or more nodes as children." -
16 descendant
"In a tree data structure, a node that is one or more steps farther from the root (one or more levels lower) than the ancestor node." -
17 authenticator
"A data structure used by one party to prove that another party knows a secret key. In the Kerberos authentication protocol, authenticators include timestamps, to prevent replay attacks, and are encrypted with the session key issued by the Key Distribution Center (KDC)."مصدّق -
18 deep copy
"A copy of the contents of a data structure, including all its substructures." -
19 shallow copy
A copy of the contents of a data structure that does not include all its substructures. -
20 global trade identification number
"A 14-digit data structure used to uniquely identify trade items, products, and services at a unit level."English-Arabic terms dictionary > global trade identification number
См. также в других словарях:
Data structure — In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly … Wikipedia
data structure — Way in which data are stored for efficient search and retrieval. The simplest data structure is the one dimensional (linear) array, in which stored elements are numbered with consecutive integers and contents are accessed by these numbers. Data… … Universalium
data structure — noun (computer science) the organization of data (and its storage allocations in a computer) • Topics: ↑computer, ↑computing machine, ↑computing device, ↑data processor, ↑electronic computer, ↑information processing system … Useful english dictionary
data structure — duomenų struktūra statusas T sritis informatika apibrėžtis Sudėtinis ↑duomenų tipas, sudarytas iš kitų duomenų reikšmių, sujungtų kuriuo nors būdu į visumą. Duomenų struktūra apibrėžia struktūrines reikšmes ir jų sujungimo būdą. Pagrindinės… … Enciklopedinis kompiuterijos žodynas
Data structure alignment — is the way data is arranged and accessed in computer memory. It consists of two separate but related issues: data alignment and data structure padding. When a modern computer reads from or writes to a memory address, it will do this in word sized … Wikipedia
Data structure diagram — Example of a Data Structure Diagram. A Data Structure Diagram (DSD) is a data model used to describe conceptual data models by providing graphical notations which document entities and their relationships, and the constraints that binds them. The … Wikipedia
Data structure augmentation — In computer science augmenting a data structure means modifying it in some way to create a new one by storing new information in it. Augmenting data structures is quite common in software developing. This is mainly due to specific requirements of … Wikipedia
data structure — noun Date: 1963 any of various methods or formats (as an array, file, or record) for organizing data in a computer … New Collegiate Dictionary
data structure — noun An organization in software of data that allows more optimal searching, categorizing, or storage of information. Examples: matrix, stack, queue, dequeue, list … Wiktionary
Persistent data structure — In computing, a persistent data structure is a data structure which always preserves the previous version of itself when it is modified; such data structures are effectively immutable, as their operations do not (visibly) update the structure in… … Wikipedia
Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia