By Topic

[1992] Eighth International Conference on Data Engineering

2-3 Feb. 1992

Filter Results

Displaying Results 1 - 25 of 72
  • Eighth International Conference on Data Engineering (Cat. No.92CH3097-3)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (755 KB)
    Freely Available from IEEE
  • How to extend a conventional optimizer to handle one- and two-sided outerjoin

    Publication Year: 1992, Page(s):402 - 409
    Cited by:  Papers (4)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The authors provide a nearly complete theory for reordering join/outerjoin queries. The theory is used to describe modular extensions that strengthen a conventional optimizer to handle nearly all select/project/join/outerjoin queries. Unlike previous work, these results are not limited to queries possessing a nice structure, or queries that are nicely represented in relational calculus. The theore... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical database design with inclusion dependencies

    Publication Year: 1992, Page(s):642 - 649
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Classical data dependencies are oblivious to important constraints which may exist between sets of attributes occurring in different relation schemes. The authors study how inclusion dependencies can be used to model these constraints, leading to the design of better database schemes. A normal form called the inclusion normal form (IN-NF) is proposed. Unlike classical normal forms, the IN-NF chara... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing real-time, non-aggregate queries with time-constraints in CASE-DB

    Publication Year: 1992, Page(s):410 - 417
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The problem of time-constrained query evaluation in a single-user database management system (DBMS) is considered. CASE-DB is a real-time, single user, relational prototype DBMS that uses the relational algebra as its query language. Given a nonaggregate query and a fragment chain for each input relation of the query. CASE-DB uses iterative query evaluation techniques to obtain a response first to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hot-spot based composition algorithm

    Publication Year: 1992, Page(s):48 - 55
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A composition requires three operations: join, project, and duplicate elimination. A hot-spot composition algorithm is proposed in an attempt to achieve savings on both join and external sort operations. The proposed algorithm reduces the effort of performing the join operation by using a novel hot-spot technique. Several experiments have been conducted, and it is shown that the hot-spot compositi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research directions in image database management

    Publication Year: 1992, Page(s):146 - 148
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    This analysis is a panel discussion. There are many problems in the field of image database management. The object-oriented paradigm has been and continues to be a great impetus to this work. The semantics of images is essentially what they contain, and unless there is an effective method to identify their contents and index them on that basis, the database will degenerate to a collection of patte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An abstraction mechanism for modeling generation

    Publication Year: 1992, Page(s):650 - 658
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    An abstraction mechanism for modeling the generation of entities from other entities is presented. It is shown to be useful for representing a wide range of generative processes, including those which are reversible, spontaneous, and involve multiple inputs and outputs. The mechanism is related to an earlier defined abstraction mechanism which represents the transitional behavior of existing entit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated real-time locking protocol

    Publication Year: 1992, Page(s):527 - 534
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The authors examine a priority-driven locking protocol called integrated real-time locking protocol. They show that this protocol is free of deadlock, and in addition, a high-priority transaction is not blocked by uncommitted lower protocol. They show that this protocol is free of deadlock, and in addition, a high-priority transaction is not blocked by uncommitted lower priority transactions. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deleted tuples are useful when updating through universal scheme interfaces

    Publication Year: 1992, Page(s):420 - 427
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The authors present a novel approach to database updating through universal scheme interfaces. The main contribution of the approach is the elimination of non-determinism. That is, contrary to most other approaches, inserting or deleting a tuple can always be done without having to make any choice at all. Tuples that have been deleted from the database are explicitly stored and are used subsequent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling and processor allocation for parallel execution of multijoin queries

    Publication Year: 1992, Page(s):58 - 67
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    The authors deal with two major issues to exploit inter-operator parallelism within a multijoin query: join sequence scheduling and processor allocation. For the first issue, they propose and evaluate by simulation several methods to determine the general join sequences, or the bush execution trees. Despite their simplicity, the proposed heuristics can lead to the general join sequences which sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping a version model to a complex-object data model

    Publication Year: 1992, Page(s):348 - 357
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    The authors present a version model for CAD purposes and its implementation on the basis of a complex-object database management system. The functionality of the model is illustrated with the help of a VLSI design example. In contrast to similar solutions based on the relational data model, this approach allows for a simple and efficient implementation of the version model, allowing for powerful r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prepare and commit certification for decentralized transaction management in rigorous heterogeneous multidatabases

    Publication Year: 1992, Page(s):470 - 479
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Algorithms for scheduling of distributed transactions in a heterogeneous multidatabase, in the presence of failures, are presented. The algorithms of prepare certification and commit certification protect against serialization errors called global view distortions and local view distortions. View serializable overall histories are guaranteed in the presence of most typical failures. The assumption... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • History-less checking of dynamic integrity constraints

    Publication Year: 1992, Page(s):557 - 564
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    An efficient implementation method is described for dynamic integrity constraints formulated in past temporal logic. Although the constraints can refer to past states of the database, their checking does not require that the entire database history be stored. Instead, every database state is extended with auxiliary relations that contain the historical information necessary for checking constraint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spanning tree transitive closure algorithm

    Publication Year: 1992, Page(s):2 - 11
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The authors present a transitive closure algorithm that maintains a spanning tree of successors for each node rather than a simple successor list. This spanning tree structure promotes sharing of information across multiple nodes and leads to more efficient algorithms. An effective relational implementation of the spanning tree storage structure is suggested, and it is shown how blocking can be ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extensible object-oriented database testbed

    Publication Year: 1992, Page(s):150 - 157
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The authors describe the object-oriented design and implementation of an extensible schema manager for object-oriented databases. The open class hierarchy approach has been adopted to achieve the extensibility of the implementation. In this approach. the system meta information is implemented as objects of system classes. A graphical interface for an object-oriented database scheme environment, GO... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic diagnosis of hot spots

    Publication Year: 1992, Page(s):30 - 39
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The authors present several techniques to identify, or diagnose, hot spots in a database. All of them are probabilistic in the sense that they will classify the items as hot or cold and exhibit a non-zero probability of false diagnoses. Each technique is analysed to identify the tradeoffs of time and space involved in maintaining a low probability of false diagnosis. Each of the techniques is pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed rule processing in active databases

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

    Processing rules in a distributed active database involves three design issues: how to decompose rules, how to distribute rules to sites, and how to evaluate distributed rules correctly. The authors study these three issues for complicated rules, which are complex and time-consuming to evaluate. They propose a relational operator, AND, and the associated algebraic manipulations of this operator to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A declarative approach to active databases

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

    A general description is provided of the field of active databases, focusing on the main problems yet to be solved. The author suggests that deductive databases may contribute to the understanding of some of these problems. Classes of applications that can be specified in a declarative manner are indicated. Important classes of active database applications can have a declarative interface supporti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On mixing queries and transactions via multiversion locking

    Publication Year: 1992, Page(s):535 - 545
    Cited by:  Papers (28)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    The authors discuss a novel approach to multiversion concurrency control that allows high-performance transaction systems to support long-running queries. The approach extends the multiversion locking algorithm developed by Computer Corporation of America by using record-level versioning and reserving a portion of each data page for caching prior versions that are potentially needed for the serial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance comparison of the Rete and TREAT algorithms for testing database rule conditions

    Publication Year: 1992, Page(s):88 - 97
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The authors present the results of a simulation comparing the performance of the two most widely used production rule condition testing algorithms, Rete and TREAT, in the context of a database rule system. The results show that TREAT almost always outperforms Rete. TREAT requires less storage than Rete, and is less sensitive to optimization decisions than Rete. Based on these results, it is conclu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relation merging technique for relational databases

    Publication Year: 1992, Page(s):428 - 437
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    A merging technique for relational schemas consisting of relation-schemes, key dependencies, referential integrity constraints, and null constraints is presented. The author examines the conditions required for using this technique with relational database management systems that provide different mechanisms for maintaining null and referential integrity constraints. For relational schemas develop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design and implementation of a parallel join algorithm for nested relations on shared-memory multiprocessors

    Publication Year: 1992, Page(s):68 - 77
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    The authors examine the problem of performing a join involving nested relations in a parallel, shared-everything environment. First they show the difference between joining flat relations and joining nested relations, and then develop a parallel hash-based join algorithm, called the partitioned nested hashed-loops algorithm. Both input/output (I/O) and CPU parallelism are addressed. The implementa... View full abstract»

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

    Publication Year: 1992, Page(s):358 - 365
    Cited by:  Papers (4)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The purpose of versioning is to reconstruct any past state of an object class. The authors show that access to any past version is possible in almost constant time, while the space used is only linear to the number of changes occurring in the class evolution. As a result, versioning with fast reconstruction can be supported in an object-oriented environment without using excessive space requiremen... View full abstract»

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

    Publication Year: 1992, Page(s):594 - 603
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The authors explore a variety of temporal relations with specialized relationships between transaction and valid time. An example is a retroactive temporal event relation, where the event must have occurred before it was stored, i.e., the valid time-stamp is restricted to be less than the transaction time-stamp. The authors discuss many useful restrictions, defining a large number of specialized t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transactions in distributed shared memory systems

    Publication Year: 1992, Page(s):480 - 487
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The authors propose a distributed shared memory model based on a paged segmented two-level address space and an extended set of memory operations. In addition to the traditional read and write operations, the memory model includes operations which support mapping between local and global address spaces and mapping of processes to transactions. An architecture and associated algorithm are outlined ... View full abstract»

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