By Topic

# Proceedings. Fourth International Conference on Data Engineering

## 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)
| | PDF (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»

• ### Proceedings Fourth International Conference on Data Engineering (Cat. No.88CH2550-2)

Publication Year: 1988
| PDF (46 KB)
• ### Adaptive algorithms for balanced multidimensional clustering

Publication Year: 1988, Page(s):386 - 393
Cited by:  Patents (1)
| | PDF (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»

• ### Can we meaningfully integrate drawing, text, image and voice with structured data?

Publication Year: 1988, Page(s):597 - 603
| | PDF (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»

• ### Trie hashing analysis

Publication Year: 1988, Page(s):377 - 381
Cited by:  Papers (5)
| | PDF (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»

• ### Concurrent storage structure conversion: from B+ tree to linear hash file

Publication Year: 1988, Page(s):589 - 596
| | PDF (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»

• ### An exact probability model for finite hash tables

Publication Year: 1988, Page(s):362 - 368
Cited by:  Papers (4)  |  Patents (2)
| | PDF (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»

• ### Performance evaluation of two concurrency control protocols for distributed databases with multiversioned entities

Publication Year: 1988, Page(s):426 - 436
Cited by:  Papers (1)
| | PDF (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»

• ### Efficient reordering of Prolog programs

Publication Year: 1988, Page(s):110 - 117
Cited by:  Papers (5)
| | PDF (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»

• ### Linearizing the directory growth in order preserving extendible hashing

Publication Year: 1988, Page(s):580 - 588
Cited by:  Papers (4)
| | PDF (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»

• ### Extending an assumption based truth maintenance system to databases

Publication Year: 1988, Page(s):354 - 359
Cited by:  Papers (1)  |  Patents (1)
| | PDF (404 KB)

A description is given of how information stored in databases can be used to support reasoning using an assumption-based reasoning system with truth maintenance. The basic notion behind this type of reasoning is that the problem solver can draw inferences on the basis of assumptions in the absence of information to the contrary. These inferences are nonmonotonic, in the sense they may be contradic... View full abstract»

• ### 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)
| | PDF (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»

• ### Parallel query processing for complex objects

Publication Year: 1988, Page(s):202 - 209
Cited by:  Papers (7)
| | PDF (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»

• ### Improved retrieval of foreign names from large databases

Publication Year: 1988, Page(s):480 - 487
Cited by:  Patents (7)
| | PDF (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»

• ### PLOP-hashing: A grid file without directory

Publication Year: 1988, Page(s):369 - 376
Cited by:  Papers (10)  |  Patents (3)
| | PDF (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»

• ### Modeling the effects of data and resource contention on the performance of optimistic concurrency control protocols

Publication Year: 1988, Page(s):418 - 425
Cited by:  Papers (14)
| | PDF (636 KB)

The authors use a mean value model for data contention and a piecewise linear model for resource contention. To show the usefulness of this methodology, they compare three different optimistic concurrency control protocols for a centralized system. The authors derive a closed-form expression for the transaction throughput as a function of workload parameters and the resource-access-time parameters... View full abstract»

• ### Site assignment for relations and joint operations in the distributed transaction processing environment

Publication Year: 1988, Page(s):100 - 108
Cited by:  Papers (5)  |  Patents (1)
| | PDF (604 KB)

An integrated strategy for choosing the sites where relations are to be stored while simultaneously determining where joint operations are to take place is considered. Based on the transaction characteristic and arrival frequency to each site, a methodology to formulate the strategy is developed to assign relations to systems and determine joint sites so as to minimize the amount of intersystem co... View full abstract»

• ### Globally order preserving multidimensional linear hashing

Publication Year: 1988, Page(s):572 - 579
Cited by:  Papers (9)  |  Patents (4)
| | PDF (584 KB)

Presents a dynamic, globally order-preserving hashing technique, based on linear hashing, where the spatial proximity of points is preserved beyond data buckets. The method adaptively generates a bucket numbering, which is a flexible variant of the well-known z-ordering. In addition to the standard dictionary operations, the authors' dynamic z-hashing scheme supports the efficien... View full abstract»

• ### Scheduling of page fetches in join operations using Bc-trees

Publication Year: 1988, Page(s):304 - 310
Cited by:  Papers (11)
| | PDF (432 KB)

The authors consider Bc-trees in a centralized system with large main memory, and show that in some cases the join operation using Bc-trees out performs other join techniques. The results can be used for estimating the cost of join using Bc-trees and then making a decision regarding the most efficient join technique to be used View full abstract»

• ### Knowledge base views in multiuser knowledge based systems

Publication Year: 1988, Page(s):346 - 353
Cited by:  Papers (6)
| | PDF (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»

• ### Ordering accesses to improving transaction processing performance

Publication Year: 1988, Page(s):58 - 63
Cited by:  Patents (1)
| | PDF (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»

• ### Accelerating non-numerical processing by an extended vector processor

Publication Year: 1988, Page(s):194 - 201
Cited by:  Papers (3)  |  Patents (3)
| | PDF (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»

• ### Moving selections into linear least fixpoint queries

Publication Year: 1988, Page(s):452 - 461
Cited by:  Papers (8)
| | PDF (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»

• ### A framework for optimization in expert system-DBMS interface

Publication Year: 1988, Page(s):126 - 133
| | PDF (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»

• ### An optimization strategy for recursive queries in logic databases

Publication Year: 1988, Page(s):470 - 477
Cited by:  Papers (3)
| | PDF (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»