GB1534290A - Computer system with data base instructions - Google Patents

Computer system with data base instructions

Info

Publication number
GB1534290A
GB1534290A GB52581/75A GB5258175A GB1534290A GB 1534290 A GB1534290 A GB 1534290A GB 52581/75 A GB52581/75 A GB 52581/75A GB 5258175 A GB5258175 A GB 5258175A GB 1534290 A GB1534290 A GB 1534290A
Authority
GB
United Kingdom
Prior art keywords
page
segment
record
records
base
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
GB52581/75A
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bull HN Information Systems Italia SpA
Bull HN Information Systems Inc
Original Assignee
Honeywell Information Systems Italia SpA
Honeywell Information Systems Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=24133984&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=GB1534290(A) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Honeywell Information Systems Italia SpA, Honeywell Information Systems Inc filed Critical Honeywell Information Systems Italia SpA
Publication of GB1534290A publication Critical patent/GB1534290A/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Executing Machine-Instructions (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Memory System Of A Hierarchy Structure (AREA)

Abstract

1534290 Data processing HONEYWELL INFORMATION SYSTEMS Inc 23 Dec 1975 [23 Dec 1974] 52581/75 Heading G4A Data is recorded in the form of sets of records each set having an owner record and at least one member record, each record forming one line of a page, Fig. 16a, and including a pointer sequence providing pointers to one or more records of the set. Each page includes a table 1602 correlating line numbers of records and their offsets within the page. The pointer sequence of a member record may include pointers to the next record, the previous record and the owner record of the set (Fig. 15c, not shown) whereas the pointer sequence of an owner record may include pointers to the first and last member records of the set (Fig. 15d, not shown). Each page is addressed by a page descriptor (Fig. 16b, not shown) providing the respective area (file) and page numbers and pointers to the previous and following descriptors in a chain of the page descriptors relating to the pages in main memory. When a page is requested a control pointer (Fig. 16c, not shown) is an extension to a system base 1215, Fig. 12, provides a G-number which is the number of a segment pointed to by an entry in a G-table 1212 and a displacement within that segment at which is the beginning of the chain of page descriptors. The chain of page descriptors is then searched to determine whether the requested page is in the main memory or the backing store; an address in the form of segment and address within the segment is then generated. Each page, Fig. 16a, includes a page header 1601 describing the length of the page and the number of records in the page and, for each record, an offset 1603 and a two-bit field 0 which indicates whether the record is inactive, logically deleted (it contains no information but occupies memory space), physically deleted or active. Records may be virtual memory records, used for internal operating procedures, and including pointers to addresses in the form of segments and address within the segment, or data base records, generally used by user programs, and including pointers to addresses in the form of area, page, line. Set and record descriptors (Figs. 18a, 18b, not shown) describe the properties of a given set and record respectively. The system base 1215, Fig. 12, accessed by a base address register 1202, provides the base addresses of G-table 1212 and a J-table 1204 and the job step (J) number of the currently operating process which accesses a J-table entry 1217 which provides the base address of a P- table 1205. The process group (P) number of the currently operating process from system base 1215 accesses, 1217, from the P-table the address of the process control block 1206 of the currently operating process which acts as a temporary storage area for information necessary to start or restart that process. One of two address space words ASW0 or ASW1 in the process control block 1206 is selected by part of the contents of a base register 1201 and points to a segment table word array 1207 or 1208 which together with base register 1201, selects a segment table 1209 or 1210; a segment descriptor is then derived from the segment table as addressed by part of the contents of base register 1201 and accesses a user segment 1211. The system base 1215 also provides an internal processor queue word which points to the head of a queue of processes waiting for resources, 1213, in the GO segment pointed to by the zero G-number in G-table 1212; such processes are queued on semaphores, queues of resources waiting for processes and free semaphores also being provided in the GO segment (Fig. 9, not shown).
GB52581/75A 1974-12-23 1975-12-23 Computer system with data base instructions Expired GB1534290A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US53539274A 1974-12-23 1974-12-23

Publications (1)

Publication Number Publication Date
GB1534290A true GB1534290A (en) 1978-11-29

Family

ID=24133984

Family Applications (1)

Application Number Title Priority Date Filing Date
GB52581/75A Expired GB1534290A (en) 1974-12-23 1975-12-23 Computer system with data base instructions

Country Status (5)

Country Link
JP (1) JPS6113260B2 (en)
CA (1) CA1216074A (en)
DE (1) DE2556953A1 (en)
FR (1) FR2296222A1 (en)
GB (1) GB1534290A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2218833A (en) * 1988-05-16 1989-11-22 Ardent Computer Corp File system

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6311207Y2 (en) * 1980-10-27 1988-04-01

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2218833A (en) * 1988-05-16 1989-11-22 Ardent Computer Corp File system

Also Published As

Publication number Publication date
CA1216074A (en) 1986-12-30
JPS5186940A (en) 1976-07-30
DE2556953A1 (en) 1976-07-01
JPS6113260B2 (en) 1986-04-12
FR2296222A1 (en) 1976-07-23
FR2296222B1 (en) 1982-02-19

Similar Documents

Publication Publication Date Title
US6286092B1 (en) Paged based memory address translation table update method and apparatus
US5269019A (en) Non-volatile memory storage and bilevel index structure for fast retrieval of modified records of a disk track
US3705388A (en) Memory control system which enables access requests during block transfer
EP0208428A2 (en) Direct input/output in a virtual memory system
GB1342459A (en) Data processing systems
GB1282628A (en) Computer memory protection
GB1494505A (en) Data processing system
ES432147A1 (en) Buffered virtual storage and data processing system
DK408980A (en) MULTIPROGRAMMED DATA PROCESSING SYSTEM
GB1536043A (en) Computer with set relationship tests
GB1188435A (en) Improvements in and relating to Digital Computers
GB1505580A (en) Data processing apparatus
US4937780A (en) Single instruction updating of processing time field using software invisible working registers
US5479629A (en) Method and apparatus for translation request buffer and requestor table for minimizing the number of accesses to the same address
US5107417A (en) Address translating method for translating virtual address to real address with specified address register to allow bypass of translation steps
GB1534290A (en) Computer system with data base instructions
GB1498116A (en) Data processing systems
US6144995A (en) Data transfer method for logical computers
JP3180336B2 (en) Data access method using multilayer buffer
GB1532251A (en) Multi-programmed data processor
JPS634356A (en) Sharing processing system for disk cache sequential mode
GB1348171A (en) Status marking of variables
GB1528062A (en) Data processing systems
JPH04350741A (en) Access speed increasing method for indexed sequential file
GB1491692A (en) Allocation of storage and generation of routines in data processing system

Legal Events

Date Code Title Description
PS Patent sealed
PCNP Patent ceased through non-payment of renewal fee

Effective date: 19931223