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
  • 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.
  • 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.
  • 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.
  • An object-oriented view onto public, heterogeneous text databases

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

    Even though companies maintain highly-structured traditional business data in relational databases, large amounts of information are available in semi-structured text sources such as indexed online newspapers, patent information, literature citations, or business profiles. This information is offered by commercial providers who maintain complete control over access language, schemas and update cap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valid-time indeterminacy

    Publication Year: 1993, Page(s):335 - 343
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (792 KB)

    In valid-time indeterminacy, it is known that an event stored in a temporal database did in fact occur, but it is not known exactly when the event occurred. An extension of the tuple-timestamped temporal data model, called the possible chronons data model, is presented to support valid-time indeterminacy. In the possible chronons data model, each event is represented with a set of possible chronon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SLEVE: Semantic Locking for EVEnt synchronization

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

    A method for implementing semantic synchronization specifications with ordinary read and write locks is presented. A software system, SLEVE, that implements the methodology is described. An application developer who defines a conflict relation over an arbitrary set of synchronization primitives, such as abstract type operations, events, or semantic lock types, can use SLEVE to implement the specif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polynomial time algorithm for optimizing join queries

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

    The dynamic programming algorithm for query optimization has exponential complexity. An alternative polynomial time algorithm, the IK-KBZ algorithm, is severely limited in the queries it can optimize. Other algorithms have been proposed, including the greedy algorithm, iterative improvement, and simulated annealing. The AB algorithm, which combines randomization and neighborhood search with the IK... 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.
  • 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.
  • Large object support in POSTGRES

    Publication Year: 1993, Page(s):355 - 362
    Cited by:  Papers (5)  |  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.
  • Automating fine concurrency control in object-oriented databases

    Publication Year: 1993, Page(s):253 - 260
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (632 KB)

    Four major problems that complicate read and write accesses to instances in object-oriented databases are discussed. The four problems are: difficulty in providing ad hoc commutativity relations, lacking overhead, lacking escalation, and pseudo-conflicts. It is shown that all of these problems can be solved by providing a simple form of commutativity. This kind of commutativity is syntactically ex... 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.
  • 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.
  • ON modularity for conceptual data models and the consequences for subtyping, inheritance and overriding

    Publication Year: 1993, Page(s):678 - 685
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (716 KB)

    The binary relationship model is used to explain the principles of schema object types (SOTs). A SOT is a modularization concept for conventional conceptual data models, based on decomposition and abstraction from context. A SOT is at one level a single object type, but at a lower level it is described by a conceptual schema itself. The issue of subtyping, inheritance, and overriding for SOTs are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evaluation of physical disk I/Os for complex object processing

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

    In order to obtain the performance required for nonstandard database environments, a hierarchical complex object model with object references is used as a storage structure for complex objects. Several storage models for these complex objects, as well as a benchmark to evaluate their performance, are described. A cost model for analytical performance evaluation is developed, and the analytical res... 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 (19)  |  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.
  • Unification of temporal data models

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

    A conceptual temporal data model that captures the time-dependent semantics of data while permitting multiple data models at the representation level is described. A conceptual notion of a bitemporal relation in which tuples are stamped with sets of two-dimensional chronons in transaction-time/valid-time space is defined. A tuple-timestamped first normal form representation is introduced to show h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A language multidatabase system communication protocol

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

    Rapid growth in the area of multidatabase systems (MDBSs), which involve both the access of global data and distributed transaction processing, has created a need for programming languages that provide communication reliability and powerful synchronization. The requirements of MDBSs are reviewed, and the Vienna Parallel Logic programming language is presented. The ways to realize an MDBS communica... 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.
  • Definition and application of metaclasses in an object-oriented database model

    Publication Year: 1993, Page(s):373 - 380
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (720 KB)

    The metalevel concepts for an object-oriented database model are presented. Usually, systems that include a metaclass concept are either only implicitly supporting the management of meta information, which restricts the application of this concept, or explicitly giving unrestricted access to manipulate metaclasses, which results in inconsistent states of the system. To make the explicit support mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic foundation and optimization for object based query languages

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

    The Tarski algebra, an algebraic foundation for object-based query languages, is presented. While maintaining physical data independence, the Tarski algebra is shown to be both simple and powerful enough to express all reasonable queries. It is shown how queries expressed in a graph-oriented query language (based on the functional data model) can be translated into the Tarski algebra. The graphica... 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 (8)
    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.
  • Recursive functions in Iris

    Publication Year: 1993, Page(s):145 - 154
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (764 KB)

    A complete and efficient implementation of linear, one-side recursive queries in Iris, an object-oriented database management system, is described. It is shown that recursion can be easily and efficiently added to a large class of existing database management systems. A B-tree type access path called the B++ tree that has been implemented to support the computation of recursive functions in Iris i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards more flexible schema management in object bases

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

    An approach to database schema management is presented that allows easy tailoring of schema management, high-level specification of schema consistency, and development of advanced tools supporting the user during schema evolution. The application of this approach to the development of a simple schema manager for the core of the GOM database programming language is described. The flexibility afford... View full abstract»

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