scispace - formally typeset
Search or ask a question

Showing papers on "Data access published in 1987"


Patent
Nobuo Ogasawara1
11 Sep 1987
TL;DR: In this paper, a system for permitting access to a data field area in an IC card for multiple services using an individual card holder identification number for each of a plurality of data fields or for each group of different data fields was proposed.
Abstract: A system for permitting access to a data field area in an IC card for multiple services using an individual card holder identification number for each of a plurality of data fields or for each group of data fields. Data field identification information, a personal identification number, access qualification information, and an authentication code are supplied to the IC card before an execution of an access to the data field. An authentication is made between the personal identification number and the authentication code stored in the IC card for the selected data field, and the personal identification number and the authentication code supplied to the IC card. Based on the result of the authentication, an access to the data field area to which access is requested is permitted within the limit of the access right stored in the IC card corresponding to the access qualification information supplied to the IC card.

112 citations


Patent
30 Nov 1987
TL;DR: In this article, a method and apparatus for controlling access to data blocks stored by addresses in a memory and concurrently accessible by a plurality of transactions is provided, which includes the steps of receiving an address of a data block to be accessed by a first transaction, deriving from the address an access table entry corresponding to the data block where the entry includes lock data that governs access to the block, and providing the access if permitted by the lock data, or providing access if not permitted by lock data.
Abstract: A method and apparatus for controlling access to data blocks stored by addresses in a memory and concurrently accessible by a plurality of transactions is provided. The method includes the steps of receiving an address of a data block to be accessed by a first transaction, deriving from the address an access table entry corresponding to the data block where the entry includes lock data that governs access to the data block, and providing the access if permitted by the lock data, or providing the access, if not permitted by the lock data, and recording the occurrence of the access in the lock data.

44 citations


Patent
27 Jan 1987
TL;DR: In this paper, a power disabling mechanism is used to prevent unauthorized access to information contained within data storage devices contained therein which utilizes a power disabling mechanism contained within the secured storage enclosure.
Abstract: Secured storage apparatus for preventing unauthorized access to information contained within data storage devices contained therein which utilizes a power disabling mechanism contained within the secured storage enclosure.

16 citations


Book ChapterDOI
29 Sep 1987
TL;DR: Specific performance problems of centralized ‘conventional’ DBMSs, DB/DC systems, andDBMSs for ‘nonstandard’ applications are discussed and some aspects and mechanisms how database management system performance could be controlled and improved by measurement/monitoring techniques and subsequent adaption of DB-schema design are discussed.
Abstract: Performance, data integrity, and user-friendly access to data are considered to be cardinal properties of database management systems (DBMSs) But performance will steadily receive more attention as more interactive application are designed and implemented for almost all domains of our life (According to some rumors, DBMS is sometimes said to be another name for performance problems) In this paper, we discuss specific performance problems of centralized ‘conventional’ DBMSs, DB/DC systems, and DBMSs for ‘nonstandard’ applications (eg engineering, office, etc) Then, a short survey attempts to sketch the solutions achieved and the problems remaining for the most important performance-critical functions/components in DBMSs Finally, some aspects and mechanisms are discussed how database management system performance could be controlled and improved by measurement/monitoring techniques and subsequent adaption of DB-schema design

8 citations


Patent
14 Mar 1987
TL;DR: In this paper, the authors propose to shorten the data access time to an optical disk device by using an electronic disk device or a magnetic disk device as a cache for data access.
Abstract: PURPOSE:To shorten the data access time to an optical disk device by using an electronic disk device or a magnetic disk device as a cache to the data access supplied to the optical disk device. CONSTITUTION:A data access request is issued to an optical disk device 1 from a data requester program 2, and when an optical disk cache processor 3 decides said request as an input request. Thus a control data memory part 4 is retrieved based on a position in the device 1 containing the input request data 11. The data 11 if stored in a cache area part 6 is extracted and sent to the program 2 in the form of the input data 22. In such a way, the following input request data can be sent from the part 6 with no access given to the device 1 as long as the input request data receive accesses successively.

6 citations


Journal ArticleDOI
TL;DR: The layered architecture of the system design, the system implementation, use, and the data file structure of the Advanced Toroidal Facility Data Management System are described.
Abstract: The Advanced Toroidal Facility (ATF) Data Management System (DMG) is a VAX-based software system that provides unified data access for ATF data acquisition and analysis. The system was designed with user accessibility, software maintainability, and extensibility as primary goals. This paper describes the layered architecture of the system design, the system implementation, use, and the data file structure.

6 citations


Journal ArticleDOI
TL;DR: A microcomputer based expert system, CHAMBER2, for control failure diagnosis support in a system of environmentally regulated plant research chambers has been developed, a dynamic system and is sufficiently autonomous to be used regularly.
Abstract: SYSTEMS that operate in real-time have stringent operational requirements and are particularly vulnerable to failures in their controls. Accurate fault diagnosis and speedy repairs are essential in such systems. A microcomputer based expert system, CHAMBER2, for control failure diagnosis support in a system of environmentally regulated plant research chambers has been developed. It is a dynamic system and is sufficiently autonomous to be used regularly. The expert system development environment used in this project has the capability to exit the heuristic knowledge base and run high-level language programs, passing information to and from the knowledge base. Using this feature CHAMBER2 has access to data bases and has communications links with the control computer that give it direct access to sensor measurements in real-time. These features minimize the requirement for data entry from the user and increase the availability of accurate data to the expert system. The shell software also provides for cycling through the knowledge base, facilitating real-time operation. When it (CHAMBER2) polls the sensors and finds no problems, it reinitializes the knowledge base and looks again without requesting user observations. The emphasis in this development was on the integration of data bases, sensor data, and cycling in real-time. Future work will emphasize development of feedback from the expert system to the control program.

6 citations


Patent
20 Jan 1987
TL;DR: Disclosed as mentioned in this paper is a data access structure which facilitates the processing of statistical queries concerning records stored in the structure and is suitable for implementation with a wide variety of hierarchical and non-hierarchical access methods, including those based on the B-tree, ISAM, RRDS of IBM VSAM, and HDAM of IBM IMS.
Abstract: Disclosed is a data access structure which facilitates the processing of statistical queries concerning records stored in the structure. The structure, according to the present invention, comprises a plurality of data nodes (56-59) storing the records, and a plurality of access nodes (50-55) storing at least one pointer (P) to another access node or to a data node, and arranged according to an organization whereby each access node is associated with at least one data node. Statistical information is associated with a subset of the plurality of access nodes and data nodes concerning the records stored in the data node or data nodes associated with the respective access node. Further, a means is provided responsive to changes in the records stored in the data nodes for updating the statistical information in the access structure concerning the records stored in the data node. The present invention is suitable for implementation with a wide variety of hierarchical and non-hierarchical access methods, including those based on the B-tree, ISAM, RRDS (Relative Record Data Set) of IBM VSAM, and HDAM of IBM IMS.

4 citations


01 Jan 1987
TL;DR: The Los Alamos &son Physics Facility (LAMPF) control system software is extended to allow uniform access to data and controls throughout the control system network to allow Uniform and easily expandable inter-node communication.
Abstract: We have extended the Los Alamos &son Physics Facility (LAMPF) control system software to allow uniform access to data and controls throughout the control system network. ‘Iwo aspects of this work are discussed here. Of primary interest is the use of standard interfaces and standard messages to allow uniform and easily expandable inter-node communication. A locally designed remote procedure call orotocol will be described. of further interest is the use of distributed databases to allow maximal hardware independence in the controls software. Application programs use local partial copies of the global device description database to resolve symbolic device names.

4 citations


Journal ArticleDOI
TL;DR: A concept covering the collecting and processing of obstetrical and perinatological data is described, which offers to hospitals of any size quick and easy access to data at any time, as well as optimised patient care, without additional effort and at a reasonable cost level.
Abstract: A concept covering the collecting and processing of obstetrical and perinatological data is described. Collecting of patient data is effected on the basis of a case history that has been drawn up in an EDP-adequate manner, which, however, can also be used in the conventional way. This procedure was chosen because for some time to come one cannot do without a document for handwritten notes to avoid duplication of work by "double tracking" and to eliminate transmission errors, and also to continue the present procedure of dealing with the patient. A commercial data base system was chosen for data collection and storage (dBase III by Ashton Tate). This relational data base has its own programming language with very powerful macro calls. Data input is effected by means of programme masks which the user can solicit via menu monitoring. The requisite hardware configuration consists of a computer with a main storage comprising 640 KB, system MS-DOS, and a hard disk of at least 20 MB. This data collection system operates in an obstetric hospital with annually more than 1,600 births and more than 1,200 entries during early pregnancy, to the satisfaction of the users. Besides compiling the usual statistical analyses and formulating research problems, the system automatically prepares the discharge reports. This rationalisation procedure compels the user to collect the data with care and also completely. On the whole, such a data collection system offers to hospitals of any size quick and easy access to data at any time, as well as optimised patient care, without additional effort and at a reasonable cost level.

4 citations


Journal Article
TL;DR: The strategic management information data base is the foundation of a hospital's decision support system, which is rapidly moving into the category of a necessary tool of the hospital manager's trade.
Abstract: Healthcare industry changes during the 1980s--increased competition and alterations in the Medicare payment methodology--place new and more complex demands on a hospital's information systems, which often fall short of meeting those demands These systems were designed for financial reporting, billing, or providing clinical data, and few of them are capable of linking with other unrelated systems Today's hospital manager needs timely and simultaneous access to data from a variety of sources within the hospital All the elements to accomplish this are collected somewhere in the hospital, but finding them and bringing them together is difficult The key to the efficient management and use of data bases is in understanding the fundamental concept of relational data bases, which is the capability of linking or joining separate data files through a common data element in each file In this way, data files may be integrated into a "related" data base Any number of separate files, or tables, may exist within a "relational" data base as long as a series of threads links them A strategic management information data base includes the information necessary to analyze, understand, and manage the hospital's markets, products, resources, and profitability The major components of this information system are the case mix and cost accounting, budgeting, and modeling systems The case mix and cost accounting factors involve managing concrete pieces of data, whereas the budgeting and modeling factors manipulate data to create a scenario The strategic management information data base is the foundation of a hospital's decision support system, which is rapidly moving into the category of a necessary tool of the hospital manager's trade

Journal ArticleDOI
TL;DR: It is shown that an object‐oriented data management system is a step towards solving the problems of design data management, based on a systematic specification of data structures and data access methods, using abstract data type specifications.
Abstract: The computer-aided design of dedicated pipelined processors for numerical applications and signal processing requires design tools that support system refinement, partitioning strategies and the transformation of behavioural descriptions into structure. This in turn poses problems of design data management which are considered here. We show that an object-oriented data management system is a step towards solving the problems. The method proposed here is based on a systematic specification of data structures and data access methods, using abstract data type specifications. As a result, the data management is completely transparent to the application programs. The data-management system is written in Enhanced C (EC), a set-orientated extension of the language C.

Patent
28 Aug 1987
TL;DR: In this paper, a titled device is provided with a data storage matrix, which has been constituted by using plural pieces of DRAM elements, a row direction data access circuit 2 for connecting a row data line 92 which had been connected to the data storage matrices, to an external data line 91, and executing write or read-out of the data.
Abstract: PURPOSE:To easily realize the titled device having a large capacity, by constituting the device so that an access can be executed in the line direction and the row direction by setting a list of plural bits as a unit, and also, increasing only the number of memory elements. CONSTITUTION:The titled device is provided with a data storage matrix 1 which has been constituted by using plural pieces of DRAM elements, a row direction data access circuit 2 for connecting a row data line 92 which has been connected to the data storage matrix 1, to an external data 91, and executing write or read-out of the data, and a line direction data access circuit 3 for connecting a line direction data line 93 which has been connected to the data storage matrix 1, to the external data line 91, and executing write or read-out of the data. Also, a signal 21 instructs which access of read-out/write is to be executed to the data access circuits 2, 3, a signal 22 and 23 activates the data access circuits 2, 3, respectively, signals 11-17 control a memory element in the data storage matrix 1, and a signal 18 and 19 control the row direction data access circuit 2.

Proceedings ArticleDOI
01 Dec 1987
TL;DR: The key to the development of heterogeneous databases is in the evolution of existing systems in an attempt to satisfy real needs of end-users, as well as solving number of problems pertaining to data architecture and system architecture.
Abstract: Heterogenous database systems have recently begun to emerge because the progress in computer networking made their development technologically feasible and, what is more important, in response to an authentic demand from the users of information systems.In any functioning large organization, be it business or government, there are multiple databases in use, supporting their own applications and end-users. These databases may have different scopes, different data models and query languages, etc. Attempts to eliminate or suppress this diversity are usually not successful. Large “comprehensive” and “integrated” database systems built this way frequently become white elephants, irrelevant to the needs of end-users and largely ignored by them.It appears, that the concepts of “global schema” (and its distributed equivalent of “integrated schema”) on which such approaches are based represent an utopian idea that all data resources, for all users can be managed and maintained by a central authority (Database Administrator) who “knows better” what are the needs of the users. The totalitarian overtones of this approach (typical for most utopian ideas) are easily detectable. On the other hand, a consensus seems to exist among users that many applications exist which require access to data from multiple databases. How can such requirements be met?A possible practical approach is to create loose federation(s) of database systems which can cooperate in fulfilling users requests for information. Under this approach the database systems may exchange the (meta)-information about these parts of their data content that they decided to contribute to the global pool of information. If a request for an access to data is made to a local database system it can then locate the data in another system and forward the request to the owner of the data. This process can be wholly or partially transparent to the end-user. However, at each time the local systems exercise the full control over their data, thus preserving their autonomy.Of course, to implement such systems we need to solve number of problems pertaining to data architecture and system architecture. The first group of problems deals with possible incompatibilities among databases participating in a federation. For example, the member databases may have different user interfaces, their schemas may be inconsistent, domain definitions for attributes may be different, the data themselves may be redundant or inconsistent. The second, equally important, group of problems is related to the transaction management in heterogeneous systems. Most of the prototype implementations described in the literature allow only retrieval operations in a heterogeneous environment, since the updates present serious problems in the areas of concurrency control, logging, security, etc. Only when these and other related problems will be solved, the necessary conditions for creating “true heterogeneous databases” will be satisfied.Thus, although we can not fully answer the question WHEN the true heterogeneous systems will become available we may attempt to suggest HOW this can be accomplished. The key to the development of heterogeneous databases is in the evolution of existing systems in an attempt to satisfy real needs of end-users. The inevitable partial loss of local autonomy must be clearly compensated by the expected gains in accessibility to data.

Patent
18 Sep 1987
TL;DR: In this paper, the authors propose to hold an address and data generated at the inhibition of access to an arithmetic processing means by a holding means and writing data in a logical screen storing means at the time of unconditional interruption processing.
Abstract: PURPOSE:To more efficiently and economically execute the screen control of each job by holding an address and data generated at the inhibition of access to an arithmetic processing means by a holding means and writing data in a logical screen storing means at the time of unconditional interruption processing. CONSTITUTION:When a picture memory access arbitrating circuit 24 makes a memory access permission signal 25 inactive, data access to a physical picture RAM 15 is inhibited and a hold control signal is activated, so that an MPU holding address holding circuit 18 temporarily holds an address on an address bus 12. When the access request is a data writing request, a hold control signal 28 is activated and an MPU data holding circuit 19 temporarily holds data on a data bus 13. The address held by the circuit 18 and the data held by the circuit 19 are read out and inputted to an MPU 11 through the data bus 13 and an operating system writes data in a logical screen RAM 23 in stead of the job executed at that time.

Proceedings ArticleDOI
Philip Heidelberger1, Seetha Lakshmi1
01 May 1987
TL;DR: This paper presents a systematic study of the performance trade-offs between a multi-microprocessor database machine and a large mainframe system and considers a range of transactions and investigates the sensitivity of the two architectures to various transaction related parameters.
Abstract: Database machine architectures consisting of multiple microprocessors or mini-computers are attracting wide attention. There have been several proposals and prototypes (see, e.g., DeWitt, Gerber, Graefe, Heytens, Kumar and Muralikrishna (1986), Fishman, Lai and Wilkinson (1984), Hsiao (1983), or the 1983 and 1985 Proceedings of the International Workshop on Database Machines). There is also a commercially available system based on multiple microprocessors (Teradata (1984)). With these architectures it is possible to exploit parallelism at three levels: within a single query, within a single transaction, and by simultaneously executing multiple independent transactions. The rationale behind these multiple microprocessor architectures is primarily to take advantage of the potential lower cost per MIPS (Millions of Instructions per Second, a measure of processing power) of microprocessors as opposed to mainframes. In addition, database machines may offer incremental capacity growth as well as improved performance for large queries by exploiting parallelism within a single query. However, it is not clear if database machines made of multiple microprocessors indeed have any cost/performance advantage over a more conventional mainframe based database management systems. Several papers on the performance analysis of database machines can be found in the literature (e.g., Salza, Terranova and Velardi (1983) or Bit and Hartman (1985)). Most of these studies have focused on determining the execution time of a single query in a particular database machine architecture.Few studies have dealt with the response time of single queries in a multi-user environment. We are not aware of any papers that systematically study the performance trade-offs between a multi-microprocessor database machine and a large mainframe system. This paper presents such a systematic study.We examine a hypothetical database machine that uses standard microprocessors and disks; database machines that use special purpose hardware are not considered here (e.g., Sakai, Kamiya, Iwata, Abe, Tanaka, Shibayama and Murakami (1984)). However, we do not limit our studies to the components available today; we also consider processors and disks projected to be available in the future. We assume that both the database machine and the mainframe provide relational database functions (e.g., Date (1986)). While there are several applications for relational database (on-line transaction processing, ad-hoc queries, etc.), we limit our attention to one specific application domain; namely high volume on-line transaction processing. In this domain, we consider a range of transactions and investigate the sensitivity of the two architectures to various transaction related parameters. Dias, Iyer and Yu (1986), in a similar study, have investigated the issue of coupling many small systems to obtain comparable performance of a few (coupled) large systems. Their study is limited to a specific workload with no parametric or sensitivity study with respect to transaction characteristics and the architectures they compared are quite different from the database machine considered in this paper.For high volume transaction processing environments, there appears to be only a limited potential to exploit parallelism within a single transaction. It is therefore expected that since the database machine is made of slower processors and since the functions are distributed across several processors, it would require more aggregate processing capacity, or MIPS, than the mainframe to sustain a given throughput and a response time. Thus there is a trade-off between the cheaper cost per MIPS of microprocessors as opposed to mainframes and the increase in aggregate MIPS required by the database machine to achieve a given performance level. This paper addresses this trade-off through the use of queueing network performance models of the two architectures.Assuming that the MIPS ratings of the microprocessor and mainframe are equivalent, our models indicate that with today's processor technology, the performance of the database machine is sensitive to the transaction complexity, the amount of skew in the data access pattern, the amount of overhead required to implement the distributed database function and the buffer miss ratio. Furthermore, there is only a narrow range of transaction processing workloads for which the database machine can meet a prespecified response time objective with only a moderate increase in aggregate processing capacity over that of the mainframe. However, using the technology projected for the early 1990's, our models predict that the performance of the hypothetical database machine is less sensitive to the above factors. Assuming that the level of lock contention is low, the memory hierarchies of the two architectures are equivalent (in the sense of achieving equal buffer miss ratios), and the performance of disks are equivalent in the two architectures, the models predict that the performance objective can be met with only a moderate increase in aggregate capacity for a broader range of transaction workloads.The workloads considered in this paper consist of relatively short transactions based on primary key retrievals and updates. It is therefore difficult to make general conclusions about the overall superiority of one architecture against the other when a mixed set of workloads is expected (our study assumes that all transactions have the same expected pathlength and I/O activity). This study focused on performance issues and specifically does not address such issues as MIPS flexibility (general purpose versus special purpose architectures), security, recovery and system management.


Proceedings ArticleDOI
03 Feb 1987
TL;DR: In this article, the VSAM data access method supports management of sequential, relative, and index-sequential files The latter are highly dependent on various parameters in terms of access behavior and storage overhead and only few experts in this field are able to reasonably adjust these parameters to meet application programmers' requirements.
Abstract: The VSAM data access method supports management of sequential, relative, and index-sequential files The latter are highly dependent on various parameters in terms of access behavior and storage overhead Only few experts in this field are able to reasonably adjust these parameters to meet application programmers' requirements This paper reports on the implementation of an expert system containing all relevant facts as well as heuristics for an optimal design, and providing access for application programmers via a dialog shell

Patent
23 Apr 1987
TL;DR: In this article, the authors propose to improve the productivity at the time of preparing the data base access program by generating the access processing by the individual applied program in a lump and replacing the data access processing from the applied program to the centralizingly controlled common access module.
Abstract: PURPOSE:To improve the productivity at the time of preparing the data base access program by generating the data base access processing by the individual applied program in a lump and replacing the data access processing from the applied program to the centralizingly controlled common access module. CONSTITUTION:After the data base design is completed, a data base schema definition 3 is prepared by using the data base definition function. Thereafter, as the preparing work, the logical record to satisfy the processing request from an applied program 4 is designed, and by using a logical record definition means 10, the logical record definition is registered to a logical record definition library 11. Next, by using an access module generating means 20, the access module forming the logical record is generated. In accordance with the necessity, by using a customized means 30, the access module is changed. After the preparing work is completed, the logical record defined by the logical record definition means 10 is prepared, and by using the data base operating instruction which is an object, the applied program 4 is prepared.

Patent
18 Sep 1987
TL;DR: In this paper, the authors proposed to add the difference between a main address and a sub-address to the sub-code and execute the access by the subaddress, which can be used to accelerate the access to the position close to the address of a purpose at the time of the completion of a large access.
Abstract: PURPOSE:To hasten access speed even with any CD-ROM disk reproducing system by adding the difference between a main address and a subaddress to the subaddress and executing the access by the subaddress. CONSTITUTION:For example, when the subaddress is held besides a block address given for a data block like CD-ROM and by using these two pieces of address information, the data are accessed, the difference between the read subaddress and the main address is the absolute error of both addresses, and approximately constant when recording media are the same. Consequently, by adding the error difference of both addresses to the address of a subcode and executing the access, the access can be executed to the position close to the address of a purpose at the time of the completion of a large access, and the access speed can be hastened. The variance of the difference between both addresses for a disk is also corrected and the access can be executed approximately at the same access speed by any disk as well.

Proceedings ArticleDOI
03 Feb 1987
TL;DR: NODS allows a user to make requests and recieve answers within a short time of accessing the system, and has an archive system that holds data from ocean-observing satellites.
Abstract: The management of data generated from satellite missions has not always led to effective access of that data by the scientific community. NASA has tried to alleviate this problem for ocean scientists, by initiating a program. the NASA Ocean Data System (NODS). The menu-based user interface that NODS employs allows a user to make requests and recieve answers within a short time of accessing the system. A catalog system, which holds information about oceanographic data sets may be queried to determine the suitability of a particular data set. Once a candidate data set is found, the user is directed to the person or place which actually holds the data. NODS also has an archive system that holds data from ocean-observing satellites. The archive may be queried to obtain a manageable data subset that can be delivered in a useful form.

Proceedings Article
04 Nov 1987
TL;DR: The logical databases derived by this work can be used as a starting point for defining application protocol standards for hospital system interface transactions.
Abstract: In order to provide a consistent view of work functions which can be supported by successive releases of hospital information systems, a hospital business model was developed The business model describes potential system functions along with their data access needs This model was used to determine an optimal set of mutually exclusive logical databases These logical databases are seeds around which design of distributed systems should be based The logical databases derived by this work can be used as a starting point for defining application protocol standards for hospital system interface transactions

01 Jan 1987
TL;DR: The Los Alamos Meson Physics Facility (LAMPF) control system software is extended to allow uniform access to data and controls throughout the control system network to enable uniform and easily expandable inter-node communication.
Abstract: We have extended the Los Alamos Meson Physics Facility (LAMPF) control system software to allow uniform access to data and controls throughout the control system network Two aspects of this work are discussed here Of primary interest is the use of standard interfaces and standard messages to allow uniform and easily expandable inter-node communication A locally designed remote procedure call protocol will be described Of further interest is the use of distributed databases to allow maximal hardware independence in the controls software Application programs use local partial copies of the global device description database to resolve symbolic device names

Patent
20 May 1987
TL;DR: In this paper, the propriety for access to data is compared with the size stored previously to give the debug after storing previously the size of the actual argument, and the value of K is added to the area 7 and data access instruction 5 is executed.
Abstract: PURPOSE:To perform a debug processing at high speed and with high efficiency by forming a program so that the propriety for access to data is compared with the size stored previously to give the debug after storing previously the size of the actual argument. CONSTITUTION:A memory area 7 for actual argument address and a memory area 8 for the size of actual argument are provided to a main program 2 when a program 1 is produced. When the program 1 is started, the program 2 refers to a subroutine 3 and this routine 3 is executed. here an address area check instruction 6 checks whether the access data is set within the size range stored in the area 8 or not as long as the access is equal to the dummy argument. If the access data is set within said size range, i.e., the data is normal, the value of K is added to the area 7 and a data access instruction 5 is executed. While if the access data is out of the access data, i.e., the data is not normal, this fact is informed to a programmer.

Patent
12 Jun 1987
TL;DR: In this paper, the authors proposed to speed up an access by previously preparing both a magnetic disk and an optical one and allowing a data management note managing image data to automatically select an optimum image data storage medium at the time of access.
Abstract: PURPOSE:To speed up an access by previously preparing both a magnetic disk and an optical one and allowing a data management note managing image data to automatically select an optimum image data storage medium at the time of access. CONSTITUTION:A data processor 20 processing data by causing a CPU to execute the prescribed instruction is composed of an application processing part 21 executing the processing required by a user through the use of image data, an image data access part 22 and a data base management part 29, and has the magnetic disks 12 and 14 and the optical disk 15. For processing an access medium selection part, the access part 22 executed said processing according to the access request from the application processing part 21, while an optical disk storage processing part 30 in the control part 29 processes an optical disk updating part. Thus image data frequently referred is provisionally stored on the optical disk 15, and temporarily loaded on th magnetic disk 14 as necessary, whereby data is efficiently used and accessed at high speed.

Patent
12 Sep 1987
TL;DR: In this paper, the authors propose to improve the performance of long data access and to store a data base in a rewrite-disabled medium by dividing the data base space into a long data space and an auxiliary data space, and storing the long data in the unused area with priority.
Abstract: PURPOSE:To improve the performance of long data access and to store a data base in a rewrite-disabled medium by dividing a data base space into a long data space and an auxiliary data space, and when an unused area for the updating or storing request of long data exists, storing the long data in the unused area with priority CONSTITUTION:When record updating is request from an application program part 2, a record access part 3-1 requests the discharge of a new area to a space management part 3-2 The management part 3-2 requests a control part 3-5 to determine an auxiliary data space, request an unused space management part 3-4 to discharge an unused area in the determined auxiliary space, and when the unused area exists, discharges the requested area from an address indicated by an FSP and advances the FSP by the discharged contents A control part 3-1 stores long data in the newly discharged area In addition, normal data and long data control information are stored in a main data space

Patent
09 Jul 1987
TL;DR: In this article, a data access circuit that can transfer data between a main memory and a program counter and a data length designating circuit which controls the data access circuits is presented.
Abstract: PURPOSE:To attain execution of the digital information processing despite the mixture of different bit lengths by using a data access circuit that can transfer data between a main memory and a program counter and a data length designating circuit which controls the data access circuit. CONSTITUTION:When a data access circuit 6 stores data in a main memory 1 from a program counter 2, a data length designating circuit 7 produces the information showing the length of the data to be stored to store it in the memory 1 together with data. When the circuit 6 stores data in the counter 2 from the memory 1, the circuit 7 designates the length of the data to be stored according to the information on the memory 1 and stores data with the designated data length. Therefore it is possible to execute both a certain routine and another routine written by an object code that handles the different bit length from the first routine despite the mixture of both routines when these routines are called out.

Journal ArticleDOI
T. J. Cipher1
TL;DR: As the factory environment becomes increasingly automated, the need for data organization, data integrity, and data access will be a requirement, and a local-area network for the factory is an option capable of solving data requirements.
Abstract: As the factory environment becomes increasingly automated, the need for data organization, data integrity, and data access will be a requirement A local-area network for the factory is an option capable of solving data requirements In addition, factory operation complexity can be reduced by centralizing data and developing robust applications; these applications should fulfill data organization, integrity, and access requirements and be an operator's interface to the automated factory

Patent
30 Jun 1987
TL;DR: In this paper, the arbitration of the occupying right of a common memory 30 is executed not per bus cycle but per data access when data to spread over plural bus cycles are exchanged between plural CPUs 10 and 20, a trouble to rewrite the data in the middle of the exchange is essentially avoided and a signal whose deciding means of one data access is equipped by a general CPU is utilized.
Abstract: PURPOSE:To execute a data access to a common memory in the same way as the access to a normal memory by executing the arbitration of a common memory occupancy request from respective CPUs not per bus cycle but per data access CONSTITUTION:The arbitration of the occupying right of a common memory 30 is executed not per bus cycle but per data access When data to spread over plural bus cycles are exchanged between plural CPUs 10 and 20, a trouble to rewrite the data in the middle of the exchange is essentially avoided and a signal, whose deciding means of one data access is equipped by a general CPU, is utilized Thus, data to need the bus cycle of more than two times are prevented from being rewritten halfway and even to the covalent memory, an access is executed in the same way as the access to a normal memory