[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
  • An index implementation supporting fast recovery for the POSTGRES storage system

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

    The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but improves performance by integrating shadow meta-data with index meta-data. The other algorithm uses a two-phase page reorganization scheme to reduce the space overhead caused by shadow paging. Althou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient database storage structure for large dynamic objects

    Publication Year: 1992, Page(s):301 - 308
    Cited by:  Papers (9)  |  Patents (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    The author presents storage structures and algorithms for the efficient manipulation of general-purpose large unstructured objects in a database system. The large object is stored in a sequence of variable-size segments, each of which consists of a large number of physically contiguous disk blocks. A tree structure indexes byte positions within the object. Disk space management is based on the bin... 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.
  • Data hiding and security in object-oriented databases

    Publication Year: 1992, Page(s):338 - 347
    Cited by:  Papers (3)  |  Patents (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Hiding is an important characteristic of the object-oriented paradigm. The author shows how hiding can be exploited to support data security and privacy. The model is based on a single type of authorization, that is, the authorization of a user to execute a method on a given object. The rationale of the authorization model is described. A formal definition of the model is presented, and the algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparison of distributed deadlock detection algorithms

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

    A performance evaluation study of two proposed distributed deadlock detection algorithms, the central controller and distributed deadlock detection algorithms, is described. The author examines and reports the magnitude by which these algorithms provide an increase in the throughput, and an increase in the number of blocked, restarted transactions. A performance evaluation model is presented for a... 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 (10)  |  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.
  • Query optimization for KBMSs: temporal, syntactic and semantic transformations

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

    The authors describe a framework for query optimization for knowledge base management systems (KBMSs) based on the knowledge representation language Telos. The framework involves temporal and syntactic simplifications and semantic modification of the queries. Temporal simplification attempts to select parts of a knowledge base that are relevant to a query from a temporal viewpoint. Syntactic simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented modeling and design of coupled knowledge-base/database systems

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

    The objective is to develop a structured object-oriented modeling and design methodology for coupled knowledge-base/database (KB/DB) systems by exploring the useful principles and features of object-oriented modeling and software development techniques. The methodology uses a synthesize object-oriented entity-relationship model for representing the knowledge and the embedded data semantics involve... 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.
  • Mapping a version model to a complex-object data model

    Publication Year: 1992, Page(s):348 - 357
    Cited by:  Papers (8)  |  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.
  • M(DM): an open framework for interoperation of multimodel multidatabase systems

    Publication Year: 1992, Page(s):218 - 227
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The authors present M(DM), an extensible metalevel system in which the syntax and the semantics of data models, schemas, and databases can be uniformly represented. M(DM) consists primarily of a set of metatypes that capture and express data-model constructs in second-order logic: a data model is represented as a collection of M(DM) metatypes. To achieve extensibility, M(DM)'s metatypes are organi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A time-based distributed optimistic recovery and concurrency control mechanism

    Publication Year: 1992, Page(s):498 - 505
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The authors describe a time-based approach to distributed concurrency control and recovery that alleviates the high cost of optimistic methods by combining the solutions to concurrency control, recovery management, and localized control into a single flexible yet powerful and efficient mechanism. The approach adapts the object-oriented Timewarp mechanism to handle competing processes rather than t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for executing join on cube-connected multicomputers

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

    The authors present parallel processing of database joins in a hypercube system based on a dynamic and order-preserving data partitioning storage organization referred to as DYOP. A DYOP file system corresponds to a grid-based file organization. A grid-based file is any file organization where the n-field (attribute) records of a file are represented as points in an n-dimensional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The implementation and evaluation of integrity maintenance rules in an object-oriented database

    Publication Year: 1992, Page(s):565 - 572
    Cited by:  Papers (10)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The authors describe an approach to the declarative representation of integrity constraints in an object-oriented database and the use of integrity maintenance rules for the active maintenance of constraints. A semantic data model is used to automatically generate class definitions and state-altering database operations with constraints represented as objects in the database. Integrity maintenance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ESQL2: an object-oriented SQL with F-Logic semantics

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

    ESQL2 is an SQL2 upward-compatible database language that integrates the essential concepts of relational, object-oriented, and deductive databases. ESQL2's salient features are a rich and extendible type system based on abstract data types (ADTs) implemented in various programming languages, complex objects with object sharing by combining generic ADTs and object identity, the capability of query... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using coding to support data resiliency in distributed systems

    Publication Year: 1992, Page(s):192 - 199
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A scheme for maintaining replicated files is suggested. The authors describe how the coding scheme suggested by M.O. Rabin (1987, 1989) can be used to store replicated data and how the voting algorithm and the quorum requirements change to manage this replication. It is shown that the disk storage space required to achieve a given availability is significantly lower than that for the conventional ... 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 (20)
    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.
  • 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.
  • 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.
  • 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.
  • How to extend a conventional optimizer to handle one- and two-sided outerjoin

    Publication Year: 1992, Page(s):402 - 409
    Cited by:  Papers (5)  |  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.
  • 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.
  • 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.
  • 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.