By Topic

[1991] Proceedings. Seventh International Conference on Data Engineering

8-12 April 1991

Filter Results

Displaying Results 1 - 25 of 78
  • Proceedings. Seventh International Conference on Data Engineering (Cat. No.91CH2968-6)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (478 KB)
    Freely Available from IEEE
  • Wait depth limited concurrency control

    Publication Year: 1991, Page(s):92 - 101
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A new class of wait depth limited (WDL) concurrency control (CC) methods is described. The WDL policy is shown by simulations to be effective both in systems with proportionately large I/O latencies as well as in systems with large numbers of processors. WDL is also attractive in terms of implementation. In many applications little or no system modification may be required other than the CC code. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query pairs as hypertext links

    Publication Year: 1991, Page(s):456 - 463
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    A new idea is proposed for constructing object-oriented hypertext database systems: query pairs as hypertext links, where each query is defined over a collection of document objects that are classified using a class hierarchy. With this idea, users need not modify their hypertext links against the insertions, deletions and updates of document objects. Also, when a database schema (here, a class hi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge-based subsystem for a natural language interface to a database that predicts and explains query failures

    Publication Year: 1991, Page(s):80 - 87
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A practical method is presented for eliminating unnecessary database operations that often arise from poorly posed natural language queries. This subsystem consists mainly of a knowledge-base whose rules are semantic constraints of the database. The inference procedure's actions are, unlike that of similar inference engines, strictly controlled by the structure of the query. Because of this it is ... View full abstract»

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

    Publication Year: 1991, Page(s):446 - 455
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    In designing the versioning facility in Ode, a few but semantically sound and powerful concepts are introduced that allow implementation of a wide variety of paradigms. Some of the salient features of these versioning facilities are the following: (1) object versioning is orthogonal to type; (2) reference to an object can be bound statically to a specific version of the object or dynamically to wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation and evaluation of a browsing algorithm for design applications

    Publication Year: 1991, Page(s):70 - 79
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The implementation and evaluation of an extended relational database called ADAM (advanced database abstraction mechanism) are discussed. A browsing algorithm is developed for composite objects to support reuse of the objects. The algorithm takes advantage of aggregation hierarchies to select related composite objects and to order them based on the two measures, i.e. the relative difference of mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance measurement of some main memory database recovery algorithms

    Publication Year: 1991, Page(s):436 - 443
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The performance of two main-memory database system (MDBS) algorithms is studied. M.H. Eich's (Proc. of the Fifth Int. Workshop on Database Machines., Oct. 1987) and T.J. Lehman's (Ph. D. Thesis, Univ. of Wisconsin-Madison, Aug 1986) algorithms are selected for this study. The investigation indicates that the shadow approach, as used by Eich, has some advantages over the update in-place strategy of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data sharing in a large heterogeneous environment

    Publication Year: 1991, Page(s):305 - 313
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The issues involved in sharing information among a large collection of independent databases is explored. Some of the distinguishing features that characterize such large-scale environments (such as size, autonomy, and heterogeneity) are discussed. A multistep information sharing process for those systems is outlined and an architecture supporting that exchange is presented. A detailed description... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Meta-reasoning: An incremental compilation approach

    Publication Year: 1991, Page(s):140 - 149
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    An incremental compilation approach to meta-reasoning is presented together with a method to update dynamically changing knowledge bases. The compilation process translates meta-level specification of facts and hypotheses into sentences of clausal logic. It then incrementally computes inconsistent sets of instances of hypotheses and records potential crucial literals. The extra information compute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive manipulation of object-oriented views

    Publication Year: 1991, Page(s):60 - 69
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    An approach to providing view support in object-oriented (O2 ) databases is presented. The approach uses what is called a hyper-view and combines results from research on database design and man-machine interfaces. A mechanism that allows interacting with databases through hyper-views and built on top of the O2 system is described. The approach is based on conciliating stored... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using type inference and induced rules to provide intensional answers

    Publication Year: 1991, Page(s):396 - 403
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A new approach is presented that uses knowledge induction and type inference to provide intensional answers. Machine learning techniques are used to analyze database contents and to induce a set of if-then rules. Type inference which is based on forward inference and backward inference is developed that uses database type hierarchies to derive the intensional answers for a query. It is shown that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divide and conquer: A basis for augmenting a conventional query optimizer with multiple query-processing capabilities

    Publication Year: 1991, Page(s):482 - 490
    Cited by:  Papers (6)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    An approach for adding a new component without radically changing an existing single-query optimizer (SQO) is proposed. A new way of organizing the strategy space of a set of queries being optimized is proposed for developing a multiple-query optimizer (MQO) architecture. The architecture relies on the generation of two strategy spaces using subsumption and equivalence of subexpressions at the log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query processing algorithms for temporal intersection joins

    Publication Year: 1991, Page(s):336 - 344
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Intersection join processing in temporal relational databases is investigated. An analysis is presented of the characteristics and processing requirements of three types of intersection join operators: the time-join temporal equijoin on the surrogate, and temporal equijoin on the temporal attribute. Based on the physical organization of the database and on the semantics of the operators, several a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance limits of two-phase locking

    Publication Year: 1991, Page(s):426 - 435
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    A novel mean-value analysis method for two-phase locking (2PL) is presented which extends previous work to the important case of variable size transactions. The system performance expressed as the fraction of blocked transactions (β) is determined by solving a cubic equation in β whose coefficients are functions of a single parameter (α), which determines the degree of lock content... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Atomic commitment for integrated database systems

    Publication Year: 1991, Page(s):296 - 304
    Cited by:  Papers (14)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    A systematic discussion of atomic commitment for heterogeneous database systems is presented. An analysis is given of two alternative protocols for atomic commitment: commitment of local transaction after or before the global commit or abort decision is made. The impact of the protocols on recovery and concurrency control is shown. Atomicity, consistency, isolation, and durability properties are a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental restart [database management]

    Publication Year: 1991, Page(s):640 - 648
    Cited by:  Papers (1)  |  Patents (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    A page-based incremental restart algorithm is proposed that enables resuming transaction processing immediately after recovering from a crash. Data items are recovered individually and according to the demands of the post-crash transactions. The support that such an algorithm needs in terms of nonvolatile RAM and efficient log retrieval methods is outlined. It is discussed how to construct high-le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locking granularity in multiprocessor database systems

    Publication Year: 1991, Page(s):268 - 277
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The effects of locking granularity in a shared-nothing multiprocessor database system are analyzed. The analysis shows that when the system is lightly loaded fine granularity (one lock per database entity) is needed when transactions access the database randomly. However, when transactions access the database sequentially, coarse granularity is desired. When the system is heavily loaded, coarse gr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for benchmarking distributed database management systems

    Publication Year: 1991, Page(s):612 - 619
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    A methodology for benchmarking distributed database management systems is proposed. A distributed environment is characterized in terms of the communication costs incurred in data movement between sites, the number of nodes that participate in processing a query and the data distribution scheme used in the network. These three major characteristics form a basis for eight query types that capture t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Natural joins in relational databases with indefinite and maybe information

    Publication Year: 1991, Page(s):132 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Natural joins are defined, in a semantically correct way, on data structures, called I-tables, of an extended relational database model with indefinite and maybe information. An algorithm for computing natural joins under the extended model is proposed which reduces the number of pair-up operations and block accesses to a linear order of complexity with respect to the size of I-tables. Pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining beneficial semijoins for a join sequence in distributed query processing

    Publication Year: 1991, Page(s):50 - 58
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The problem of combining join and semijoin reducers for distributed query processing is studied. An approach, of interleaving a join sequence with beneficial semijoins is proposed. A join sequence is mapped into a join sequence tree that provides an efficient way to identify for each semijoin its correlated semijoins as well as its reducible relations under the join sequence. In light of these pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling a rule database program into a C/SQL application

    Publication Year: 1991, Page(s):388 - 395
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The design and the implementation of a rule database language (RDL) compiler is presented. In this design, the RDL/C language supports both declarative programming based on a production rule language and C-based procedural programming. The data model is relational. This implies that all rule programs can be solved without having to download data from the database management system (DBMS) into some... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design overview of the Aditi deductive database system

    Publication Year: 1991, Page(s):240 - 247
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    An overview of the structure of Aditi, a disk-based deductive database system under continuous development at the University of Melbourne, is presented. The aim of the project is to find out what implementation methods and optimization techniques would make deductive databases competitive with current commercial relational databases. The structure of the Aditi prototype is based on a variant of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-oriented query processor that produces monotonically improving approximate answers

    Publication Year: 1991, Page(s):472 - 481
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    An object-oriented query processor is described that makes approximate answers available if there is not enough time to product an exact answer or if part of the database is unavailable. The accuracy of the approximate result produced improves monotonically with the amount of data retrieved to produce the result. The query-processing algorithm is based on an approximate relational data model and w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient semantic query optimization algorithm

    Publication Year: 1991, Page(s):326 - 335
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    An efficient semantic query optimization algorithm is proposed, in which all possible transformations are tentatively applied to the query. Instead of physically modifying the query, the transformation process classifies the predicates into imperative, optional or redundant. At the end of the transformation process, all the imperative predicates are retained while the redundant predicates are elim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of functional disk system (FDS-R2)

    Publication Year: 1991, Page(s):416 - 425
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The performance of the functional disk system with relational database engine (FDS-R2) is evaluated in detail in view of two points. First, the performance evaluation of the combined hash algorithm on FDS-R2 is reported using the projection and aggregation operations in addition to the join operation and they are analyzed in order to verify the effectiveness of the proposed processing method, Seco... View full abstract»

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