By Topic

1987 IEEE Third International Conference on Data Engineering

3-5 Feb. 1987

Filter Results

Displaying Results 1 - 25 of 90
  • [Front cover]

    Publication Year: 1987, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (15930 KB)
    Freely Available from IEEE
  • Linear hashing with Priority Splitting: A method for improving the retrieval performance of linear hashing

    Publication Year: 1987, Page(s):2 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1539 KB)

    Linear hashing is a technique for constructing dynamic files for direct access. It has an advantage over other dynamic methods in that it lacks a directory. However, a weakness of the method is that at high packing factors, it requires more probes on the average to access a record than do many of the static methods. This paper presents a straightforward modification of linear hashing which, accord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions

    Publication Year: 1987, Page(s):10 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1994 KB)

    Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffers from several disadvantages. In a recent paper we have suggested a multidimensional dynamic hashing scheme which exhibits better retrieval performance than its competitors for uniform distribution. The even more severe se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Batched Interpolation Searching on databases

    Publication Year: 1987, Page(s):18 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2326 KB)

    This paper examines the effect of batching search requests in the Interpolation Search Algorithm on ordered tables in main-memory as well as in a more typical database environment, i.e. a blocked secondary memory. Experiments are performed on several hybrid interpolation search algorithms over non-uniformly distributed data. The effect of batching on these algorithms is examined in terms of algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database systems as controllers, managers and linguists a study of the relationship of database and operating systems

    Publication Year: 1987, Page(s):26 - 27
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB)

    The study of the relationship of the database system and the operating system can best be characterized in terms of their issues on resource management and language support. In this paper the similarities and differences of these two types of systems (i.e., database systems and operating systems) on resource management and language support are articulated. It is hoped that this articulation can po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Panel on: “Distributed operating” systems and distributed databases

    Publication Year: 1987, Page(s): 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (59 KB)

    I would like to make my comments in the context of distributed information systems, or if you prefer, distributed computers and distributed data bases. I do so because: First, I believe this is the way that much of the information systems world is going; and, Second, free standing systems are a special case of distributed systems. If we can understand distributed systems, then we shall understand ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A vertical partitioning algorithm for relational databases

    Publication Year: 1987, Page(s):30 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1382 KB)

    In a relational database environment, transaction response time is likely to be affected by the time required to read the necessary data from secondary storage (disk). In cases where segment scans are used to a significant extent, vertical partitioning of the relation can result in a decrease in the number of disk accesses. The issue is how to set up the criterion for partitioning. In this paper, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing relational database operations in a cube-connected multicomputer system

    Publication Year: 1987, Page(s):36 - 43
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1929 KB)

    Parallel architectures for database processing should incorporate parallel CPU as well as parallel I/O (disk access) capability. The need to support parallel I/O gives rise to two important issues - data combination and non-uniform data distribution. Strategies for performing database operations in a cube-connected multicomputer system with parallel I/O are presented in this paper. The cube interc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The multi-lingual database system

    Publication Year: 1987, Page(s):44 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1906 KB)

    This paper introduces a new and unconventional approach to the design and implementation of a database system, the multi-lingual database system (MLDS). The multi-lingual database system is a single database system that can execute many transactions written respectively in different data languages and support many databases structured correspondingly in various data models, i.e., DL/I transactions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sessions: A technique and its application to the UNIX file system

    Publication Year: 1987, Page(s):54 - 61
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3117 KB)

    This paper describes a new technique for analyzing dynamic file usage patterns based upon classification of file sessions. Afire session Is defined to be the set of operations on a given file from the moment it is opened until the moment it is closed. If file system measurement data is organized into sessions, each session may then be classified by the pattern of file use that it demonstrates. Exa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A queueing network model for a distributed database testbed system

    Publication Year: 1987, Page(s):62 - 71
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1069 KB)

    A queueing network model to analyze the performance of a distributed database testbed system is developed and validated against empirical measurements. The model includes the effects of the concurrency control protocol (two-phase locking with distributed deadlock detection), the transaction recovery protocol (write-ahead-logging of before-images), and the commit protocol (centralized two-phase com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of complex queries in Main Memory Database Systems

    Publication Year: 1987, Page(s):72 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1417 KB)

    Memory residence can buy both functionality and performance for a database management system. In this paper, we present a description and a benchmark of an experimental implementation of a Main Memory Database System (MMDBS) that was designed to support complex interactive queries. We describe and evaluate the main memory database structures and query processing algorithms implemented in this prot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationship between data engineering and software engineering

    Publication Year: 1987, Page(s): 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (67 KB)

    Data engineering and software engineering have a very close relationship. Our ability in developing and maintaining large-scale software mainly depends on our ability to understand, analyze, use and update the enormous amount of data associated with various phases of the life cycle of the large-scale software system under consideration. Although many tools to provide useful assistance in developin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data engineering in Software Development Environments

    Publication Year: 1987, Page(s):85 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB)

    The design of a Software Development Environment (SDE) represents a very interesting point of contact between data engineering and software engineering. In this context data engineering becomes the cornerstone for successful software engineering practice. This paper attempts to bring about a better understanding of the difficulties associated with this task by considering sources of complexity in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional disk system for relational database

    Publication Year: 1987, Page(s):88 - 95
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1877 KB)

    The major performance bottle neck in the current computer system is in the low-performance secondary system. The performance of the CPU has increased dramatically so far, about several orders of magnitude improvement has been achieved. On the other hand, that of the disk system has shown little advance since nineteen sixties. The von Neumann bottle neck between the CPU and the secondary storage su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finer grained concurrency for the database cache

    Publication Year: 1987, Page(s):96 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The database cache transaction recovery technique as proposed in [Elhard and Bayer 84] offers significant performance advantages for reliable database systems. However, the smallest granularity of locks it provides is the page. Here we present two schemes supporting smaller granularity. The first scheme allows maximal concurrency consistent with physical two-phase locking, with the same per-transa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault secure dictionary machine

    Publication Year: 1987, Page(s):104 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2475 KB)

    A fault-secure dictionary machine is presented in this paper. The symmetry of the binary tree architecture for a dictionary machine is exploited to obtain fault-secureness with little overhead. The proposed design utilizes only one extra processor and with some other modifications to the structure of the processors, can detect a single failure of a processor or a link. The proposed design keeps tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and evaluation of algorithms to compute the transitive closure of a database relation

    Publication Year: 1987, Page(s):112 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1946 KB)

    Recursive query evaluation is a capability of deductively-augmented database systems that conventional database systems do not support well, if at all. Many recursive queries involve computation of the transitive closure of a relation. Previously published algorithms for transitive closure are iterative in nature, performing repeated joins, unions, and differences until convergence is obtained. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the evaluation of recursion in (deductive) database systems by efficient differential fixpoint iteration

    Publication Year: 1987, Page(s):120 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2292 KB)

    Based on matured database technology the paper provides new insights into efficient ways to evaluate recursive deduction rules. We show how the forward-chaining approach to deduction can flexibly be married with goal-directed aspects of best/easiest-first strategies. From the natural fixpoint semantics of recursion we develop generally applicable differential iteration schemes that efficiently com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive versus iterative schemes for least fix point computation in logic databases

    Publication Year: 1987, Page(s):130 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1533 KB)

    We study the evaluation of recursively defined virtual relations in logic databases. A contribution of our research, is to answer a query involving a recursive relation by executing either an iterative or a recursive procedure scheme depending on the variable instantiation of the query itself. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating recursive queries in CAD using an extended projection function

    Publication Year: 1987, Page(s):138 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2560 KB)

    Entities such as mechanical assemblies are recursive when they contain other assemblies at a lower level of detail. In this paper we show how recursive CAD entities can be manipulated using an extended projection function. The new function finds nested sub-entities within entities that are modeled as trees of aggregations and generalizations. It allows these sub-entities to be found using expressi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expert system based configuration of VSAM files

    Publication Year: 1987, Page(s):150 - 156
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1939 KB)

    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 containin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A regression approach to performance analysis for the Differential File Architecture

    Publication Year: 1987, Page(s):157 - 164
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1873 KB)

    The Differential File Architecture (DFA) has been previously proposed as a physical database design which confines the volatility of a large database into a small, more manageable file. Although this approach affords many advantages, the use of dual files often results in two accesses to secondary storage. The response performance of the DFA is therefore a key issue, yet the only predictive perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient file structure for document retrieval in the automated office environment

    Publication Year: 1987, Page(s):165 - 172
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3777 KB)

    A file system tailored to the general needs of the office environment is proposed. This system supports large numbers of a wide variety of documents and inexact ‘fuzzy’ queries on the documents. The file system is based on a multilevel file structure; the structure combines and extends multikey extendible hashing and signature files to create a document retrieval system that is more ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic data transformation and restructuring

    Publication Year: 1987, Page(s):173 - 180
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1737 KB)

    Data restructuring is often an important part of information processing. This paper describes an automatic data restructurer which takes over, from the user, the “thinking and coding” process normally associated with writing algorithms for data restructuring. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.