[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
  • 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 (73 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.
  • 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
  • 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.
  • Generalized data stream indexing and temporal query processing

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

    Presents a novel indexing technique for temporal data stream which are sorted on the effective start time attribute. The index can be exploited in processing complex temporal pattern queries (such as multi-way joins) that are qualified with snapshot operators (e.g. the `as of' operator). The advantages and limitations of the proposed scheme and a quantitative analysis of the storage requirements a... 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.
  • Autonomous transaction execution with epsilon serializability

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

    The authors study the feasibility of autonomous transaction execution in systems with asynchronous transaction processing based on epsilon serializability (ESR). The abstract correctness criteria defined by ESR are implemented by techniques such as asynchronous divergence control and asynchronous consistency restoration. Concrete application examples in a distributed environment, such as banking, ... 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.
  • 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.
  • 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.
  • Chain-based evaluation-a bridge linking recursive and nonrecursive query evaluation

    Publication Year: 1992, Page(s):132 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Many recursive query analysis techniques are qualitative in nature. This contracts sharply with relational query optimization which relies heavily on quantitative analysis. This paper shows that chain-based evaluation facilitates quantitative analysis of recursive queries based on the available chain information, database statistics and other quantitative measurements. Chain-based evaluation not o... 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.
  • 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.
  • 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.
  • An intelligent page store for concurrent transaction and query processing

    Publication Year: 1992, Page(s):12 - 19
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    An intelligent page store is proposed that provides two paths for accessing data. Update and transaction traffic are presented the current version of the data by the page store. Complex queries against the same data are presented a recent transaction consistent snapshot of the data. Periodically, new snapshots are created for access by new queries. By using an implicit versioning scheme, the page ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using PRIMA-DBMS as a testbed for parallel complex-object processing

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

    The PRIMA-DBMS approach is explained by introducing PRIMA's architecture and query processing framework. The PRIMA-DBMS constitutes a testbed that is flexible enough to support evaluation and validation of quite a variation of different strategies for complex-object processing taking into account different parallelization levels an different hardware environments. Thus, PRIMA marks and important s... 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.
  • Tuning of striping units in disk-array-based file systems

    Publication Year: 1992, Page(s):80 - 87
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Striping files across the disks of a disk array is a promising approach to improve the I/O performance of data management systems. An important tuning parameter of this method is the striping unit that is, the maximum number of logically consecutive blocks that are allocated on one disk. The striping unit determines the degree of parallelism in servicing a request by multiple disks, and its affect... 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.
  • DVH: a query processing method using domain vectors and hashing

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

    The authors introduce a fast, space-efficient technique for accelerating equijoins between very large relations. The technique, called Domain Vector Hash (DVH) join Acceleration, is described and compared with three other join accelerators: hybrid-hash, join indexes, and materialized views. An analytic cost model is developed for each join method, and a detailed analytic performance comparison is ... 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.
  • 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.
  • 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.
  • Optimization of object-oriented queries using path indices

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

    This paper addresses the problem of efficiently evaluating nested predicates in object-oriented databases. The authors have previously introduced the notion of path index (E. Bertino et al., 1989) that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. They evaluated the performance of the path index in the case of queries containing ... View full abstract»

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