[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
  • 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 GRACE hash join on shared-everything multiprocessor: implementation and performance evaluation on symmetry S81

    Publication Year: 1992, Page(s):256 - 264
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (616 KB)

    The authors implemented a parallel hash join algorithm on a Symmetry S81 shared-everything multiprocessor environment and evaluated the performance. They evaluated the input/output (I/O) performance on a multiple-disk environment, and showed linear performance increase of up to eight disks. The performance of the implemented join operation was examined on each phase, and the effect of parallel pro... 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 (916 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.
  • Concurrent file reorganization for record clustering: a performance study

    Publication Year: 1992, Page(s):265 - 272
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    The authors presents performance analysis of a concurrent file reorganization algorithm. They examined the effect of buffer size, degree of reorganization, and write probability of transactions on system throughput. The problem of file reorganization considered involves altering the placement of records on pages on a secondary storage device. This reorganization must be done in-place. The approach... 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.
  • 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.
  • 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.
  • 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 (712 KB)

    The fraction of blocked transactions (β) 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.
  • Prefetching with multiple disks for external mergesort: simulation and analysis

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

    The authors present a simulation study of multiple disk systems to improve the input/output (I/O) performance of multiway merging. With the increase in the size of main memory in computer systems, multiple disks and aggressive prefetching can be used to significantly reduce I/O time. Two prefetching strategies-intra-run and inter-run-for external merging using multiple disks were studied. Their pe... 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.
  • 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.
  • Processing hierarchical queries in heterogeneous environment

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

    The authors investigate principles of translating relational queries to hierarchical queries. Instead of using a specific hierarchical database system they abstract a generic hierarchical database system (GHDBS) which has properties common to database systems whose schema contain hierarchical structures. Principles of query translation with GHDBS as the receiving database system are developed. Rul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient object-based algorithm for spatial searching, insertion and deletion

    Publication Year: 1992, Page(s):40 - 47
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (540 KB)

    The authors propose an object-based index structure for manipulating spatial objects with non-zero size. They introduce the main ideas of the proposed index structure. A detailed description of the algorithms is given for searching, insertion, and deletion in a database system with a high frequency of retrievals and a low frequency of insertions and deletions. The algorithms are then described for... 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 (756 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+ -tree, that is suitable for implementing a time index for append-only temporal databases. The storage model uses a combinati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A periodic deadlock detection and resolution algorithm with a new graph model for sequential transaction processing

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

    The authors address the deadlock problem in sequential transaction processing where the strict two-phase locking and the multiple granularity locking protocol with five lock modes are used. The scheduling policy honors lock requests in a first-in-first-out basis except for lock conversions. As a basic tool, a direct graph model called the holder/wire-transaction waited-by graph (H/W-TWBG) is intro... 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 (27)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (696 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 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 (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.
  • Distance-associated join indices for spatial range search

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

    A distance-associated join index structure is developed to speed up spatial queries, especially for spatial range queries. Three distance-associated join indexing mechanisms: basic, ring-structured, and hierarchical, are presented and studied. The analysis and performance study shows that distance-associated spatial join indices substantially improve the performance of spatial queries, and differe... 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 (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (724 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.
  • Object allocation in distributed systems with virtual replication

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

    The authors investigate the problem of object allocation in a distributed environment with virtually replicated data. The traditional approach to improving data availability in a distributed system is to replicate data. A high degree of replication, however, imposes a serious burden to the system when updates are performed. Data inference can be used to reduce the degree of replication in the syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring semantics in aggregation hierarchies for object-oriented databases

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

    An extended object-oriented model for exploring semantics in aggregation hierarchies is presented. The extension is mainly based on a general distinction between aggregation references and association references and a support for type inheritance in both specialization and aggregation abstractions. The author formally describes notions of aggregation reference and aggregation hierarchy and introdu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database recovery using redundant disk arrays

    Publication Year: 1992, Page(s):176 - 183
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    The authors propose a method for using redundant disk arrays to support rapid recovery from system crashes and transaction aborts in addition to their role in providing media failure recovery. A twin-page scheme is used to store the parity information in the array, making it possible to keep the old version of the parity along with the new version. The old version of the parity is used to undo upd... 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.
  • On interoperability for KBMS applications-the horizontal integration task

    Publication Year: 1992, Page(s):158 - 165
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (792 KB)

    Interoperability of programming languages with persistency requires new concepts to make a single knowledge base management system (KBMS), a custom-tailored tool for applications of various programming languages and of different programming paradigms. The authors describe a method for the horizontal integration of KBMS applications from different programming languages. They used the commonly known... View full abstract»

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