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
  • 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.
  • A framework for optimization in expert system-DBMS interface

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

    The authors present a framework for optimization in coupling an expert system and a database management system (DBMS) in such a way to satisfy the requirement of being capable of inferencing with a volume of information that far exceeds main memory capacity. This technique, an extension of traditional relational query optimization, is based on the ideas of normalization and access mapping between ... 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.
  • 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.
  • 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.
  • OOPS-an object oriented programming system with integrated data management facility

    Publication Year: 1988, Page(s):118 - 125
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (724 KB)

    OOPS is an object-oriented programming environment with integrated data management facilities. It is designed to especially support advanced applications, like engineering and office applications. Rich data modeling facilities, including the concepts of classification, generalization, and aggregation are provided. Additionally, complex semantic integrity constraints, exception-handling mechanisms,... 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.
  • Trie hashing analysis

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

    The author presents an analysis of trie hashing for alphanumerical keys. He proposes a variant that uses a binary code and an asymptotic analysis of the size of the index. This provides, for biased distribution, a computable formula that predicts the size of the index as a function of the frequencies of the characters and the transition frequencies between these characters. These results are confi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ordering accesses to improving transaction processing performance

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

    The order of queries within a transaction and the order of access to granules within a query may sometimes be varied without changing the results of the transaction. The authors have improved performance by accessing granules in inverse order of their frequency of use. They call this inverse hotness ordering, or IHO. They have proposed several methods of estimation and storage of hotness informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid data sharing-data partitioning architecture for transaction processing

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

    Proposes and evaluates a hybrid architecture that combines the approaches, and offers the advantages of both data sharing and data partitioning. Some databases are shared between systems, while others are retained private by specific systems. The issue is to determine which databases to share, which to retain private, and how to route transactions and partition the private databases among systems ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient dynamic voting algorithms

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

    Two novel dynamic voting algorithms are proposed. One, called optimistic dynamic voting, operates on possibly out-of-date information, which greatly increases the efficiency of the algorithm and simplifies its implementation. The other, called topological dynamic voting, explicitly takes into account the topology of the network on which the copies reside to increase the availability of the replica... 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.
  • Performance evaluation of two concurrency control protocols for distributed databases with multiversioned entities

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

    The authors evaluate and compare the performance of two concurrency control protocols for distributed databases with multiversioned entities, assuming that each transaction incrementally declares its access set from the successive parts of the preordered entities. The first protocol is called protocol proposed (PP). The second is a variant of the protocol proposed by D.P. Reed (1978), here called ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • File allocation on homogeneous local computer systems with two-level multiaccess networks

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

    Various versions of the file allocation problem on homogeneous two-level local multiaccess networks are examined. The problems associated with file allocation are more simple on two-level networks than on general point-to-point networks because the communication cost for accessing a file is reduced to a three-value variable. File allocation with storage-limit constraints is still NP-hard. The opti... 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.
  • Efficient reordering of Prolog programs

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

    The authors show how reordering of Prolog clauses, and especially goals, can prevent unnecessary search. They characterize the restrictions on reordering and show how they may be detected. They design a system of calling modes for Prolog, geared to reordering and discuss ways to infer them automatically. They present an improved method for determining a good goal order for Prolog clauses, and use ... 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.
  • 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.
  • 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.
  • Supporting updates in heterogeneous distributed database systems

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

    The performance is studied of atomic updates across different database management systems (DBMSs). An optimistic concurrency-control algorithm is proposed that allows a subclass of global transactions to concurrently retrieve and update the multiple databases, while it places no restriction on the concurrency-control mechanisms used by each of the local DBMSs, thus maintaining local autonomy 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.
  • 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.
  • 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.