[1992] Eighth International Conference on Data Engineering

2-3 Feb. 1992

Filter Results

Displaying Results 1 - 25 of 72
  • 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 (654 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.
  • Logical database design with inclusion dependencies

    Publication Year: 1992, Page(s):642 - 649
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 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.
  • Maintenance of materialized views of sampling queries

    Publication Year: 1992, Page(s):632 - 641
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The authors discuss materialized views of random sampling queries of a relational database. They show how to maintain such views in the presence of insertions, deletions, and updates of the base relations. The basic idea is to reuse the maximal portion of the original sample when constructing the updated sample. The results are based on a synthesis of view update techniques and sampling algorithms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge mining by imprecise querying: a classification-based approach

    Publication Year: 1992, Page(s):622 - 630
    Cited by:  Papers (25)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (674 KB)

    Knowledge mining is the process of discovering knowledge that is hitherto unknown. An approach to knowledge mining by imprecise querying that utilizes conceptual clustering techniques is presented. The query processor has both a deductive and an inductive component. The deductive component finds precise matches in the traditional sense, and the inductive component identifies ways in which imprecis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imprecise and uncertain information in databases: an evidential approach

    Publication Year: 1992, Page(s):614 - 621
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB)

    A novel approach for representing imprecise and uncertain data and evaluating queries in the framework of an extended relational database model based on the Dempster-Shafer theory of evidence is proposed. Because of the ability to combine evidences from different sources, the semantics of the update operation of imprecise or uncertain data is reconsidered. By including an undefined value in a doma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exploratory study of ad hoc query languages to databases

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

    The authors describe an exploratory study performed to compare three different interface styles for ad hoc query to a database. Subjects with wide-ranging computer experience performed queries of varying difficulty using either an artificial, a graphical, or a natural language interface. All three interfaces were commercial products. The study revealed strengths and weaknesses of each interface an... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 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.
  • A uniform model for temporal object-oriented databases

    Publication Year: 1992, Page(s):584 - 593
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (842 KB)

    A temporal object-oriented model and query language that supports the modeling and manipulation of complex temporal or versioned objects is developed. The authors show that the approach not only provides a richer model than the relational for capturing the semantics of complex temporal objects, but also requires no special constructs in the query language. Consequently, the retrieval of temporal a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioning of time index for optical disks

    Publication Year: 1992, Page(s):574 - 583
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (750 KB)

    The authors present a storage model for temporal databases that accommodates large amounts of temporal data. The model supports efficient search for object versions based on temporal conditions, using a time index. They define an access structure, the monotonic B/sup +/-tree, that is suitable for implementing a time index for append-only temporal databases. The storage model uses a combination of ... 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 (736 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.
  • 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 (638 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 run-time execution model for referential integrity maintenance

    Publication Year: 1992, Page(s):548 - 556
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (771 KB)

    The author explores anomalous situations which can arise during the processing of database operations on schemas which include referential integrity constraints. A more declarative (as opposed to operational) approach to referential integrity is proposed. He reviews some of the contributions which ANSI Technical Committee X3H2 on Database has made in this area, and which have been reflected in the... 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 (913 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 integrated real-time locking protocol

    Publication Year: 1992, Page(s):527 - 534
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 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.
  • Thrashing in two-phase locking revisited

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

    The fraction of blocked transactions ( beta ) and the conflict rate, the ratio of locks held by all and active transactions, have been proposed as parameters to be monitored for load control. This study investigates the robustness of these parameters in the case of transactions requesting a variable number of locks and different processing times for transaction steps. Simulation results show that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divergence control for epsilon-serializability

    Publication Year: 1992, Page(s):506 - 515
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (909 KB)

    The authors present divergence control methods for epsilon-serializability (ESR) in centralized databases. ESR alleviates the strictness of serializability (SR) in transaction processing by allowing for limited inconsistency. The bounded inconsistency is automatically maintained by divergence control (DC) methods in a way similar to the manner in which SR is maintained by concurrency control mecha... 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 (576 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.
  • Quorum-oriented multicast protocols for data replication

    Publication Year: 1992, Page(s):490 - 497
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (749 KB)

    A family of communication protocols, called quorum multicasts, is presented that provides efficient communication services for widely replicated data. Quorum multicasts are similar to ordinary multicasts, which deliver a message to a set of destinations. The protocols extend this model by allowing delivery to a subset of the destinations, selected according to distance or expected data currency. 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 (763 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.
  • 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 (850 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.
  • Effect of system dynamics on coupling architectures for transaction processing

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

    The authors present a comparison on the resilience of the performance to system dynamics of three multinode architectures for transaction processing. They describe the different architectures considered. The issues of system dynamics are addressed. The performance model is outlined. Three specific scenarios are considered: (1) a sudden load surge in one of the transaction classes, (2) varying tran... 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 (385 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.
  • A keying method for a nested relational database management system

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

    The authors discuss the keying methods that are proposed in the literature and introduce the external keying method which aims to restore the structure of tuples that is lost by unnesting a relation valued attribute in a nested relation. As opposed to the previous keying methods, it does not store the keying information within the relation instance which can be manipulated by relational algebra. I... 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 (881 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.
  • Deleted tuples are useful when updating through universal scheme interfaces

    Publication Year: 1992, Page(s):420 - 427
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (650 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.