GB/T 5271.6-2000 Information technology vocabulary Part 6: Data preparation and processing
Some standard content:
GB/T5271.6—2000
This standard is equivalent to the international standard ISO/IEC2382-6:1987 "Information Technology Vocabulary Part 6: Data Preparation and Processing". Except for the introduction of the original international standard, this standard is basically consistent with the original international standard in other contents and forms. This standard replaces the national standard GB/T5271.6—1985 from the date of implementation. The purpose of formulating information technology vocabulary standards is to facilitate international exchanges in information processing. It provides the terms and definitions of concepts related to the field of information processing, and clarifies the relationship between each terminology. This standard defines concepts such as data input and output, transmission and conversion methods, and data search technology. The GB/T5271 terminology series national standards consists of more than 30 parts, all under the general title "Information Technology Vocabulary". This standard is the 6th part of the GB/T5271 terminology series national standards. This standard is proposed by the Ministry of Information Industry of the People's Republic of China. This standard is under the jurisdiction of the China Electronics Technology Standardization Institute. The drafting unit of this standard: China Electronics Technology Standardization Institute. The main drafters of this standard are Chen Ying, Huang Jiaying and Zhang Hongxian. This standard was first published on March 11, 1985. 202
GB/T5271.6-2000
ISO/IEC Foreword
ISO (International Organization for Standardization) and IEC (International Electrotechnical Commission) are specialized organizations for standardization worldwide. National member bodies (which are members of ISO or IEC) participate in the formulation of international standards for specific technical scopes through various technical committees established by international organizations. The technical committees of ISO and IEC cooperate in areas of common interest. Other official and non-official international organizations in contact with ISO and IEC can also participate in the formulation of international standards. For information technology, ISO and IEC have established a joint technical committee, namely ISO/IECJTC1. The draft international standards proposed by the joint technical committee need to be circulated to national member bodies for voting. To publish an international standard, at least 75% of the national member bodies participating in the voting need to vote in favor.
International Standard ISO/IEC2382-6 was developed by SC1 Vocabulary, Joint Technical Committee ISO/IECJTC1 Information Technology.
IS0/IEC2382 consists of more than 30 parts, all under the general title\Information technology vocabulary".203
1 Overview
1.1 Scope
National Standard of the People's Republic of China
Information technology—Vocabulary- Part 6: Preparation and handling of dataGB/T 5271. 6--2000
eqvISO/IEC2382-6:1987
Replaces GB/T5271.6-1985
This part of the standard is formulated to facilitate international communication in information processing. This standard gives the terms and definitions of concepts related to the field of information processing and clarifies the relationship between these items. In order to facilitate the translation of this standard into other languages, the definitions given avoid language specificity as much as possible. This standard defines concepts such as data input and output, data transmission and conversion, and data search technology. 1.2 Referenced standards
The provisions contained in the following standards constitute the provisions of this standard through reference in this standard. When this standard is published, the versions shown are valid. All standards will be revised, and the parties using this standard should explore the possibility of using the latest versions of the following standards. GB/T4880--1991 Language name code (eqvISO639:1988) GB/T 15237--1994 Basic vocabulary of terminology (eqvISO 1087:1990) 1.3 Principles and rules to be followed
1.3.1 Definition of entries
Chapter 2 includes many entries. Each entry consists of several required elements, including an index number, a term or several synonyms and a phrase that defines a concept. In addition, an entry may include examples, annotations or explanations to facilitate understanding of the concept. Sometimes the same term may be defined by different entries, or an entry may include two or more concepts, as explained in 1.3.5 and 1.3.8 respectively. This standard uses other terms, such as vocabulary, concepts, terms and definitions, whose meanings are defined in GB/T 15237. 1.3.2 Composition of entries
Each entry includes the required elements specified in 1.3.1, and if necessary If necessary, some elements may be added. The entries include the following elements in the following order:
a) index number (common to all languages of this standard); b) term or preferred term in a language. If there is no preferred term for a concept in a language, it is indicated by a five-point symbol (.···); in a term, a row of dots is used to indicate the selected word in each specific case; c) the preferred term of a family (indicated according to the rules of GB/T 2659); d) abbreviation of the term; permitted synonymous terms; e) the text of the definition (see 1.3.4);
f) one or more examples beginning with "examples"; g) one or more notes beginning with "notes" indicating the application field of the concept and special cases; h) pictures, diagrams or tables common to the entries. 1.3.3 Classification of terms
Approved by the State Administration of Quality and Technical Supervision on July 14, 2000, and implemented on March 1, 2001
GB/T5271.6—2000
Each part of this series of standards is assigned a two-digit serial number, starting with 01, which indicates "basic terms". Terms are classified into groups, and each group is assigned a four-digit serial number; the first two digits indicate the part of the series of standards in which the group is located.
Each term is assigned a six-digit index number; the first four digits indicate the standard part and group in which the term is located. In order to make the versions of this series of standards in different languages related, the serial numbers assigned to the standard parts, groups and terms should be the same. 1.3.4 Choice of terms and definitions
Terms and definitions should be selected in accordance with the prescribed usage as much as possible. When conflicts arise, the majority consensus method is adopted. 1.3.5 Polysemy
If a given term has several meanings in a working language, each meaning is given a separate entry to facilitate translation into other languages.
1.3.6 Abbreviations
As indicated in 1.3.2, currently used abbreviations are assigned to some terms. These abbreviations are not used in the text of definitions, examples or notes.
1.3.7 Use of parentheses
In some terms, a word or words printed in bold are placed in parentheses. These words are part of the complete term. When the use of abbreviated terms in technical articles does not affect the meaning of the context, these words can be abbreviated. In the main text of definitions, examples or notes of GB/T5271, these terms are used in full form. In some entries, the term is followed by text in normal font placed in parentheses. These words are not part of the term, but indicate relevant information about the use of the term, such as its special scope of application or its grammatical form. 1.3.8 Use of square brackets
If the definitions of several closely related terms differ by only a few words, these terms and their definitions are grouped together in one entry. Alternative words to indicate different meanings are placed in square brackets in the same order as in the term and in the definition. To avoid ambiguity of the replaced word, the last word placed before the brackets according to the above rules may be placed inside the square brackets and repeated for each change. 1.3.9 Use of boldface terms and use of asterisks in definitions When a term is printed in boldface in a definition, example or note, it means that the term has been defined in another entry of this vocabulary. However, when a term appears for the first time in each entry, the term appears in boldface. Boldface is also used for other grammatical forms of a term, such as plural nouns and participle forms of verbs. The basic forms of all terms that appear in boldface in GB/T 5271 are listed in the index at the end of this part (see 1.3.11). When two boldface terms are cited immediately after each other in different entries, separate them with an asterisk (or simply with punctuation).
Words or terms appearing in plain font are considered to be defined in a current dictionary or authoritative technical vocabulary. 1.3.10 Spelling
In the English version of this series of standards, the spelling of terms, definitions, examples and notes generally follows the American English spelling. Other correct spellings may be used without conflicting with this series of standards. 1.3.11 Compilation of index tables
For each language used, an alphabetical index is provided at the end of each part. The index includes all the terms defined in that part. Multi-word terms appear in alphabetical order after each keyword. 2 Terms and definitions
06 Preparation and processing of data
06.01 General terms
06. 01. 01 to read
GB/T 5271. 6--2000
To obtain data from a memory, data medium or other (data) source. 06. 01. 02
to write
To record data permanently or temporarily on a memory or data medium. Note: The phrases "read" and "read out" are usually distinguished from the phrases "write" and "write out" only from a descriptive point of view. For example, transferring a block of data from internal storage* to external storage may be referred to as "writing to external storage", "reading from internal storage", or "reading from internal storage and writing to external storage". 06.01.03 to copy
Read data from a source data medium*, leaving the source data unchanged, and then write the same data to a destination data medium, which may be different from the source data medium.
Example: copying a file on a tape to a disk. 06.01.04 to duplicate
Copy data from a source data medium* to a destination data medium, where the two media have the same physical form. Example: copying a file from one tape to another tape. 06.02 Input and Output
06.02.01 Input (data) data that is being received or to be received by any component of a computer. 2 Input (process) input (process) 06. 02. 02
The process by which any part of a computer receives data. 06.02.03 Input (of) input
Used to modify the device, process, or channel involved in the input process, or to modify the data or status involved in the input process. Note: When the meaning is clear in the given context, the word "input" can be used instead of "input data", "input signal", "input process", etc. 06.02.04 Output (data) output (data) Data being or to be produced by any part of a computer. 06.02.05 Output (process) output (process) The process by which any part of a computer produces data. 06.02.06 Output (of) output
Used to modify the device, process, or channel involved in the output process, or to modify the data or status involved in the output process. Note: When the meaning is clear in the given context, the word "output" can be used instead of "output data", "output signal", "output process", etc. input-output
06. 02.071
1/O (abbreviation) I/O (abbreviation) is used to modify the devices, processes, and channels involved in the input process and the output process (concurrent or non-concurrent), or to modify the data and status related to them.
Note: When the meaning is clear in the given context, the phrase "input-output" can be used instead of "input-output data", "input-output signals", "input-output process", etc.
06.02.08 data collection the process of collecting data from one or more points for use in a computer. Example: A data network collects transactions generated in branch offices for use in a computer center. 06.02.09 data entry
the process of placing data on a machine-readable medium. Example: Entering data from a terminal into a payroll file on a floppy disk. 06.02.10 Data acquisition The process of collecting and entering data
06.03 Transfer and transformation
06.03.01 Transfer
to transfer; to move
GB/T 5271.6—2000Www.bzxZ.net
The process of transferring data from one storage location to another. 06.03.02 Block transfer The process of transferring one or more blocks of data in one operation. Note: A block transfer may or may not erase the data in the original location. 06.03.03 Load to load
The process of transferring data* to a memory or a register in which it is being worked on. 06.03.04 Transform to transform
The process of changing the form of data according to prescribed rules, but without substantially changing the meaning of the data. 06. 03. 05
5 translateto translate
To change part of a program expressed in one programming language into another programming language or other representation suitable for execution.
06. 03. 06 convertto convert
To change the representation of data from one form to another, without changing the information conveyed by the data. Examples: code conversion; radix conversion; analog-to-digital conversion; media conversion. literalto transliterate
06. 03.07
To convert* data character by character. 06. 03. 08 encodeto encode;to codeTo convert* data using a code so that it is possible to convert back to the original form. 06. 03. 09 decodeto decode
To convert the encoded form of data back to the original form of the data. 06. 03. 10 to transcribe06.03.11
To copy data from one data medium* to another, converting the data, if necessary, so that it can be received by the receiving medium, to pack
To convert data into a form that is compressed for storage on the storage medium, taking advantage of certain known properties of the data and the storage medium, but which can still be restored to its original form.
Example: This makes use of bit or byte positions that might not otherwise be used. 06.03.12 to packing
The operation performed when packing* data.
06.03. 13 to unpack
To restore packed* data to its original form.
To compress :to compactTo reduce the space occupied on a data medium by encoding or removing repeated characters. to expand
To restore compressed* data to its original form.
06.04 Search
06.04.01 Searchsearch
06.04. 02
Examine one or more data elements of a set to find elements with given characteristics. 2 Search cyclesearch ycle
Sequence of search events to be repeated for each data element. 3 Search keywordsearchkey
Keyword used for data retrieval.
06.04.04 Dichotomizing searchdichotomizing searchA search that divides an ordered set of data elements into two mutually exclusive parts, discards one part, and repeats this process for the accepted part until the search is completed. 06.04.05 binary search A binary search in which each set of data elements is processed by an equal number of data elements; if the number of data elements in the initial set is odd, a set is allowed to include an additional element. Fibonacci search06. 04. 06
A binary search in which the number of data elements in the set is equal to a Fibonacci number, or assumed to be equal to the next larger Fibonacci number, and in which the set of elements involved is partitioned into the Fibonacci sequence at each step of the search. Note
1 A sequence of numbers such as 0,1,1,2,3,5,8 is a Fibonacci sequence when each term is the sum of the previous two terms (except the first and second terms). 2 Fibonacci search is superior to binary search in that it only slightly reduces the average movement of data media that are accessed sequentially, such as magnetic tape. Scanning
06. 04. 07
Systematic inspection of data.
06.04. 08
linear search;sequential searcha search in which a data set is scanned in a sequential manner. chained list search;linked list searcha search using linked lists.
06.04.10 tree searcha search in a tree structure that determines at each step which parts of the tree can be discarded without further searching.
06.04.11 hash table searcha search in which the storage locations of the required data elements are derived from a hash table, with appropriate procedures being followed when address conflicts arise.
06.05 sorting, sorting, and arranging
06. 05. 01 to order
the arrangement of data items according to a specified rule. 06.05.02 order
a particular arrangement resulting from sorting. NOTE: In contrast to order, order need not be linear, e.g. a hierarchical ordering of items. to sequence
To arrange items in the order of natural numbers. NOTE: Methods and procedures may be specified for mapping a natural linear order to natural numbers, and thus, by extension, for example, alphabetical or chronological order.
sequencesequence
A series of items in order.
indexindex
A list of the contents of a file or document with keywords or reference information for finding those contents. 06. 05. 06 to sort
To divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7 to merge
To combine two or more data sets that have the same given order into a single set. to collate
To combine two or more data sets into a single set according to a predetermined order. 06. 05. 09 collating sequence208
The specific arrangement produced by collating.
06.06 Data preparation
06.06.01 to edit
To prepare data for later operation.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero elimination).
to extract
To select and remove items that meet certain specific criteria from a group of items. 06.06.03
Mask
A pattern of characters, which is used to control which parts of another character pattern are to be retained or deleted. 06.06.04
clearto clear
To cause one or more storage locations to a predetermined state, which usually corresponds to zero or to a spacing character. 06.06.05
zerofillto zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
justifyto justify
To shift the contents of a register so that the character at the specified end of the data is at a particular position in the register. 06. 06. 07 to left-justifyright-justify]To justify to the left [right].
06. 06. 08 zero suppression
zero suppression
To eliminate invalid zeros from a number.
Bisection search
Binary search
Fisherman search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read
GB/T5271.6—2000
Business Business Business
Industry Industry Industry National Quantity Industry
06. 04. 02
.…06.05.04
: 06.06.04
06. 03.11
to sequence
to sort
to transcribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0808
linear search;sequential searcha search in which a data set is scanned in a sequential manner. chained list search;linked list searcha search using linked lists.
06.04.10 tree searcha search in a tree structure that decides at each step which parts of the tree can be discarded without further searching.
06.04.11 hash table searcha search in which the storage locations of the required data elements are derived from a hash table, with appropriate procedures being followed when address conflicts arise.
06.05 sorting, sorting and arranging
06. 05. 01 to order
the arrangement of data items according to a specified rule. 06.05.02 sequence
a particular arrangement produced by sorting. NOTE: Order need not be linear in contrast to sequence, for example, a hierarchical ordering of items. to sequence
To arrange items in the order of natural numbers. Note: Methods and procedures may be specified for mapping natural linear orders to natural numbers, and thus, by extension, alphabetical or chronological order.
sequencesequence
A series of items that have been sorted.
indexindex
A list of the contents of a file or document with keywords or reference information for finding those contents. 06. 05. 06 to sort
To divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7 to merge
To combine two or more data sets that have the same given order into a single set. to collate
To combine two or more data sets into a single set according to a predetermined order. 06. 05. 09 to collatesequence208
A specific arrangement produced by collating.
06.06 Data preparation
06.06.01 Edit to edit
Prepare data for subsequent operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero suppression).
Extract to extract
Select and remove items that meet certain specific criteria from a group of items. 06.06.03
Mask
A pattern of characters that is used to control which parts of another character pattern are to be retained or deleted. 06.06.04
Clear to clear
Make one or more storage locations a predetermined state, which usually corresponds to zero or to a space character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
to justify
To shift the contents of a register so that the characters at the end of the data are at a specific location in the register. 06. 06. 07 to left-justify
06. 06. 08 zero suppression
zero suppression
To eliminate invalid zeros from a number.
Bisection search
Binary search
Fisherman search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search | | tt | )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0808
linear search;sequential searcha search in which a data set is scanned in a sequential manner. chained list search;linked list searcha search using linked lists.
06.04.10 tree searcha search in a tree structure that decides at each step which parts of the tree can be discarded without further searching.
06.04.11 hash table searcha search in which the storage locations of the required data elements are derived from a hash table, with appropriate procedures being followed when address conflicts arise.
06.05 sorting, sorting and arranging
06. 05. 01 to order
the arrangement of data items according to a specified rule. 06.05.02 sequence
a particular arrangement produced by sorting. NOTE: Order need not be linear in contrast to sequence, for example, a hierarchical ordering of items. to sequence
To arrange items in the order of natural numbers. Note: Methods and procedures may be specified for mapping natural linear orders to natural numbers, and thus, by extension, alphabetical or chronological order.
sequencesequence
A series of items that have been sorted.
indexindex
A list of the contents of a file or document with keywords or reference information for finding those contents. 06. 05. 06 to sort
To divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7 to merge
To combine two or more data sets that have the same given order into a single set. to collate
To combine two or more data sets into a single set according to a predetermined order. 06. 05. 09 to collatesequence208
A specific arrangement produced by collating.
06.06 Data preparation
06.06.01 Edit to edit
Prepare data for subsequent operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero suppression).
Extract to extract
Select and remove items that meet certain specific criteria from a group of items. 06.06.03
Mask
A pattern of characters that is used to control which parts of another character pattern are to be retained or deleted. 06.06.04
Clear to clear
Make one or more storage locations a predetermined state, which usually corresponds to zero or to a space character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
to justify
To shift the contents of a register so that the characters at the end of the data are at a specific location in the register. 06. 06. 07 to left-justify
06. 06. 08 zero suppression
zero suppression
To eliminate invalid zeros from a number.
Bisection search
Binary search
Fisherman search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search | | tt | )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0808080808080810 tree search a search performed in a tree structure which determines at each step which parts of the tree can be discarded without further searching.
06.04.11 hash table search a search in which the storage locations of the required data elements are derived from a hash table, with appropriate procedures being followed when address conflicts arise.
06.05 sorting, sorting and arranging
06. 05. 01 to order
the arrangement of data items according to a specified rule. 06.05.02 sequence
a particular arrangement produced by a sort. NOTE: In contrast to order, order need not be linear, for example, a hierarchical ordering of items. to sequence
the arrangement of items in the order of natural numbers. NOTE: Methods and procedures may be specified for mapping a natural linear order to natural numbers, and thus, by extension, alphabetical or chronological order.
sequencesequence
a series of items in an ordered sequence.
indexindex
a list of the contents of a file or document with keywords or references for finding those contents. 06. 05. 06to sort
to divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7to merge
to combine two or more data sets that have the same given order into a single set.to collate
to combine two or more data sets into a single set according to a predetermined order. 06. 05. 09to collating sequence208
a specific arrangement produced by collating.
06.06data preparation
06.06.01to edit
to prepare data for later operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero elimination).
to extract
To select and remove items that meet certain specific criteria from a group of items. 06.06.03
Mask; mask
A pattern of characters, which is used to control which parts of another character pattern are to be retained or deleted. 06.06.04
to clear
To make one or several storage locations a predetermined state, which usually corresponds to zero or to a spacing character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zero. 06.06.06
justifyto justify
Shift the contents of a register so that the character at the specified end of the data is located at a specific position in the register. 06. 06. 07 to left-justifyLright-justify]justify to the left [right].
06. 06. 08 zero suppression
zero suppression
Eliminate invalid zeros in a number.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0810 tree search a search performed in a tree structure which determines at each step which parts of the tree can be discarded without further searching.
06.04.11 hash table search a search in which the storage locations of the required data elements are derived from a hash table, with appropriate procedures being followed when address conflicts arise.
06.05 sorting, sorting and arranging
06. 05. 01 to order
the arrangement of data items according to a specified rule. 06.05.02 sequence
a particular arrangement produced by a sort. NOTE: In contrast to order, order need not be linear, for example, a hierarchical ordering of items. to sequence
the arrangement of items in the order of natural numbers. NOTE: Methods and procedures may be specified for mapping a natural linear order to natural numbers, and thus, by extension, alphabetical or chronological order.
sequencesequence
a series of items in an ordered sequence.
indexindex
a list of the contents of a file or document with keywords or references for finding those contents. 06. 05. 06to sort
to divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7to merge
to combine two or more data sets that have the same given order into a single set.to collate
to combine two or more data sets into a single set according to a predetermined order. 06. 05. 09to collating sequence208
a specific arrangement produced by collating.
06.06data preparation
06.06.01to edit
to prepare data for later operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero elimination).
to extract
To select and remove items that meet certain specific criteria from a group of items. 06.06.03
Mask; mask
A pattern of characters, which is used to control which parts of another character pattern are to be retained or deleted. 06.06.04
to clear
To make one or several storage locations a predetermined state, which usually corresponds to zero or to a spacing character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zero. 06.06.06
justifyto justify
Shift the contents of a register so that the character at the specified end of the data is located at a specific position in the register. 06. 06. 07 to left-justifyLright-justify]justify to the left [right].
06. 06. 08 zero suppression
zero suppression
Eliminate invalid zeros in a number.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0805 Sorting, sorting and arranging
06. 05. 01 to order
To arrange items of data according to a specified rule. 06.05.02 sequence
A specific arrangement produced by sorting. NOTE: In contrast to order, order need not be linear, e.g., a hierarchical ordering of items. to sequence
To arrange items in the order of natural numbers. NOTE: Methods and procedures may be specified for mapping natural linear order to natural numbers, and thus, by extension, alphabetical or chronological order.
sequence
A series of items that have been sorted.
index
A list of the contents of a file or document with keywords or reference information for finding those contents. 06. 05. 06 to sort
To divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7 to merge
To merge two or more data sets with the same given order into one set. to collate
To merge two or more data sets into one set according to a predetermined order. 06. 05. 09 collating sequence208
A specific arrangement produced by collation.
06.06 Data preparation
06.06.01 to edit
To prepare data for subsequent operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, addition or modification of data, deletion of unnecessary data, format control, code* conversion, and application of standard procedures (such as zero elimination).
to extract
To select and remove items from a group of items that meet certain specific criteria. 06.06.03
mask
A pattern of characters used to control which parts of another character pattern are retained or deleted. 06.06.04
to clear
To cause one or more storage locations to a predetermined state, which usually corresponds to zero or to a space character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
to justify
To shift the contents of a register so that the character at the specified end of the data is at a specific position in the register. 06. 06. 07 to left-justify to right-justify] To be aligned to the left [right].
06. 06. 08 Zero suppression
zero suppression
Eliminate invalid zeros in numbers.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0805 Sorting, sorting and arranging
06. 05. 01 to order
To arrange items of data according to a specified rule. 06.05.02 sequence
A specific arrangement produced by sorting. NOTE: In contrast to order, order need not be linear, e.g., a hierarchical ordering of items. to sequence
To arrange items in the order of natural numbers. NOTE: Methods and procedures may be specified for mapping natural linear order to natural numbers, and thus, by extension, alphabetical or chronological order.
sequence
A series of items that have been sorted.
index
A list of the contents of a file or document with keywords or reference information for finding those contents. 06. 05. 06 to sort
To divide items into groups according to specified criteria, without necessarily sorting the items within each group. 7 to merge
To merge two or more data sets with the same given order into one set. to collate
To merge two or more data sets into one set according to a predetermined order. 06. 05. 09 collating sequence208
A specific arrangement produced by collation.
06.06 Data preparation
06.06.01 to edit
To prepare data for subsequent operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, addition or modification of data, deletion of unnecessary data, format control, code* conversion, and application of standard procedures (such as zero elimination).
to extract
To select and remove items from a group of items that meet certain specific criteria. 06.06.03
mask
A pattern of characters used to control which parts of another character pattern are retained or deleted. 06.06.04
to clear
To cause one or more storage locations to a predetermined state, which usually corresponds to zero or to a space character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
to justify
To shift the contents of a register so that the character at the specified end of the data is at a specific position in the register. 06. 06. 07 to left-justify to right-justify] To be aligned to the left [right].
06. 06. 08 Zero suppression
zero suppression
Eliminate invalid zeros in numbers.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0806 to sort
To divide items into several groups according to specified criteria. The items in each group do not need to be sorted. 7 to merge
To combine two or more data sets with the same given order into one set. to collate
To combine two or more data sets into one set according to a predetermined order. 06. 05. 09 collating sequence208
The specific arrangement produced by collating.
06.06 Data preparation
06.06.01 to edit
To prepare data for subsequent operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero elimination).
to extract
To select and remove from a group of items those items which meet certain criteria. 06.06.03
mask
A pattern of characters which is used to control which parts of another character pattern are retained or deleted. 06.06.04
to clear
To make one or more storage locations become a predetermined state which usually corresponds to zero or to a space character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
to justify
To shift the contents of a register so that the character at the specified end of the data is at a specific position in the register. 06. 06. 07 to left-justify to right-justify] To be aligned to the left [right].
06. 06. 08 Zero suppression
zero suppression
Eliminate invalid zeros in numbers.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0806 to sort
To divide items into several groups according to specified criteria. The items in each group do not need to be sorted. 7 to merge
To combine two or more data sets with the same given order into one set. to collate
To combine two or more data sets into one set according to a predetermined order. 06. 05. 09 collating sequence208
The specific arrangement produced by collating.
06.06 Data preparation
06.06.01 to edit
To prepare data for subsequent operations.
GB/T 5271.6—2000
Note: Editing includes rearrangement, adding or modifying data, deleting unnecessary data, format control, code* conversion, and the application of standard procedures (such as zero elimination).
to extract
To select and remove from a group of items those items which meet certain criteria. 06.06.03
mask
A pattern of characters which is used to control which parts of another character pattern are retained or deleted. 06.06.04
to clear
To make one or more storage locations become a predetermined state which usually corresponds to zero or to a space character. 06.06.05
to zerofill
To fill unused storage locations with characters representing zeros. 06.06.06
to justify
To shift the contents of a register so that the character at the specified end of the data is at a specific position in the register. 06. 06. 07 to left-justify to right-justify] To be aligned to the left [right].
06. 06. 08 Zero suppression
zero suppression
Eliminate invalid zeros in numbers.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link list search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0806. 07 Left-justifyLright-justify] to left-justifyLright-justify] to adjust to the left [right].
06. 06. 08 Zero suppression
zero suppression
Eliminate invalid zeros in a number.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link table search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search | | tt | )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0806. 07 Left-justifyLright-justify] to left-justifyLright-justify] to adjust to the left [right].
06. 06. 08 Zero suppression
zero suppression
Eliminate invalid zeros in a number.
Bisection search
Binary search
Fischer's search
Compression·
Block transfer
Order sequence
GB/T 5271. 6--2000
Chinese index
Link table search
06. 03. 11.06. 03.12
Frequency sorting
Fibonacci search
Mask code
Hash table search
Output
Output (process)
Output (data)
Input (process)
Input (data)
Input output
Tree search
Data collection
Data acquisition
Data input
Sequential search
Search keyword
Search loop
Linear search
06. 04.10
06. 06.05
binary search
block transfer
chained list search | | tt | | collating sequence | search
GB/T 5271. 6---2000
Left justified[right justified]
English index
·06.02.08
output
output(data)
output(process )
packing
scanning
search
search cycle
search key | edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read | |tt | sequence
to sort
to transscribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0808
output
output(data)
output(process )
packing
scanning
search
search cycle
search key
seguence
sequential search
to clear
to code
to collate
to compact
to compress
欢中心迎
to convert
tocopy
to decode
to duplicate
to edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read
GB/T5271.6—2000
业营营营
业业业国量量业
06. 04. 02
.…06.05.04
：06.06.04
06. 03.11
to sequence
to sort
to transcribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 0808
output
output(data)
output(process )
packing
scanning
search
search cycle
search key
seguence
sequential search
to clear
to code
to collate
to compact
to compress
欢中心迎
to convert
tocopy
to decode
to duplicate
to edit
to encode
to expand
to extract
to justify
to left-justify[right-justify]to load
to merge
to move
to order
to pack
fo read
GB/T5271.6—2000
业营营营
业业业国量量业
06. 04. 02
.…06.05.04
：06.06.04
06. 03.11
to sequence
to sort
to transcribe
to transfer
to transform
to translate
to transliterate
to unpack
to write
to zerofill
tree search
zero suppression
GB/T 5271.6—2000
：06.03.01
··06.03.07
.06.06.05
06. 06. 08
Tip: This standard content only shows part of the intercepted content of the complete standard. If you need the complete standard, please go to the top to download the complete standard document for free.