Showing papers on "Data access published in 1988"

Data base management system for real-time applications

Abstract: A real-time database provides the predictable, high speed data access required for on-line applications, while providing flexible searching capabilities. The data retrieval routines include the option to "read-through-lock" to access data in locked data tables, the capability to directly access to data using tuple identifiers, and the capability to directly access unformatted data from input areas which contain blocks of unformatted data. The data updating routines include an option to omit index updating when updating data and an option to update data in a locked data table. Multiple indexes can be defined for a data table. Thus, high speed searches can be performed based on a variety of data fields. The data storage and retrieval mechanisms are independent and there are hash index tables that connect the multiple index keys to the data tables. The data table structure includes a column defined for storing tuple identifier strings. These tuple identifiers can be used as pointers for chaining to related data stored in other data tables. The datas base has relatively small programmatic memory. There is a common structure for user data tables, index tables and system tables. The database includes a minimum number of routines with certain routines providing multiple functionality.

Authorization for selective program access to data in multiple address spaces

Abstract: A program authorization mechanism for authorizing access to an address space in the main memory of a computer system by a program being run under a multiple address space facility. An access-list entry is associated with each address space, each access-list entry being designated by an access-list-entry token contained in an access register. Each access-list entry includes a private indicator which indicates if the associated address space can be accessed by all programs from this access-list entry or if the associated address space can only be accessed by an authorized program. For program to be authorized, an extended authorization index in a control register must match an access-list extended authorization index in the access-list entry, or the extended authorization index value must be authorized in an authority table associated with the address space. An instruction for testing a given extended authorization index for a given access-list-entry is also disclosed.

The integrated manufacturing data administration system (IMDAS)—an overview

Abstract: Automated manufacturing requires sharing of data among control, sensory and administrative processes. Since these processes are invariably distributed over many different computer systems, we claim that a distributed data system is necessary. Unlike most extant data systems, a manufacturing enterprise requires support for: diverse computer systems, data systems and databases; real-lime data access; and integration of new systems into a running complex. This paper briefly discusses these issues and describes a prototype implementation of a distributed data system that addresses them.

A performance comparison of multimicro and mainframe database architectures

Abstract: The performance of a hypothetical multiprocessor back-end database machine is compared to that of a mainframe database system. The hypothetical database machine uses standard microprocessors and disks as well as processors and disks projected to be available in the future. The class of workloads considered is high-volume transaction processing. Analytic queueing models of the two architectures are constructed and used in parametric performance studies. The performance sensitivities with respect to transactions complexity, the amount of overhead required to implement the distributed database function, the amount of skew in the data access pattern, and the buffer miss ratio are determined. >

Database management coprocessor for on-the-fly providing data from disk media to all without first storing data in memory therebetween

Abstract: A data base information engine subsystem which examines data on the fly as it is retrieved from a mass storage device (i.e., disk), and before storing it in memory, to select only the specified elements of data required by the host computer according to criteria set forth by the host computer. A page mapper circuit separates the host command processing from the data access processing for the command. The instruction set used by the information engine subsystem contains optimizing algorithms to parse and reorder the required operation to be most efficient (with respect to time). The information engine subsystem also contains a high speed processor which is a special purpose processor designed and optimized for data retrieval while doing operations on the data at high speed.

The integrated analysis capability (IAC level 2.0)

Abstract: The critical data management issues involved in the development of the integral analysis capability (IAC), Level 2, to support the design analysis and performance evaluation of large space structures, are examined. In particular, attention is given to the advantages and disadvantages of the formalized data base; merging of the matrix and relational data concepts; data types, query operators, and data handling; sequential versus direct-access files; local versus global data access; programming languages and host machines; and data flow techniques. The discussion also covers system architecture, recent system level enhancements, executive/user interface capabilities, and technology applications.

Experiments with Data Access and Data Placement Strategies for Multi-Computer Database Systems

Abstract: The software-oriented multi-computer database systems are characterized by a set of processing elements (PEs) which run identical software and operate on a partitioned database in parallel Performance improvements and capacity growth can be achieved in this type of system by adding more PEs to the configuration and replicating the existing software on the new PEs

Internal interleaving type semiconductor memory device

Abstract: A semiconductor memory device determines the level of a select control signal, according to the level of drive signals for two systems as generated in the preceding access cycle, and the level of the least significant bit of an address to fetch data in a desired serial access cycle. In accordance with this select signal, a select circuit selects one of the drive signals as generated by drive signal generating circuits, and supplies the selected signal to two data selecting/fetching systems. The function of this select circuit allows one of the two data selecting/fetching systems to first start the data access operation.

Design and Performance Analysis of a Relational Replicated Database System

Abstract: : The hardware organization and software structure of a new database system are presented. This system, the relational replicated database SYSTEM(RRDS), is based on a set of replicated processors operating on a partitioned database. Performance improvements and capacity growth can be obtained by adding more processors to the configuration. Based on design goals a set of hardware and software design questions were developed. The system then evolved according to a five-phase process, based on simulation and analysis, which addressed and resolved the design questions. Strategies and algorithms were developed for data access, data placement, and directory management for the hardware organization. A predictive performance analysis was conducted to determine the extent to which original design goals were satisfied. The predictive performance results, along with an analytical comparison with three other relational multi-backend systems, provided information about the strengths and weaknesses of our design as well as a basis for future research.

Storage data control system

Abstract: PURPOSE:To elevate a work efficiency up to obtain data required by a user by adding a storage data access circuit and a storage data accessing state display circuit together to a terminal side to display the data, obtained from a host side through a communication circuit, and changing the displaying form of a picture referring to the respective circuits. CONSTITUTION:The data, stored by a storage data hold circuit 7, is fetched by a storage data fetch circuit 8, and is displayed on a CRT 5 through a data display circuit 4. Besides, the data is transmitted from the storage data hold circuit 7 to the storage data access circuit 11, and the data is transmitted as well from the storage data accessing state circuit 12, connected to the storage data access circuit 11, to the data display circuit 4. Then, the displaying form is changed according as the accessed data is the one, has been accessed already, or the one, not yet accessed, or the one, not yet stored (registered). The change of the displaying form is made to be recognized at a glance by changing the color of the displayed picture of the CRT 5.

Analysis and Reanalysis of Shared Scientific Data

Abstract: Enormous strides in data handling and in telecommunications technology have made possible multiple access and sharing of data files. Sharing of research data often is resisted, however, because of (1) potential loss of monetary, political, or psychological reward; (2) potential conflict and disagreement; and (3) potential exposure of extreme bias or fraud. Found acceptable have been (1) the distribution of very large data files for further study, such as Public Use Tapes from the Bureau of the Census or the National Center for Health Statistics; and (2) the use of large data aggregates that serve as very comprehensive catalogs, such as bibliographic files for literature searches. Instances of scientist-to-scientist data sharing depend on individual arrangements. There are, however, many recorded instances of refusal to give access to data. Data that are liable to lead to conflict or controversy seem to be shared only if they fall within the realm of Freedom of Information legislation or court orders.

Disk cache control system and information processing system

Abstract: PURPOSE: To prevent rotational delay required for re-positioning from being generated wastefully by discriminating whether or not access to data is performed within a prescribed period when positioning to the data recorded on a disk device is performed, storing the data in a cache memory when no access can be performed, and responding to an input/output instruction by using stored data. CONSTITUTION: When the positioning to the data recorded on the disk device 5 is performed to make access from the disk device to the data requested by the input/output instruction from a host processor, it is discriminated whether or not the access to the data can be performed within the prescribed period. When it is cleared that no access to the data can be performed within the prescribed period, at least the data is stored in the cache memory 41, and after that, response to the input/output instruction from the host processor is performed by using the data stored in the cache memory 41. In such a way, it is possible to shorten a time required for data transfer by reducing waste rotational delay on a disk device side at the time of performing the transfer of the data between the host processor and the disk device 5. COPYRIGHT: (C)1990,JPO&Japio

Data access system

Abstract: PURPOSE:To constitute a knowledge data base system capable of flexibly coping with knowledge correction by independently providing a knowledge expression related to data access and writing conversion knowledge and inference knowledge independently of each other. CONSTITUTION:When an inference start signal is given through an interface 5, an inference mechanism 4 sends a conversion execution instruction 11 to a conversion mechanism 1. The conversion mechanism 1 takes out values from data base fields written in external data base entries in order from the top and stores them in frame slots. Inference is started after all of the input processing is terminated. After inference is ended, the conversion mechanism 1 takes out values written in frame slots in order and stores them in external data base fields. By this constitution, required data during inference is designated in a form of table.

Moving body subscriber data access system

Abstract: PURPOSE:To decrease a remote file access by using prescribed subscriber data held in the zone station without executing the access to subscriber data in a home memory station at the time of holding a prescribed subscriber class when a zone moving machine is transmitted. CONSTITUTION:A moving body exchange 100 of a home memory station stores subscriber data 110 of a zone station moving machine 3. A moving body exchange 200 of a zone station is the exchange to convert and connect the outgoing and incoming call of the moving machine 3. At the exchange 200, a subscriber data access displaying means 210 and a subscriber data access means 220 are provided. According to the fact whether or not the subscriber data 110 corresponding to the zone station moving machine 3 are the prescribed subscriber class, the means 210 sets the subscriber data access displaying to show whether the access to the subscriber data 110 is unnecessary or necessary. The means 220, when the transmission of the moving machine 3 is detected, refers to the means 210, and when the access is unnecessary, the subscriber data of the prescribed subscriber class held beforehand are used without executing the access to the data 110. For this reason, it is not necessary almost for the calling to execute a remote file access to a home memory station 1.

Dispersion type data base accessing mechanism

Abstract: PURPOSE:To execute programming without being conscious of a communication means between a master information processor and a remote information processor by setting up a device for executing network communication procedure independently of a program formed on the information processor requiring data so that the device can be utilized by plural programs in common CONSTITUTION:When a program 5 stored in an information processor 2 generates a data access instruction for data in a network system, an accessed destination deciding/switching module 60 decides an accessed destination by a destination address defined in the instruction A communication procedure module appropriate for one of information processors 11-13 to be communicated is selected from communication procedure module 61-63 and an access instruction is transferred to the selected module The communication procedure module requests data in data storage devices 41-43 by the communication procedure regulated by the information processors 11-13 to be communicated through network devices 31-33, and at the time of receiving data, transfers the data to the program 5 initially generating the data access instruction

Data base storing device

Abstract: PURPOSE:To access a row number at high speed without degrading the use efficiency of a storage space by using a completely balanced tree to store and manage data in column units and incorporating a short-circuit route, where an address is calculated by identity comparison with just preceding tree inquiry, in a circuit which calculates the address of each stage. CONSTITUTION:A storage management control system 3 uses the row number determined by the order of input to discriminate a row and uses a completely balanced tree to store fixed-length data constituting a data base in a data base storage medium 4 in column units. If data access in the column direction is requested, the storage management control system 3 naturally traces the completely balanced tree to read out data in serial because data is stored in column units in the data base storage medium 4. If data access in the row direction is requested, an address calculating mechanism 6 is used to obtain the address having a value corresponding to the row number and data is accessed.

Data base comparing system

Abstract: PURPOSE:To compare in order of accessing record concurrently with comparison of the data contents by utilizing the results of comparison between the record type information and the level information on each data stored in a hierarchical data base. CONSTITUTION:Not only the data contents but the data access orders are compared with each other by means of the results of comparison between the record type information and the level information on each data stored in a hierarchical data base. In other words, the correspondence of records is decided by comparing the record of a reference side data base 300 and that of a comparison side data base 400 and judging the result of this comparison. Thus no correspondence is secured among those records having different access orders and the comparison of records is impossible in terms of access orders.

DB4GL - An Intelligent Database System

Abstract: Current research within the Department of Computer Studies at Sheffield City Polytechnic indicates that it is possible to define a generalised database architecture which results in a worthwhile simplification of the traditional applications programming task The approach adopted stems from the derivation, from normalisation procedures, of all the association relationships which exist between a set of entities, and then selecting the relevant subset of entities and association relationships for a specific application program This subset is used to generate a data access schema, which has the important property that multiple data realisations can be performed on linked entities in anticipation of eventual demand This reduces considerably the need for the programmer to specify explicit file handling operations within an application program The data access schema is in fact one of four major structural software components in an application program which may be specified and generated The other components are:- 1 an information description schema, one per entity, which specifies record actions, data item transfers and global integrity rules, 2 a process schema, which contains details of local integrity rules, that is, local to a specific application, and processing requests, 3 a presentation object, which contains details of user presentation in terms of screens, reports and graphical output, as well as error handling and the overall sequencing of the applications task

Secret protection management system for information processing system

Abstract: PURPOSE:To protect the secret more effectively by counting the number of times of data access with wrong passwords to detect that it reaches a prescribed value and informing a data manager of the detection result to perform the timely change of data names or the password. CONSTITUTION:When informed that the data access is not permitted because of disaccord of a password, a counter operating means 12 subtracts one from contents of a counter field 5c of a data management record 5 in a management information storage means 10 which has the same data name as the data name indicated by a counter start interface 101. If contents of the counter field 5c of the data management record 5 becomes zero by this subtraction of the counter operating means 12, a counter prescribed value discriminating means 13 detects this state and informs an information processing system that the number of wrong access requests to data of the pertinent data name reaches the prescribed value through a warning interface 4.

Dealing with data in large end-use load metering projects: Data quality and data access

Abstract: Hourly end-use electrical consumption data collected for the Bonneville Power Administration and the United States Department of Energy as part of the End-Use Load Conservation Assessment Program (ELCAP) are subjected to extensive data processing prior to entry in the data archive. Due to the extremely large size of the data set, all data processing activities must be highly automated. Two of the most important data processing activities are data quality checks and pre-aggregation of the hourly data to daily and monthly levels. The data quality checks allow both the rapid identification of problems and the encoding of a concise indicator of data quality for individual data records. A detailed procedure based on conservation of energy principles has been developed for data quality checks on data collected as part of ELCAP. The pre-aggregation processing makes the most commonly used aggregations (daily, monthly, monthly profile) directly available for analysis, freeing the analyst to concentrate on the information content of the data. One of the most important lessons learned in ELCAP is that up to 50% of the time and money necessary to produce an analytical product may be spent in just preparing the data for analysis. Automation of the pre-aggregation process significantlymore » reduces the time needed for data preparation. This paper describes the need for automated data quality checks and pre-aggregation processing and discusses the specific checks that are performed on all ELCAP data as it is collected, processed, and archived for eventual analysis. 8 refs., 3 figs.« less

Method and system of cache management in a file sharing system

Abstract: A file sharing system, comprising a file access pro­cessor and a plurality of application support pro­cessors; and the file access processor, in turn, in­cludes a central data access system and a storage access system for accessing a database. The data access system is provided to form directories from data in the data­base, and to change data in that database. Each support processor includes a local cache to acquire and hold directories formed by the data access system; and for each directory acquired by at least one support pro­cessor, the data access system further includes a directory gate and a multitude of directory change blocks holding information describing changes in the database that affect the directory. The directory change blocks established for a given directory are arranged in a first chain anchored to the directory gate established for the directory. For each support pro­cessor that has acquired at least one directory, the data access system further includes a directory acquired block for each directory acquired by the support pro­cessor. Preferably, the directory acquired blocks established for a given directory are arranged in a second chain also anchored to the directory gate established for the given directory.

Data access system in multi-switching system

Abstract: PURPOSE:To change only a sub-routine only for a data access at the time of changing the type and the structure of data by making a data reading sub-routine and abstracting the data in a high order program for analyzing and processing. CONSTITUTION:An exchange A and an exchange B manage respectively subs subscribers a1-an, b1-bn individually play a switching function. Further the exchanges A, B use a common line C to deliver the data and execute one complete switching operation as a whole. The exchanges A, B have the plural sub-routine Sa1-Sam, Sb1-Sbm only for the data access and the high order programs Pa, Pb for calling them and analyzing and processing required for a switching control. The high order programs Pa, Pb, when certain/data is required in a logical development, declare a previously commonly defined data name, call the proper sub-routine and obtain the data.

Transparent data access in a multivendor, distributed data-acquisition and data processing system

Abstract: Location‐independent data access methods are being developed at Lawrence Livermore National Laboratory to manage and use data acquired by a multivendor distributed laboratory computer network. An interprocess communication system (IPCS) is used to connect tasks which produce, manage, or use experimental data. These tasks may run on any of the computers in the network. A central database and database server maintain supervisory records of experimental activity and locations of data produced by the experiment. Data may be located in several subsidiary local databases, file systems, or tape archives. Data access requests, if they cannot be satisfied locally, are routed via the IPCS to database servers, which locate and retrieve (or store) the requested data. We describe the design details and give examples of the current implementation.

Managing system for data for inference in knowledge base system

Abstract: PURPOSE:To improve the efficiency of an inference by allowing a knowledge base access managing to execute a retrieval processing within a registration range of its inference data management table. CONSTITUTION:A range of a data registered in an inference data management table 41 for managing the knowledge on a knowledge base as an inference use data is decided almost definitely by an initial load processing of the inference use data, and when a retrieval request of the inference use data is received from an inference mechanism 1, a knowledge base access managing mechanism 3 knows that its request is an access request of the inference use data by a notice from an inference data access mechanism 2, and executes an access processing based on the inference data management table 41. In this case, the retrieval processing is executed within a registration range of the inference data management table 41, therefore, by executing in advance a reduction of the inference use data in an initial load processing, deterioration of the efficiency of an inference can be prevented. Also, when an access as a knowledge data is requested, the knowledge base access managing mechanism 3 processes the access based on a knowledge data management table 40.

Data transfer control device

Abstract: PURPOSE:To improve the processing efficiency of a CPU by allowing a CPU to access a memory area storing block already ending normal data transfer. CONSTITUTION:A data transfer control device 1 corrects data indicating an untransferred area out of address areas instructed about data transfer in each data transfer of a block to be an object for error inspection and decides whether the data access of the CPU 41 is appropriate or not by comparing address data for data access applied from the CPU 41 to an address bus 43 with the data indicating the untransferred area. When the data access address of the CPU 41 is the memory area storing the block ending normal data transfer, the data access is regarded as appropriate one and executed. Consequently, data access required for the CPU 41 can be executes as rapidly as possible.