By Topic

1986 IEEE Second International Conference on Data Engineering

5-7 Feb. 1986

Filter Results

Displaying Results 1 - 25 of 86
  • [Front matter]

    Publication Year: 1986, Page(s):1 - 16
    Request permission for commercial reuse | PDF file iconPDF (3781 KB)
    Freely Available from IEEE
  • Estimating temporary files sizes in distributed realtional database systems

    Publication Year: 1986, Page(s):4 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2828 KB)

    The estimated sizes of temporary files are one of the most important statistics used by an Optimizer in generating a minimum cost processing strategy. Statistical information is the primary input to the estimation technique. The amount of statistics kept concerning the key attributes and the distribution of data values within a domain in a relation will greatly affect the accuracy of the estimates... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal granularity and degree of multiprogramming in a distributed database system

    Publication Year: 1986, Page(s):13 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4329 KB)

    The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (maximum number of transactions allowed to run concurrently) for a single-site database system (SDBS) using a locking mechanism for concurrency control have been investigated by many researchers, but the case for a distributed database system (DDBS) has not been examined. Using a simulation model, we st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The relation-partitioning approach to processing star queries in distributed databases

    Publication Year: 1986, Page(s):21 - 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2852 KB)

    In a distributed database system, query processing involves considerable amount of data transmission among different computer sites. Since communication delay is substantial, minimizing inter-site data transmissions becomes an important issue. In this paper, we propose an abstract relation-partitioning approach to the distributed query processing problem. This approach transforms a query processin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating bucket accesses: A practical approach

    Publication Year: 1986, Page(s):30 - 37
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2755 KB)

    In optimizing database queries one inevitably encounters two important estimation problems. The first problem is to estimate the number of page accesses when selecting k tuples from a relation. The other problem is to estimate the number of different equijoin values remaining after selecting k tuples from a relation. The estimated values strongly depend on how the tuples are distributed over the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The bounded disorder access method

    Publication Year: 1986, Page(s):38 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3972 KB)

    A new key associative access method, called the bounded disorder method, is described. The method uses a combination of hashing and tree indexing. The method has very good random access performance, being comparable to the best hashing methods if its small index is stored entirely in main memory. The method's advantage compared with hashing is that range searches are possible while searching only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic tree-locking protocol

    Publication Year: 1986, Page(s):49 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2770 KB)

    The tree-locking protocol proposed by Silberschatz and Kedem5 guarantees transaction schedules that are both serializable and deadlock-free. The tree-locking protocol assumes the existence of a partial order defined over all of the objects in a database. Requiring all transactions to be tree-locked with respect to this single partial order limits the degree of concurrency obtainable in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical data reduction lor manufacturing testing

    Publication Year: 1986, Page(s):58 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2640 KB)

    This paper deals with statistical reduction of the large volume of data that are generated by modern computerized testing in manufacturing environment. Two statistical algorithms have been developed to reduce dynamically, in real time, the amount of manufacturing testing, while maintaining the quality level, thus reducing the volume of data generated. In algorithm 1, homogeneous clusters of tests ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security of statistical databases compromise through attribute correlational modeling

    Publication Year: 1986, Page(s):67 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2016 KB)

    Statistical databases seek to provide accurate aggregate information to legitimate users, while protecting the confidentiality of individuals' information. This study develops, defines, and applies a statistical technique for the compromise of confidential information in a statistical database. Attribute Correlational Modeling (ACM) recognizes that the information contained in a statistical databa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information loss in the lattice model of summary tables due to cell suppression

    Publication Year: 1986, Page(s):75 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4473 KB)

    A statistical database (SDB) is a database that is used mostly to provide simple summary statistics (e.g., SUM, COUNT, MAX, MEDIAN, etc.) about individuals in the database and that supports statistical data analysis. When SDB users infer protected information in the SDB from responses to queries, we say that the SDB is compromised. Summary tables are tabular representations of summary data. For a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive techniques for distributed query optimization

    Publication Year: 1986, Page(s):86 - 93
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4383 KB)

    We propose new adaptive techniques for distributed query optimization. These techniques are divided into two groups: the ones that improve efficiency of query execution (directly) and the ones that improve cost estimations for query execution strategies. Some of the proposed techniques utilize semantic information and knowledge acquisition to adapt to the environment. The latter, in contrast to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed query processing strategy using decomposition, pipelining and intermediate result sharing techniques

    Publication Year: 1986, Page(s):94 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2808 KB)

    The future data systems are likely to be integrated data networks (IDNs) consisting of a mix of general-purpose computer systems and special-purpose functional processors that are produced by different vendors and have quite different computational power and database management capabilities. Data stored in these networks need to be integrated and shared by the network users. It is important to hav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic attributes in the multidatabase system MRPSM

    Publication Year: 1986, Page(s):103 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3512 KB)

    Dynamic attributes are attributes that are instantly defined in a query and unknown to the database or view schemes. This concept provides new possibilities, especially for multidatabase users. We first discuss the general interest of the concept. Then we present the implementation of the corresponding functionality within the prototype relational multidatabase system MRDSM. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of ordered minimal perfect hashing functions

    Publication Year: 1986, Page(s):112 - 115
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2076 KB)

    In this paper, we shall give an ordered minimal perfect hashing scheme for letter oriented keys. We applied our method successfully to four practical key sets like the set of animals' identifiers in English, the set of C's keywords, the set of frequently occurring English words and the set of PASCAL'S reserved words. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic file organizations for partial match retrieval based on linear hashing

    Publication Year: 1986, Page(s):116 - 123
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3329 KB)

    Two new file organizations based on Linear Hashing are proposed for partial match retrieval. The first organization introduces a load-balancing scheme whereby overflow records are stored temporarily in other primary buckets so that the allocation of overflow buckets are deferred. The second organization defers the physical splitting of underflow buckets, so that the records belonging to underflow ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of multi-key extendible hashing as an access method for a relational DBMS

    Publication Year: 1986, Page(s):124 - 131
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3033 KB)

    Extendible hashing addressing schemes have been introduced to resolve collisions and improve storage utilization by dynamically adjusting the address space and modifying the hash function. Recently, generalizations of extendible hashing have been proposed which allow multi-attribute keys to be used for improved partial-match query performance. In this paper the design and implementation of a multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge-based approach to design a portable natural language interface to database systems

    Publication Year: 1986, Page(s):134 - 143
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3288 KB)

    This paper presents a knowledge-based approach to design a portable natural language interface to database systems, called KID (Knowledge-based Interface to Database systems). To free the user from the need to know about query languages and databases, and to allow the user to access databases in natural language, KID incorporates a knowledge base called the world model (WM), which contains a domai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Report generation facility, a high-level interface for coherent access to heterogeneous database systems

    Publication Year: 1986, Page(s):144 - 150
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2768 KB)

    The Report Generation Facility is a high-level interface designed and implemented to support coherent access of data stored in a number of stand-alone, independent, database systems served by it. Specifically, the Report Generation Facility provides a menu which allows a user to request one or more standard reports provided by the individual database systems and the Report Generation Facility, or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SNAP: A graphics-based schema manager

    Publication Year: 1986, Page(s):151 - 164
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4395 KB)

    The SNAP system provides interactive, graphics-based access to Schemas of the IFO database model, supporting the varied activities of schema design, schema browsing, and the specification of selection-type queries. The system uses a novel representation for Schemas and includes a variety of abstraction mechanisms which encourage users to design and view Schemas in a modular fashion. It also suppor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed office by example (D-OBE)

    Publication Year: 1986, Page(s):166 - 174
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3487 KB)

    The D-OBE (Distributed Office By Example) language for distributed office information systems is introduced. D-OBE is an extension of the OBE (Office By Example) and QBE (Query By Example) languages. A major problem was the design of a language simple enough for office workers and yet sufficiently powerful to handle the many facilities of a distributed office system. It is suggested that D-OBE ach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regeneration of replicated objects: A technique and its Eden implementation

    Publication Year: 1986, Page(s):175 - 187
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4808 KB)

    We have designed and implemented a replicated directory system based on a method called Regeneration. The directory system allows selection of arbitrary objects to be replicated, choice of the number of replicas for each object, and placement of the copies on machines with independent failure modes. Copies may become inaccessible due to node crashes, but as long as a single copy survives, the repl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load control and load balancing in a shared database management system

    Publication Year: 1986, Page(s):188 - 197
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3025 KB)

    In shared database management systems, there is a need for dynamically setting a large number of operational parameters, like transaction routing tables, assignment of central resources, multiprogramming level, etc. It is shown that static techniques as they are applied in current centralized DBMSs are inadequate for exploiting the performance potential of a shared DBMS. We therefore plead for usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation algorithm for the physical access path selection in the CODASYL environment

    Publication Year: 1986, Page(s):200 - 207
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2570 KB)

    A heuristic algorithm for the selection of an optimal access path configuration for CODASYL databases is presented. This algorithm is based on the idea of extending index selection techniques proposed for relational systems to COD ASYL systems. The proposed approach has the worth effacing the physical design problem in a unified way; moreover, it allows for covering a large spectrum of physical de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of update merging on reliable storage performance

    Publication Year: 1986, Page(s):208 - 213
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2929 KB)

    Performance of a reliable storage subsystem for a centralized database system was studied by simulation. The reliable storage subsystem studied consists of three redundant disk units that are updated one at a time from a consistent database state to another consistent database state. Thus, even if a central processor and/or one disk unit fail simultaneously, at least one disk unit will contain a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffering schemes for permanent data

    Publication Year: 1986, Page(s):214 - 221
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3544 KB)

    The availability of larger RAM spaces for DBMSs provides interesting opportunities for performance enhancements, especially in buffer management. In this paper we propose and compare two alternative strategies for the buffer management of permanent data (i.e., the data committed by transactions) called block buffering and attribute buffering. These strategies use statistics to capture the changing... View full abstract»

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