Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

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 (18)  |  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
  • PLOP-hashing: A grid file without directory

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

    The authors consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After demonstrating the advantages of multidimensional hashing schemes without directory, they suggest using piecewise linear expansions to distribute the load more evenly over the pages of the file. The resulting piecewise linear order preserving hashing scheme (PLOP-hashing) is the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal communication topologies for atomic commitment

    Publication Year: 1988, Page(s):51 - 57
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a `better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE... 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.
  • Queries in object-oriented databases

    Publication Year: 1988, Page(s):31 - 38
    Cited by:  Papers (55)  |  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.
  • 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 high-speed morpheme-extraction system using dictionary database

    Publication Year: 1988, Page(s):488 - 495
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Presents a high-speed morpheme-extraction system that extracts morphemes from a phoneme string using the characteristics of a dictionary database. To realize this, a dictionary database access method, a tree-structured index and a parallel index-access technique are introduced. The tree-structured index is divided into an upper part and a lower part, and it is structured to execute parallel access... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for maintenance of large database indexes

    Publication Year: 1988, Page(s):402 - 408
    Cited by:  Papers (5)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Installing an update in an indexed database of size N takes O(log N) disk accesses, because of a root-leaf path traversal. If the installing of updates is deferred for a while, until a certain number n of them have been collected, substantial savings can be obtained. Two efficient algorithms for performing such grouped updates are presented and analyzed. The conditions o... 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.
  • Knowledge base views in multiuser knowledge based systems

    Publication Year: 1988, Page(s):346 - 353
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The author presents a methodology for representing knowledge in a collection of interlinked, largely autonomous knowledge base views, to facilitate multiple heterogeneous use of a KBS (knowledge based system). The knowledge base views are defined so that while knowledge outside each user's view is transparent to him/her, problem solving can be achieved using knowledge from multiple views. Furtherm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An incremental mechanism for schema evolution in engineering domains

    Publication Year: 1988, Page(s):294 - 301
    Cited by:  Papers (10)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The authors focus on one class of schema revisions necessitated by a very basic phenomenon: a given individual object evolves into a family of objects which are similar to it in many ways. This is commonly called the version problem. In theoretical terms, one can handle the above schema change in the standard, object-oriented database models by the interposition of suitable abstractions into the e... 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 (12)
    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.
  • Data allocation in a dynamically reconfigurable environment

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

    The authors address the data allocation problem in a dynamically reconfigurable distributed database system. Following the description of the system model and the consequences of node movement, several dynamic allocation strategies are presented. A distributed candidate-selection algorithm using the data from the accounting system in the database servers is proposed to reduce the number of files a... 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.
  • A functional clustering method for optimal access to complex domains in a relational DBMS

    Publication Year: 1988, Page(s):394 - 401
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The authors present a clustering method for complex domains. The method is original in that tuples can be clustered using functions applied to complex domain values. Thus, tuples are organized according to a function result. Those functions most often applied to complex values and used in the restriction part of queries can be used as clustering predicates. Hence, they optimize the retrieval of tu... 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.
  • 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.
  • An effective method for integrity constraint simplification

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

    A description is given of a very effective method for the syntax-directed simplification of multirelation, multivariable, aggregate-free integrity constraints against a fairly general class of multirelation update transactions with partial specifications. Compared with other work, the approach covers a wider range of update transactions and integrity constraints, and explores more optimization opp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ensuring data security and integrity with a fast stable storage

    Publication Year: 1988, Page(s):285 - 293
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    An active, RAM-based stable storage board is described. The stable storage board is intended to make it relatively fast to access data structures, and contains features to guard against incorrect access from a faulty processor or from an errant program. Basic performance data are presented and potential applications are described 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 (33)  |  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.
  • A performance analysis of an optimistic and a basic timestamp-ordering concurrency control algorithms for centralized database systems

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

    A study is made of a known implementation of an optimistic concurrency-control algorithm for centralized database systems and improvements are suggested to the algorithm. The authors propose an implementation of an algorithm for the basic timestamp-ordering concurrency control in centralized database systems. The two algorithms are compared by simulation experiments. As expected, the optimistic ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exact probability model for finite hash tables

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

    The author presents an exact probability model for finite hash tables and applies the model to solve a few problems in the analysis of hashing techniques. The model enables exact computation of table sufficiency index, a parameter useful in the design of small hash tables. The author also presents an exact analysis of the expected length of the longest probe sequence in hashing with separate chain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimization strategy for recursive queries in logic databases

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

    Considers the optimization of recursive database queries expressed in Datalog (function-free Horn clause programs). The authors present a general strategy for rewriting a Datalog program to cut down the number of database facts consulted in the bottom-up evaluation of queries containing bound arguments. The strategy can be interpreted as a preprocessing task in which an `envelope' containing the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive algorithms for balanced multidimensional clustering

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

    The G-K-D tree (generalized K-D tree) method aims at reducing the average number of data page accesses per query, but it ignores the cost of index search. The authors propose two adaptive algorithms that take into consideration both data page access cost and index page access cost. It attempts to find a minimum total cost. Experimental results indicate that the proposed algorithms are superior to ... View full abstract»

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