|
ISAM
Indexed Sequential Access Method (ISAM) is a method for creating, maintaining, and manipulating computer files of data so that records can be retrieved sequentially or randomly by one or more keys. Indexes of key fields are maintained to achieve fast retrieval of required file records in indexed files. IBM originally developed ISAM for mainframe computers, but implementations are available for most computer systems. The term ''ISAM'' is used for several related concepts: *The IBM ISAM product and the algorithm it employs. *A database system where an application developer directly uses an application programming interface to search indexes in order to locate records in data files. In contrast, a relational database uses a query optimizer which automatically selects indexes. *An indexing algorithm that allows both sequential and keyed access to data. Most databases use some variation of the B-tree for this purpose, although the original IBM ISAM and VSAM implementations did not d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Virtual Storage Access Method
Virtual Storage Access Method (VSAM) is an IBM direct-access storage device (DASD) file storage access method, first used in the OS/VS1, OS/VS2 Release 1 (SVS) and Release 2 (MVS) operating systems, later used throughout the Multiple Virtual Storage (MVS) architecture and now in z/OS. Originally a record-oriented filesystem, VSAM comprises four data set ''organizations'': key-sequenced (KSDS), relative record (RRDS), entry-sequenced (ESDS) and linear (LDS). The KSDS, RRDS and ESDS organizations contain records, while the LDS organization (added later to VSAM) contains a sequence of pages with no intrinsic record structure, for use as a memory-mapped file. Overview An IBM ''Redbook'' named "VSAM PRIMER" (especially when used with the "Virtual Storage Access Method (VSAM) Options for Advanced Applications" manual) explains the concepts needed to make use of VSAM. IBM uses the term ''data set'' in official documentation as a synonym for ''file'', and ''direct-access storage dev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Indexed File
An indexed file is a computer file with an index that allows easy random access to any record given its file key. The key must be such that it uniquely identifies a record. If more than one index is present the other ones are called ''alternate indexes''. The indexes are created with the file and maintained by the system. IBM supports indexed files with the ''Indexed Sequential Access Method'' (ISAM) on OS/360 and successors. IBM virtual storage operating systems added VSAM, which supports indexed files as Key Sequenced Data Sets (KSDS), with more options. Support for indexed files is built into COBOL and PL/I. Other languages with more limited I/O facilities such as C support indexed files through add-on packages in a runtime library such as C-ISAM. Some of Digital's operating systems, such as OpenVMS, support indexed file I/O using the Record Management Services. In recent systems, relational databases are often used in place of indexed files. Language support The COBOL ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
B-tree
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems. History While working at Boeing Research Labs, Rudolf Bayer and Edward M. McCreight invented B-trees to efficiently manage index pages for large random-access files. The basic assumption was that indices would be so voluminous that only small chunks of the tree could fit in the main memory. Bayer and McCreight's paper ''Organization and maintenance of large ordered indices'' was first circulated in July 1970 and later published in '' Acta Informatica''. Bayer and McCreight never explained what, if anything, the ''B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Channel I/O
In computing, channel I/O is a high-performance input/output (I/O) architecture that is implemented in various forms on a number of computer architectures, especially on mainframe computers. In the past, channels were generally implemented with custom devices, variously named channel, I/O processor, I/O controller, I/O synchronizer, or '' DMA controller''. Overview Many I/O tasks can be complex and require logic to be applied to the data to convert formats and other similar duties. In these situations, the simplest solution is to ask the CPU to handle the logic, but because I/O devices are relatively slow, a CPU could waste time waiting for the data from the device. This situation is called 'I/O bound'. Channel architecture avoids this problem by processing some or all of the I/O task without the aid of the CPU by offloading the work to dedicated logic. Channels are logically self-contained, with sufficient logic and working storage to handle I/O tasks. Some are powerful or fle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Record Management Services
Record Management Services (RMS) are procedures in the VMS, RSTS/E, RT-11 and RSX-11M operating systems that programs may call to process files and records within files. Its file formats and procedures are similar to of those in some IBM access methods for several of its mainframe computer A mainframe computer, informally called a mainframe or big iron, is a computer used primarily by large organizations for critical applications like bulk data processing for tasks such as censuses, industry and consumer statistics, enterprise ... operating systems and by other vendors for file and record management. VMS RMS is an integral part of the system software; its procedures run in executive mode. (RMS was not initially integrated into RT-11 and RSTS/E, but was available as an added charge "layered product". It was later added to RSTS/E and was a part of its standard documentation set.) RMS supports four record access methods: * Sequential Access * Relative Record Number Acces ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Channel I/O
In computing, channel I/O is a high-performance input/output (I/O) architecture that is implemented in various forms on a number of computer architectures, especially on mainframe computers. In the past, channels were generally implemented with custom devices, variously named channel, I/O processor, I/O controller, I/O synchronizer, or '' DMA controller''. Overview Many I/O tasks can be complex and require logic to be applied to the data to convert formats and other similar duties. In these situations, the simplest solution is to ask the CPU to handle the logic, but because I/O devices are relatively slow, a CPU could waste time waiting for the data from the device. This situation is called 'I/O bound'. Channel architecture avoids this problem by processing some or all of the I/O task without the aid of the CPU by offloading the work to dedicated logic. Channels are logically self-contained, with sufficient logic and working storage to handle I/O tasks. Some are powerful or fle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Track (disk Drive)
A disk drive track is a circular path on the surface of a disk or diskette on which information is magnetically recorded and from which recorded information is read. A track is a physical division of data in a disk drive, as used in the Cylinder-Head-Record (CCHHR) addressing mode of a CKD disk. The concept is concentric, through the physical platters, being a data circle per each cylinder of the whole disk drive. In other words, the number of tracks on a single surface in the drive exactly equals the number of cylinders of the drive. Tracks are subdivided into blocks (or sectors, pages) (see: Storage block and Virtual page). The term track is sometimes prefaced with the word logical (i.e. "3390-9 has 3 logical tracks per physical track") to emphasize that it is used as an abstract concept, not a track in the physical sense. See also * Hard disk drive * Disk sector In computer disk storage, a sector is a subdivision of a track on a magnetic disk or optical disc. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Memory
Computer memory stores information, such as data and programs, for immediate use in the computer. The term ''memory'' is often synonymous with the terms ''RAM,'' ''main memory,'' or ''primary storage.'' Archaic synonyms for main memory include ''core'' (for magnetic core memory) and ''store''. Main memory operates at a high speed compared to mass storage which is slower but less expensive per bit and higher in capacity. Besides storing opened programs and data being actively processed, computer memory serves as a Page cache, mass storage cache and write buffer to improve both reading and writing performance. Operating systems borrow RAM capacity for caching so long as it is not needed by running software. If needed, contents of the computer memory can be transferred to storage; a common way of doing this is through a memory management technique called ''virtual memory''. Modern computer memory is implemented as semiconductor memory, where data is stored within memory cell (com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ACID
An acid is a molecule or ion capable of either donating a proton (i.e. Hydron, hydrogen cation, H+), known as a Brønsted–Lowry acid–base theory, Brønsted–Lowry acid, or forming a covalent bond with an electron pair, known as a Lewis acid. The first category of acids are the proton donors, or Brønsted–Lowry acid–base theory, Brønsted–Lowry acids. In the special case of aqueous solutions, proton donors form the hydronium ion H3O+ and are known as Acid–base reaction#Arrhenius theory, Arrhenius acids. Johannes Nicolaus Brønsted, Brønsted and Martin Lowry, Lowry generalized the Arrhenius theory to include non-aqueous solvents. A Brønsted–Lowry or Arrhenius acid usually contains a hydrogen atom bonded to a chemical structure that is still energetically favorable after loss of H+. Aqueous Arrhenius acids have characteristic properties that provide a practical description of an acid. Acids form aqueous solutions with a sour taste, can turn blue litmus red, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cylinder-head-sector
Cylinder-head-sector (CHS) is an early method for giving addresses to each physical block of data on a hard disk drive. It is a 3D-coordinate system made out of a vertical coordinate ''head'', a horizontal (or radial) coordinate ''cylinder'', and an angular coordinate ''sector''. Head selects a circular surface: a platter in the disk (and one of its two sides). Cylinder is a Cylinder, cylindrical intersection through the stack of platters in a disk, centered around the disk's spindle. Combined, cylinder and head intersect to a circular line, or more precisely: a circular strip of physical data blocks called ''track''. Sector finally selects which data block in this track is to be addressed, as the track is subdivided into several equally-sized portions, each of which is an arc of (360/n) degrees, where n is the number of sectors in the track. CHS addresses were exposed, instead of simple linear addresses (going from ''0'' to the ''total block count on disk - 1''), because early h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Files-11
Files-11 is the file system used in the RSX-11 and OpenVMS operating systems from Digital Equipment Corporation. It supports record-oriented I/O, remote network access, and file versioning. The original ODS-1 layer is a flat file system; the ODS-2 version is a hierarchical file system, with support for access control lists,. Files-11 is similar to, but significantly more advanced than, the file systems used in previous Digital Equipment Corporation operating systems such as TOPS-20 and RSTS/E. History The native OpenVMS file system is descended from older DEC operating systems and is similar in many ways, both having been designed by Dave Cutler. A major difference is the layout of directories. These file systems all provided some form of rudimentary non-hierarchical directory structure, typically based on assigning one directory per user account. Under RSTS/E, each user account was represented by two numbers, a 'project'',''programmer''/code> pair, and had one associ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
