Scheduled System Maintenance
On Tuesday, February 28, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (18:00-22:00 UTC).
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing

2-3 Feb. 1992

Filter Results

Displaying Results 1 - 25 of 38
  • Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing (Cat. No.92TH0417-6)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • ACTA: a comprehensive transaction framework for extended transactions

    Publication Year: 1992
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Summary form only given. Although powerful, the transaction model adopted in traditional database systems is found lacking in functionality and performance when used for new applications, such as CAD/CAM, and design environments. Various extensions to traditional transaction model have been proposed to address these drawbacks. In order to analyze these ad hoc extensions and in search for a good im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to support method invocations in object-oriented queries

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

    An indexing technique is presented supporting an efficient evaluation of query predicates on methods. The technique is based on the precomputation of method results. The precomputed results are stored in an index that associates with a result v the list of object identifiers for which the method execution returns v. The evaluation of a predicate on the results of a method simply requires an index ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time transaction processing: pessimistic, optimistic, and hybrid approaches

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    A real-time database system (RTDBS) differs from a conventional database system because in addition to the consistency constraints of the database, timing constraints of individual transaction need to be satisfied. To provide real-time response for queries and update while maintaining the consistency of data, real-time concurrency control should involve efficient integration of the ideas from both... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transaction sequencing problems for maximal parallelism

    Publication Year: 1992, Page(s):215 - 216
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong recoverability in multidatabase systems

    Publication Year: 1992, Page(s):170 - 175
    Cited by:  Papers (11)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    A multidatabase system (MDBS) consists of a number of multiple autonomous database management systems (DBMSs) in which global transactions are executed under the control of the MDBS, and local transactions are executed under the control of a local DBMS. Each local DBMS ensures local serializability. The function of the MDBS is to ensure global serializability. The major difficulty in ensuring glob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query performance evaluation of a relational DBMS

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    This paper presents a study of query performance in Oracle RDBMS. The test results show that for low selectivity selection queries, indexes are of no help. It is also shown that when joining large parts of tables, sort-merge join performs better than indexed join View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On global query optimization in multidatabase systems

    Publication Year: 1992
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Multidatabase management systems (MDBMS) enable data sharing among heterogeneous local databases (component databases) and thus provide interoperability required by diverse applications. In multidatabase systems, user requests data from the multidatabase by posing non-procedural queries. For a query involving more than one database, a global optimization should be performed to achieve good overall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic approach to query processing in heterogeneous database systems

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

    In heterogeneous database systems, partial values can be used to resolve the interoperability problems, including domain mismatch, inconsistent data, and missing data. Performing operations on partial values may produce maybe tuples in the query result which cannot be compared. Thus, users have no way to distinguish which maybe tuple is the most possible answer. The concept of partial values is ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for handling skew in parallel task scheduling

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

    Presents two new algorithms, the LPT-MinHeight (LPTMH) algorithm and the Split-LPT (SLPT) algorithm, for handling skew in parallel task scheduling. Both algorithms are based on the LPT (Largest P rocessing Time first) algorithm. The worst case imbalance for the LPTMH algorithm never exceeds 1/(e-1)⩽0.582, while the worst case imbalance for the SLPT algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An index structure for parallel database processing

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

    In relational database management systems, indexing is a popular and powerful technique to accelerate database processing. There are two main research issues on indexing; index structures and access controls. The studies of index structures, which are usually trees or hashing, aim at lower access cost and smaller storage overhead. On the other hand, the studies of access controls focus on concurre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An event-state approach to handling temporal queries in an extended relational database system

    Publication Year: 1992, Page(s):218 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Many database applications such as office information systems, computer aided design and manufacturing require temporal support. The requirement for storing all the historical information has resulted in performance and storage problems. This paper presents and illustrates an event-state approach to effectively and efficiently store and retrieve temporal data. This model demonstrates that by using... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaxing serializability in multidatabase systems

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

    The concept of serializability has been traditionally accepted as the standard notion of correctness in database systems. However, in a multidatabase system (MDBS), ensuring serializability is a difficult task mainly due to the desire of preserving the autonomy of the participating local database systems. The authors introduce a new notion of correctness, RS-correctness, that is based on preservin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deadlock checkpointing scheme for multidatabase systems

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

    A multidatabase system (MDBS) is a software package that integrates a number of pre-existing, autonomous and heterogeneous local database systems (LDBS). Deadlock detection and resolution in MDBS is much more difficult than in traditional distributed database systems due to the autonomy requirement which implies that LDBSs cannot exchange any control information. The authors present an efficient p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IPL: the InterBase Parallel Language

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

    IPL is a declarative distributed language designed to support application level programming in the InterBase project. This paper presents the IPL language and shows how it support flexible transactions, mixed transactions, time-constrained transactions and other features. Besides its transaction-oriented features, IPL can be used as a general purpose distributed programming language View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication overhead of nested loop operation in multidatabase system

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    This paper summarizes some of the results from a previous paper by the author (see DTD Technical Memo HPL-DTD-91-5, HP Labs., 1991). The purpose is to characterize the interprocess communication (IPC) overhead in the context of multidatabase operations. A quantitative analysis of the cost of a distributed query is becoming increasingly important as operations across multiple databases are becoming... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In-memory databases: an industry perspective

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

    Main memory databases store all or part of the data in memory and subsequently reduce or eliminate disk access. This paper presents an architectural study of memory databases with respect to cost/performance trade-offs and applicability issues. Potential performance advantages depend primarily on whether the system is used as an online transaction processing or a decision support system. A major c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Class reference reduction in object-oriented databases

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    The authors propose a semantic query-optimizer (SQO) using semantic integrity constraints (SICs) in an object-oriented database system (OODB). SICs assert permissible or consistent database states (a database state is the stored data at a given time instance) for a database application. For example, in a payroll database, the minimum hourly rate has to be $4.35 by law. The basic idea of SQO is to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for multiple-query optimization

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

    Certain computations that may arise repeatedly during the simultaneous processing of multiple queries offer an opportunity for amortizing the processing costs. This paper classifies the types of common computations that can arise, develops methods for exploiting them, and proposes ways for detecting them. It outlines a framework developed for the optimal interleaved processing of multiple queries ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Site partitioning for distributed redundant disk arrays

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    Redundant disk arrays are used for the purpose of providing reliable storage while increasing the I/O bandwidth in high performance systems. Redundant disk arrays can also be used in a distributed setting to increase availability in the presence of temporary site failures or major disasters. The data at each site is partitioned into blocks and data blocks from different sites are grouped into a pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decomposition algorithm for distributed hash join query processing

    Publication Year: 1992, Page(s):53 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Database systems are increasing in importance as stage repositories for applications like CAD and AI. These applications demand efficient support for queries that are more complex than the common business queries that are supported well by most systems. More queries are also of an ad-hoc nature, limiting the utility of precompilation approaches. The need for fast response to make AI and CAD applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Less optimism about optimistic concurrency control

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

    This paper discusses some of the shortcomings of the optimistic concurrency control (OCC) approach in supporting all the features expected in a full-function DBMS. Surprisingly, in spite of OCC having been around for a long time and its performance having been studied in various contexts, no complete system design, let alone a full-blown implementation, exists, as far as the author knows. The prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chained declustering: load balancing and robustness to skew and failures

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

    There has been considerable research concerning the use of arrays of disks in solving I/O bottleneck problems, where high availability of data is achieved through some form of data redundancy, e.g. mirroring. This paper investigates the degree to which a dynamic load balancing disk scheduling algorithm in conjunction with chained declustering, an alternative to the classical mirroring scheme, can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding MSQL queries into a logic based transaction processing framework

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

    The processing of multidatabase transactions requires not only a powerful non procedural user language to express a query on several databases but also the possibility to specify the execution control of such queries. This paper shows how transaction control can be added to MSQL queries. A minimal set of language primitives is combined with the VPL (Vienna Parallel logic) language so that the dyna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Papyrus query processing engine

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

    This paper describes query processing in the Papyrus integrated data server. Query processing is unique in Papyrus because the underlying language is very powerful (computationally complete), performance on uni-processor systems is not sacrificed in order to support multiprocessor architectures, and queries are self-scheduling in order to support extensibility. A prototype demonstrating the feasib... View full abstract»

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