Page
%P
3,887 Result(s)
within
**li Meng
Computer Science
-
Article
A Tree-structured Database Machine for large relational database systems
This paper proposes a Tree-structured Database Machine (TDM), which is designed for supporting large relational database systems. The TDM aims at totally improving three level performance bottlenecks in relati...
-
Chapter and Conference Paper
Analysis of some experimental results for the TDM
So far, most results reported for multiprocessor database machines (DBMs) have been simulation results, and very few results are from a real database machine implementation. In this paper, we present some expe...
-
Chapter
A model of summary data and its applications in statistical databases
The summary (statistics) data model described herein is an extension of the relational model. The concept of category (type or class) and the additivity property of some statistical functions form the basis of...
-
Chapter and Conference Paper
Control of bottlenecks in a network database machine
An analysis of various response times for a proposed network multiprocessor database machine is given in this paper. The insights gained should lead to better database machine designs. Our systems is based on ...
-
Chapter
Query Optimization in Object—Oriented Database Systems
In this paper, query processing and optimization in object-oriented database systems (OODBs) in a centralized environment is discussed. The typical chain query processing and optimization in OODBs is investiga...
-
Chapter and Conference Paper
Toward the Automatic Digitization of Map Text
The working procedures on the automatic digitization of map text are described with the emphasis on the context information supplied by the cartographic words. The principles how to establish a knowledge base ...
-
Chapter
Optimizing Compilers for the SPARC Architecture
This paper discusses Sun Microsystems’ user programming model for the SPARC architecture [SPAR87], and the optimizing compilers for the SPARC-based Sun-4 workstations. The architecture and its first implementa...
-
Article
Parallelization of WHILE loops on pipelined architectures
Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This pape...
-
Chapter and Conference Paper
The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks
At the 1990 EuroCrypt Conference, Niemi proposed a new publickey cryptosystem based on modular knapsacks. Y.M. Chee in Singapore, A. Joux and J. Stern in Paris independently found that this cryptosystem is ins...
-
Chapter and Conference Paper
Predict query processing cost in a distributed database system
The configuration of a distributed database system consists of a network and a number of local configurations. A local configuration (LC) consists of a CPU, some I/O devices and a local DBMS, etc. at its site....
-
Chapter and Conference Paper
Semantic Analysis of Larch Interface Specifications
A concept, called claim, is introduced to support checking of a formal specification. Claims are logical assertions about a specification that must follow semantically from the specification. Claims can be used t...
-
Chapter and Conference Paper
Database exploration with dynamic abstractions
For the efficient management of a large database we need a more friendly user-interface, more powerful abstraction capabilities, and more flexible data structures than is usually provided. A new database syste...
-
Article
A comparison of fast inverse discrete cosine transform algorithms
The discrete cosine transform (DCT) is often applied to image compression to decorrelate picture data before quantization. This decorrelation results in many of the quantized transform coefficients equaling ze...
-
Chapter and Conference Paper
Hamiltonian cycles in 2-generated Cayley digraphs of abelian groups
We give a necessary and sufficient condition for 2-generated Cayley digraphs of abelian groups to be hamiltonian or to be hamiltonian decomposable. As applications, we derive the counting formula for the numbe...
-
Book
-
Chapter
Overview of LCL
The ideas we study in this work are exercised in the context of the Larch/C Interface Language, LCL. LCL is a formal specification language designed to document C interfaces, and to support a programming style...
-
Chapter
Reengineering Using LCL
Many existing programs are written in programming languages that do not support data abstraction. As a result, they often lack modularity. It is difficult and expensive to maintain or extend such legacy progra...
-
Chapter
Further Work and Summary
In this chapter, we suggest areas where further work might be useful and summarize our research.
-
Chapter and Conference Paper
Superconnectivity for minimal multi-loop networks
We show that the minimal multi-loop networks are super-k except for undirected cycles.
-
Chapter
Introduction
Software is difficult to develop, maintain, and reuse. One contributing factor is the lack of modular design. A related issue is the lack of good program documentation. The lack of modular design in software m...
