Showing papers in "Information Sciences in 1989"

TL;DR: An extension of the relational data model for incorporating temporal semantics of the real world into a database called temporal relational model (TRM) is proposed, which has numerous applications, where data in their historical form are important.

TL;DR: The multidatabase language msql is described, designed for the manipulation of data from different relational databases, and is an extension of sql, which has become the standard for relational database systems.

TL;DR: In this article, the authors propose a model of CAD transactions which allows a group of cooperating designers to arrive at a complex design without being forced to wait over a long duration, and also allows the group of designers to collaborate on a design with another group by assigning subtasks.

TL;DR: A distributed protocol that operates on replicated data objects represented in terms of the history of object events, rather than in Terms of object values, is described, which is fault-tolerant in that site and communication failures can only slow down its progress.

TL;DR: Three-valued semantics is proposed for formal theories of the first order based on the predicate calculus without the principle "everything follows from an inconsistency", and the basic metatheorems are proved.

TL;DR: The absence of finite axiomatization for different types of dependencies, including join dependencies, is proved.

TL;DR: A model that takes a temporal query and a database schema as input, and outputs the estimated I/O cost for the query on that database, and can be used to analyze the performance of conventional databases.

TL;DR: This paper studies which conditions have to be verified by the cuts of the fuzzy numbers f and g in order that the equation f ∗ x = g has a solution.

TL;DR: In order to implement a universal table interface, this work makes use of a query-evaluation procedure that allows for an appropriate answer to be generated whether the requested data are stored in the database or not and, then, have to be computed (i.e., estimated).

TL;DR: A new scheme without directory, called multidimensional quantile hashing, is proposed, which exhibits for independent nonuniform record distributions practically the same performance as for uniform distributions.

TL;DR: It is shown that the class of sets of square tapes accepted by nondeterministic three-way L( m) tape-bounded Turing machines is closed under complementation if L(m)⩾m2 is constructible.

TL;DR: A problem-solving strategy is presented which does not require the manifestation independence assumption required with direct Bayesian classification, and which is applicable to multimembership classification problems.

TL;DR: This paper is intended to review the existing hierarchical multiprocessor machines dedicated to Image Processing and some general design concepts are given and compared in terms of hardware and software complexity.

TL;DR: A deadlock-free locking mechanism for B -trees in which different processes make use of different lock types in order to reach the leaf nodes in which a number of insertion or deletion processes can operate concurrently on a node.

TL;DR: It is demonstrated reusability can be achieved by imposing standardized interfaces and expressing algorithms in a DBMS-implementation-independent manner by standardizing algorithm definitions in terms of query-graph rewrite rules.

TL;DR: An efficient algorithm for determining the maxima of the relative error of Euclidean distance by an m-neighbor distance is presented and the existence of a still simpler and more efficient algorithm is conjectured.

TL;DR: The mechanisms are shown to perform much better than conventional locking mechanisms within design environments, and derives formulas for performance measures, such as throughput and percentage of transaction time spent for conflict resolution.

TL;DR: A unified optimization method called window protocol is proposed for a class of CSMA and CSMA/CD protocols, which include the adaptive-tree-polling protocols, the urn protocols,the priority-access protocols,The arrival-time-window protocols and the virtual-window protocol.

TL;DR: A space efficient algorithm for solving the Towers of Hanoi problem using the concept of virtual disc, which is an artificial disc smaller than the smallest real disc to enforce a unique disc move at each step.

TL;DR: The Gemini system testbed design is presented and three consistency and recovery schemes are discussed: voting with witnesses, dynamic voting, and semisynchronous voting are discussed.

TL;DR: The I2OS is a hardware/software subsystem which is functionally equivalent to a conventional I/O device which includes an expert system for recognizing usage patterns and prefetching the next expected disk pages.

TL;DR: A protocol for improving concurrency and preserving consistency in databases with multiversioned entities with preordered entities; the database can be either centralized or distributed and may or may not have data replication.

TL;DR: A prototype expert system oriented to signal and pattern analysis is described, together with a general methodology based on a hypothesize-and-test strategy similar to the one used by a human expert, which is being applied to the phonetic analysis of the voice signal in speech recognition.

TL;DR: A system of inference rules is presented to deduce JD logically implied by a given set of JD, a minimum set of database relations whose join provides the same answer to a given query as the join of the whole database.

TL;DR: The vectorization method and IDP are applied to Hitachi's new, recently-announced, commercial RDBMS (called RDB1/IDP), and the performance improvement is described and analyzed.

TL;DR: Two types of valuations for a query expression in a relational database with incomplete tuples (values of some attributes missing) are presented.

TL;DR: It is highly improbable that the considerable cost of rebalancing trees when constructing data-bases will ever be justified in practice, unless the distribution of data is far from the rather plausible assumption made here.

TL;DR: This work proposes a framework for concurrency-control performance evaluation in single-site databases and gives a complete example of a performance study for the dynamic two-phase locking algorithm using this framework.

TL;DR: It is shown that for the solution of problems raised in various systems and in the theory of relational databases (RDB) the apparatus of multiplace relations and the Theory of dependencies developed in RDB theory may be applied.