Proceedings of IEEE 9th International Conference on Data Engineering

19-23 April 1993

Filter Results

Displaying Results 1 - 25 of 74
  • Proceedings of IEEE 9th International Conference on Data Engineering

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (314 KB)
    Freely Available from IEEE
  • Transaction support in a log-structured file system

    Publication Year: 1993, Page(s):503 - 510
    Cited by:  Papers (8)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The design and implementation of a transaction manager embedded in a log-structured file system are described. Measurements indicate that transaction support on a log-structured file system offers a 10% performance improvement over transaction support on a conventional read-optimized file system. When the transaction manager is embedded in the log-structured file system, the resulting performance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-phase commit optimizations and tradeoffs in the commercial environment

    Publication Year: 1993, Page(s):520 - 529
    Cited by:  Papers (9)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Eleven two-phase commit (2PC) protocol variations that optimize towards the normal case are described and compared with a baseline 2PC protocol. Environments in which they are most effective are discussed. The variations are compared and contrasted in terms of number of message flows, number of log writes (both forced and non-forced), probability of heuristic damage, how damage is reported, and ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A competitive dynamic data replication algorithm

    Publication Year: 1993, Page(s):310 - 317
    Cited by:  Papers (13)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    A distributed algorithm for dynamic data replication of an object in a distributed system is presented. The algorithm changes the number of replicas and their location in the distributed system to optimize the amount of communication. The algorithm dynamically adapts the replication scheme of an object to the pattern of read-write requests in the distributed system. It is shown that the cost of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The efficient computation of strong partial transitive-closures

    Publication Year: 1993, Page(s):530 - 537
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    The development of efficient algorithms to process the different forms of transitive-closure queries within the context of large database systems has attracted a large volume of research efforts. The authors present a new algorithm that is suitable for processing one of these forms, the strong partially instantiated query, in which one of the query's arguments is instantiated to a set of constants... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance characteristics of epsilon serializability with hierarchical inconsistency bounds

    Publication Year: 1993, Page(s):587 - 594
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    The notion of hierarchical inconsistency bounds that allows inconsistency to be specified at different granularities-with transactions being at the top of the hierarchy, objects at the bottom, and groups in between-is introduced. The mechanisms needed to control the inconsistency so that it lies within the specified bounds are described. The performance improvement due to epsilon serializability (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A truncating hash algorithm for processing band-join queries

    Publication Year: 1993, Page(s):419 - 427
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The truncating-hash band join algorithm for evaluating band joins is described. This algorithm is based on the idea of truncating join attribute values in order to execute band joins in a way similar to hash join algorithms for equijoins. Unlike previously proposed algorithms for band joins, it does not sort either of the input relations during its execution. A comparison between the truncating-ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient support of historical queries for multiple lines of evolution

    Publication Year: 1993, Page(s):319 - 326
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    A general framework for solving multiple-line history queries is presented. The authors address two important historical queries in this environment: the vertical query and the horizontal query. The vertical query enables a design team to find what its design was at a past instant on its own path of evolution, while the horizontal query provides a design team with the designs of relevant teams at ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature-based retrieval of similar shapes

    Publication Year: 1993, Page(s):108 - 115
    Cited by:  Papers (16)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    A shape similarity-based retrieval method for image databases that supports a variety of queries is proposed. It is flexible with respect to the choice of feature and definition of similarity and is implementable using existing multidimensional point access methods. A prototype system that handles the problems of distortion and occlusion is described. Experiments with one specific point access met... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • JazzMatch: fine-grained parallel matching for large rule sets

    Publication Year: 1993, Page(s):616 - 623
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    JazzMatch, a parallel matching algorithm explicitly designed for secondary memory-based production systems, is presented. JazzMatch is a state-saving algorithm that performs incremental match. It exploits extremely fine-grained parallelism and optimizes the storage state by permitting the sharing of common conditions in the rules. JazzMatch is supported by a message passing parallel architecture. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic query optimization in Rdb/VMS

    Publication Year: 1993, Page(s):538 - 547
    Cited by:  Papers (12)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Addresses the key theoretical and practical issues of dynamic query optimization and reviews the underlying reasoning that cements the basic concepts of dynamic query optimization. The optimization mechanics are described, in concert with explanations of why and how certain arrangements contribute to a given optimization goal. Compared to traditional approaches, dynamic query optimization offers a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entity identification in database integration

    Publication Year: 1993, Page(s):294 - 301
    Cited by:  Papers (27)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The objective of entity identification is to determine the correspondence between object instances from more than one database. Entity identification at the instance level, assuming that schema level heterogeneity has been resolved a priori, is examined. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Batch scheduling in parallel database systems

    Publication Year: 1993, Page(s):400 - 410
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Many techniques for query scheduling in a parallel database system schedule a single query at a time. The scheduling of queries for parallel database systems by dividing the workload into batches is investigated. Scheduling algorithms that exploit the common operations within the queries in a batch are proposed. The performance of the proposed algorithms is studied using a simple analytical model ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The correctness of concurrency control for multiversion database systems with limited number of versions

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

    The concurrency control problem for multiversion database systems (MVDBSs) with system-imposed upper bounds on the total number of data item versions stored in the database is considered. Concurrency control theory for MVDBSs is reviewed. The inadequacy of this theory for analyzing concurrency control algorithms for k-version database systems (KVDBSs) is demonstrated. A formal concurrency... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Audio/video databases: an object-oriented approach

    Publication Year: 1993, Page(s):381 - 390
    Cited by:  Papers (16)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    The notion of an audio/video (AV) database is introduced. An AV database is a collection of AV values such as digital audio and video data and AV activities such as interconnectable components used to process AV values. Two abstraction mechanisms, temporal composition and flow composition, allow the aggregation of AV values and AV activities respectively. An object-oriented framework, incorporatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path computation algorithms for advanced traveller information system (ATIS)

    Publication Year: 1993, Page(s):31 - 39
    Cited by:  Papers (15)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Three path-planning algorithms for single-pair path computation are evaluated. These algorithms are the iterative breath-first search, Dijkstra's single-source path-planning algorithm, and the A* single-path planning algorithm. The performance of the algorithms is evaluated on graphs representing the roadmap of Minneapolis. In order to get an insight into their relative performance, synth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel database systems: The case for shared-something

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

    Parallel database systems are becoming the primary application of multiprocessor computers. The reason for this is that they can provide high-performance and high-availability database support at a much lower price than do equivalent mainframe computers. The traditional shared-memory, shared-disk, and shared-nothing architectures of parallel database systems are compared, based on the following di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient computation of spatial joins

    Publication Year: 1993, Page(s):50 - 59
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Spatial joins are join operations that involve spatial data types and operators. Due to basic properties of spatial data, many conventional join strategies suffer serious performance penalties or are not applicable at all. The join strategies known from conventional databases that can be applied to spatial joins and the ways in which some of these techniques can be modified to be more efficient in... View full abstract»

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

    Publication Year: 1993, Page(s):182 - 189
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    An adaptive technique for reducing disk seek times is described. The technique copies frequently referenced blocks from their original locations to reserved space near the center of the disk. Reference frequencies need not be known in advance. Instead, they are estimated by monitoring the stream of arriving requests. Results of trace-driven simulations show that seek times can be cut in half by co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large object support in POSTGRES

    Publication Year: 1993, Page(s):355 - 362
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Four implementations that support large objects in the POSTGRES database system are presented. The four implementations offer varying levels of support for security, transactions, compression, and time travel. All are implemented using the POSTGRES abstract data type paradigm, support user-defined operators and functions, and allow file-oriented access to large objects in the database. The support... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An access structure for generalized transitive closure queries

    Publication Year: 1993, Page(s):429 - 438
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    An access structure that accelerates the processing of generalized transitive closure queries is presented. For an acyclic graph, the access structure consists of source-destination pairs arranged in a topologically sorted order. For a cyclic graph, entries in the structure are approximately topologically sorted. The authors present a breadth-first algorithm for creating such a structure, show how... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation and querying in temporal databases: the power of temporal constraints

    Publication Year: 1993, Page(s):327 - 334
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A temporal database model capable of representing absolute, relative, imprecise, and infinite temporal data is proposed. The model is based on temporal tables such as relation-like representations that can contain variables constrained by the formulas of a temporal theory. An algebraic query language for temporal tables is defined, and some problems related to query answering are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Post-crash log processing for fuzzy checkpointing main memory databases

    Publication Year: 1993, Page(s):117 - 124
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The impact of updating policy and access pattern on the performance of post-crash log processing with a fuzzy checkpointing main memory database (MMDB) is discussed. The problem of restoring the database to a consistent state and several algorithms for post-crash log processing under the various updating alternatives are reviewed. Using an analytic model, the checkpoint behavior and post-crash log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A descriptive semantic formalism for medicine

    Publication Year: 1993, Page(s):624 - 631
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    It is argued that current clinical information systems incorporate oversimplistic, prescriptive data models that are not faithful to clinicians' observations. A non-prescriptive descriptive semantic formalism, Structured Meta Knowledge (SMK), which unifies a terminological knowledge base with controlled assertional capabilities with the medical record and supports the semantic control necessitated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design, implementation, and evaluation of an object-based sharing mechanism for federated database systems

    Publication Year: 1993, Page(s):467 - 475
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    An approach and mechanism to support the sharing of objects are described, an experimental implementation is presented, and the performance of the system is analyzed and evaluated. The mechanism is based on a core set of constructs that characterize object-based database systems. The approach provides a basis for controlled sharing in a heterogeneous database environment, using a kernel object-bas... View full abstract»

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