Notice
There is currently an issue with the citation download feature. Learn more

Proceedings. Fourth International Conference on Data Engineering

1-5 Feb. 1988

Filter Results

Displaying Results 1 - 25 of 69
  • Object class definition by generalization using upward inheritance

    Publication Year: 1988, Page(s):4 - 13
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (949 KB)

    The authors show how the process of object class definition by generalization can be incorporated into object-oriented systems. Traditional message handling, which is mainly based on downward property inheritance, is revised and extended to upward property inheritance, so that a maximum of reusability of code and data can be achieved. Different types of semantic relationships that may hold between... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings Fourth International Conference on Data Engineering (Cat. No.88CH2550-2)

    Publication Year: 1988
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Future trends in data base systems

    Publication Year: 1988, Page(s):222 - 231
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    A discussion is presented of the likely evolution of commercial data managers over the next several years. Topics to be covered include: why SQL is becoming a de facto standard; who will benefit from SQL standardization; why the SQL standard has no chance of lasting; why all database systems will be distributed soon; what technologies are likely to be commercialized; and why vendor independence ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel control technique and performance of an MPPM knowledge base machine

    Publication Year: 1988, Page(s):210 - 217
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    A description is given of parallel control techniques and performance evaluations by simulation for the knowledge-base machine (KBM) using the multiport page-memory (MPPM) and the unification engine (UE). Relational knowledge base retrieval requires repeated application of the unification-join (U-join) operations on term relations. It also requires each U-join to be dynamically scheduled, observin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel query processing for complex objects

    Publication Year: 1988, Page(s):202 - 209
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    The authors investigate a direct storage scheme for complex objects called FIHSM (Fully Inverted Hierarchical Storage Model) and propose a novel parallel-query-processing strategy (QPS) for it. The QPS has four phases (select, pivot, value materialize and compose). With a declustered placement strategy, each of these phases provides for both inter and intra-operation parallelism. Furthermore, part... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for adaptable systems for transaction processing

    Publication Year: 1988, Page(s):40 - 50
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A model is presented for an adaptable system that allows online switching of classes of algorithms for database transaction processing. The basic idea is to identify conditions on the state of processing that will maintain consistency during the switch from one class to another. The classes of concurrency control algorithms and the formalism of history for transaction processing and serializabilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating non-numerical processing by an extended vector processor

    Publication Year: 1988, Page(s):194 - 201
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    The problems of utilizing an extended vector processor called IDP (Integrated Database Processor) for nonnumerical processing are discussed. IDP has highly pipelined merge and search vector facilities in addition to conventional vector facilities. This extended vector processor can be utilized not only for primitive relational operations but also for the following applications: (1) complex relatio... View full abstract»

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

    Publication Year: 1988, Page(s):31 - 38
    Cited by:  Papers (54)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    A query under an object-oriented data model exhibits characteristics which one finds in a relational query and those which clearly separate it from a relational query. The differences in turn have interesting impacts on the complexity of and strategy for query evaluation in object-oriented databases. The authors develop a model of a query under an object-oriented data model, and analyze the fundam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EDICT-an enhanced relational data dictionary: architecture and example

    Publication Year: 1988, Page(s):184 - 191
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    An approach is described for enhancing an integrated relational data dictionary in order to capture and faithfully present this high-level enterprise schema in a form which can be incorporated directly into the relational database system. The approach, referred to as EDICT, allows for the specification of the enterprise schema for a database as an extension of the data dictionary by storing the sc... View full abstract»

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

    Publication Year: 1988, Page(s):23 - 30
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A description is given of the concept and implementation techniques of schema virtualization in object-oriented databases. The objective of schema virtualization is to provide users with multiple views of a database. First, the notions of virtual classes and virtual schemata, which are natural extension of views in relational databases, is introduced. Then, procedures to convert a schema into a vi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for integrating conceptual schemas and user views

    Publication Year: 1988, Page(s):176 - 183
    Cited by:  Papers (30)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    An interactive tool has been developed to assist database designers and administrators (DDA) in integrating schemas. It collects the information required for integration from a DDA, performs essential bookkeeping, and integrates schemas according to the semantics provided. The authors present the capabilities of this tool by discussing the integration methodology and the user interface of the tool View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Can we meaningfully integrate drawing, text, image and voice with structured data?

    Publication Year: 1988, Page(s):597 - 603
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Covers application as well as system aspects of managing and integrating unstructured and structured data. Problems of representation, features, and abstraction are discussed. Other aspects considered are browsing unstructured data and multimedia systems and text View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized version control in an object-oriented database

    Publication Year: 1988, Page(s):14 - 22
    Cited by:  Papers (32)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    An important function of an engineering database management system is to support incremental and cooperative design in an orderly way. This calls for a version-control mechanism of some generality if it is to be appropriate to the design of complex objects. The authors consider the nature of design objects, and develop some functional requirements for version control of such objects. They outline ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PL-a probabilistic logic

    Publication Year: 1988, Page(s):462 - 469
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A description is given of a logic called PL, which uses probability estimates to express uncertainties (without adopting the conventional probability axioms). The author proposes a generalization of the logical interpretations of the connectives and quantifiers to this case. The notions of a formula, a structure, assignment, satisfaction, deduction, etc., are generalizations of the corresponding f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ADT: a toolkit for development of database-centered applications

    Publication Year: 1988, Page(s):168 - 175
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    An application-development toolkit is described that offers an alternative approach to the development of database-intensive applications. It offers direct support to application area specialists and end users in their production of complete application sets to meet their own requirements. The system has been applied successfully to the development of applications against a variety of DBMS (databa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent storage structure conversion: from B+ tree to linear hash file

    Publication Year: 1988, Page(s):589 - 596
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    Shows that the efficient reorganization of a B+ tree file into a linear hash file can be done concurrently with user transaction processing. This conversion is motivated by a change in database processing, in which efficient sequential and direct access were originally needed, but now only efficient direct access is needed. This is quite reasonable for a database system which accommodates... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RATIONALE: reasoning by explaining

    Publication Year: 1988, Page(s):258 - 265
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A methodology is presented for building knowledge-based systems that reason by explaining. The methodology is the basis for RATIONALE, a tool-implemented in Quintus Prolog- that ties together the processes of knowledge acquisition,expert system construction, and explanation of system reasoning. RATIONALE integrates explanations with reasoning by using domain knowledge together with explicitly repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Moving selections into linear least fixpoint queries

    Publication Year: 1988, Page(s):452 - 461
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form `column θ value' to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. It is shown that the algorithm transposes the strongest possible selection View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent robust checkpointing and recovery in distributed systems

    Publication Year: 1988, Page(s):154 - 163
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    A checkpoint/rollback algorithm is presented for multiple processes in a distributed system that uses message passing for communication. Each process in the system can initiate the algorithm autonomously. If only one instance of the algorithm is being executed, the algorithm will force the minimal number of additional processes other than the initiator to make checkpoints (or roll back). The contr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved retrieval of foreign names from large databases

    Publication Year: 1988, Page(s):480 - 487
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    A description is given of enhancements made to name-search techniques currently used to access large databases of proper names. Improvements included use of a hidden-Markov-model (HMM) statistical classifier to identify the likely linguistic source of a proper name, and application of language-specific rules to generate plausible spelling variants of names. These two components were incorporated i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental analysis of replicated copy control site failure and recovery

    Publication Year: 1988, Page(s):82 - 91
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The authors examine the effect of failures on the consistency of replicated copies, measure the rate at which inconsistency can be removed, and measure the overheads associated with replicated copy control. They have extended the prototype system RAID to utilize the ideas of session numbers, nominal session vectors, fail-locks, and control transactions for replicated copy control. The authors disc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified concurrency control algorithm for distributed database systems

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

    The authors present a unified concurrency control algorithm for distributed database systems in which each transaction may choose its own concurrency control protocol. Specifically, they integrate two-phase locking, timestamp ordering, and precedence agreement into one unified concurrency control scheme. They show the correctness of the scheme and study the problem of selecting the best protocol f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using common subexpressions to optimize multiple queries

    Publication Year: 1988, Page(s):311 - 319
    Cited by:  Papers (23)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The problem of identifying common subexpressions and using them in the simultaneous optimization of multiple queries is dealt with. In particular, emphasis is placed on the strategy of selecting access plans for single queries and their integration into a global access plan that takes advantage of common tasks. A dynamic programming algorithm is presented for the selection of individual access pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive checkpointing scheme for distributed databases with mixed types of transactions

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

    A checkpointing algorithm is presented that does not interfere with transaction processing. The correctness of the algorithm is shown, and the robustness of the algorithm and the recovery procedures associated with it are discussed. The algorithm provides a practical solution to the problem of checkpointing and recovery in distributed database systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linearizing the directory growth in order preserving extendible hashing

    Publication Year: 1988, Page(s):580 - 588
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Proposes a method of implementing an order-preserving extendible hashing scheme using a balanced hierarchical directory. The directory is implemented as a balanced m-way tree where m=2θ for some predefined constant θ. This approach gives an almost linear growth in the directory size for both uniform and nonuniform key distributions at the expense of possibl... View full abstract»

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