[1989] Proceedings. Fifth International Conference on Data Engineering

6-10 Feb. 1989

Filter Results

Displaying Results 1 - 25 of 84
  • Proceedings Fifth International Conference on Data Engineering (IEEE Cat. No.89CH2695-5)

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Parallel computing with distributed shared data

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Summary form only given. The issue of ease of using shared data in a data-intensive parallel computing environment is discussed. An approach is investigated for transparently supporting data sharing in a loosely coupled parallel computing environment, where a moderate to a large number of individual computing elements are connected via a high-bandwidth network without necessarily physically sharin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object exchange service for an object-oriented database system

    Publication Year: 1989, Page(s):27 - 34
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    An object exchange service (OXS) and an external object representation (EXTOR) are described in the context of a distributed object-oriented database. EXTOR is the common representation that facilitates the sharing of information among a network of machines. The aim is to represent complex structured information in an efficient external form and to provide maximal sharing of information among comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-critical database scheduling: a framework for integrating real-time scheduling and concurrency control

    Publication Year: 1989, Page(s):470 - 480
    Cited by:  Papers (31)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A framework is presented for analysis of time-critical scheduling algorithms. The main assumptions are analyzed behind real-time scheduling and concurrency control algorithms, and a unified approach is proposed. Two main classes of schedulers are identified according to the availability of information about resource requirements and execution times: conflict-resolving schedulers resolve conflicts ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An overview of the Object-Oriented Functional Data Language

    Publication Year: 1989, Page(s):18 - 26
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The Object-Oriented Functional Data Language (O2FDL), an interactive, strongly typed database programming language, is discussed. It features inheritance and encapsulation of object-oriented languages and a functional notation for message expressions. The main contributions of the O2FDL are: (1) functions of indefinite nesting levels that simplify nested list processing and f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global information system issues

    Publication Year: 1989, Page(s):672 - 673
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A global information system (GIS) is an umbrella system that presents a global schema of the data available in its underlying, component, autonomous information systems and provides its users with the capability to ask queries of the global scheme and to receive integrated answers. The major research areas confronting GIS developers are examined. They are: development of global schema; query proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A buffer management model for use in predicting overall database system performance

    Publication Year: 1989, Page(s):463 - 469
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A performance model of buffer management is presented that is appropriate for use in the context of a multilayer database performance model. Some empirical evidence that supports the model's hypothesis that database page references are Bradford-Zipf-distributed is provided. A validation of the buffer performance model against data from a real-life environment is reported. Overall, the database buf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database analyzer and predictor-an overview

    Publication Year: 1989, Page(s):625 - 634
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    The database analyzer and predictor (DBAP) is a CASE (computer-aided software engineering) tool supporting the design and tuning of IDMS (integrated data-management system) DB/DC applications. It is an interactive system, completely integrated with the IDMS online environment and providing the database designer with a comprehensive set of performance analysis models evaluating principal aspects of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint analysis for specifying perspectives of class objects

    Publication Year: 1989, Page(s):10 - 17
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    An approach known as constraint analysis is presented for specifying updatable perspectives of class objects in an object-oriented data schema. Perspectives provide a way of defining the scope of a user's view of a schema. Operations on class objects are then defined in terms of specific perspectives based on the semantics associated with the schema. Schema semantics are represented as a set of in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materialization and incremental update of path information

    Publication Year: 1989, Page(s):374 - 383
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The problem of efficiently processing recursive path queries in deductive database systems is discussed, and a semimaterialized encoding structure is proposed as an attractive approach that provides a balance between efficiency of retrieval and feasibility of storage. Incremental algorithms are presented that enable the effects of updates to the underlying database to be reflected in the materiali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing techniques for historical databases

    Publication Year: 1989, Page(s):127 - 137
    Cited by:  Papers (22)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Two indexing structures based on R-trees are proposed for historical data, which can span magnetic disk and optical disk media. The performance of these indexes is compared to that of two other indexing candidates that are each contained entirely on one medium. Test results indicate that the proposed indexes perform well when compared to an index that is contained entirely on optical disk View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LINDA: a system for loosely integrated databases

    Publication Year: 1989, Page(s):66 - 73
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    LINDA, an experimental system for database access in heterogeneous environments, is discussed. The goal is to achieve maximum site autonomy and as much database access homogenization as possible. The problems to be solved are discussed, and design priorities are justified. Major heterogeneity problems are sketched, and the applied techniques are briefly described. An overview of the implementation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics and efficient compilation for quantitative deductive databases

    Publication Year: 1989, Page(s):660 - 619
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    A coherent approach is presented that extends relational and deductive database technology toward an integration of expert-system applications, which require sound and efficient capabilities to deal with uncertainty. Extending logic programming, the authors define the semantics of quantitative deductive databases, where fixpoint theory plays a central role. Calculus gives the rule programmer a gre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inference-security analysis using resolution theorem-proving

    Publication Year: 1989, Page(s):410 - 416
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A nonnumeric analog of statistical methods for proving security is described and implemented. The approach involves analyzing facts and inference rules assumed to be known to a compromiser and deriving all their possible consequences using resolution theorem-proving, a technique which is argued to be far more appropriate to this problem than rule-based expert systems or information-flow analysis. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checkpointing memory-resident databases

    Publication Year: 1989, Page(s):452 - 462
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    A database system is considered in which a main-memory database system holds all data in semiconductor memory, and for recovery purposes a backup copy of the database is maintained in secondary storage. The checkpointer is the component of the crash recovery manager responsible for maintaining the backup copy. Ideally, the checkpointer should maintain an almost-up-to-date backup while interfering ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design of the cell tree: an object-oriented index structure for geometric databases

    Publication Year: 1989, Page(s):598 - 605
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The design of the cell tree, an object-oriented dynamic index structure for geometric databases, is described. The data objects in the database are represented as unions of convex point sets (cells). The cell tree is a balanced tree structure whose leaves contain the cells and whose interior nodes correspond to a hierarchy of nested convex polyhedra. This index structure allows quick access to the... View full abstract»

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

    Publication Year: 1989, Page(s):234 - 241
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Transaction modelling, which involves capturing the dynamic properties of an organization and is viewed as a necessary component in data modelling is discussed. A specification-language-transaction schema based on ACM/PCM specification language is implemented as the transaction-modelling tool. The benefit of such a modeling tool is discussed and its ability to extend the static scheme automaticall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locking performance in a shared nothing parallel database machine

    Publication Year: 1989, Page(s):149 - 158
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A quantitative performance study of two-phase locking in a parallel database machine using a simulation-based methodology is presented. The DBSIM simulation methodology uses a Petri-net model at the higher level and a queuing network model at the lower level. The Petri net model captures the characteristics of parallelism and synchronization at the workload level, while the queuing network model c... View full abstract»

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

    Publication Year: 1989, Page(s):618 - 624
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    An approach for evolutionary database design is presented which tries to remedy some of the shortcomings of previous design methods. The approach distinguishes clearly between a conceptual and a logical database design. A conceptual schema models the relevant aspects of reality. A logical schema describes the structure of the database as generic tables, and it reflects the design decisions taken t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Does loose AI-DBMS coupling stand a chance?

    Publication Year: 1989, Page(s):252 - 254
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    The concept of loose coupling of artificial intelligence systems and database systems is defined. The issues that arise in determining the scope of loose integration are identified. A cache-based architecture being implemented in a knowledge management system project is described. The objective is to develop an interface that is useful for generalized database access from an expert system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic validation of object-oriented database structures

    Publication Year: 1989, Page(s):2 - 9
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    The philosophy of explicitly representing simple range classes for properties and explicitly specifying range and/or cardinality restrictions on inherited properties is adopted so that the membership of an object in classes is characterized by the object's property values. The motivation for this approach is twofold: first, it is in keeping with the database philosophy of emphasizing the represent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coupling knowledge based systems with large data stores

    Publication Year: 1989, Page(s):257 - 258
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    Loose and tight couplings of knowledge-based systems with large underlying information bases are defined and discussed. Two points of discussion presented are whether it is possible to achieve tight coupling of the kind defined, and whether it is of some benefit to reach for tight coupling. It is concluded that in addition to a gain in performance, the tight integration of all system components wi... View full abstract»

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

    Publication Year: 1989, Page(s):366 - 373
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n2 semijoin operations are required, where n is the number of nodes in the graph representing the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The personal model of data towards a privacy oriented information system

    Publication Year: 1989, Page(s):348 - 355
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    A general report is presented on an approach problem of privacy-oriented information systems. The report is based on extensive research experiences in specifying the structure of such a system, including the underlying data model and the privacy policy, as well as on the insight gained from a prototype implementation of selected parts of the specification. The system is called DORIS (datenschutz-o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Password authentication based on public-key distribution cryptosystem

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

    A password authentication mechanism based on the public-key distribution cryptosystem is proposed. The scheme uses an authentication table to replace the traditional password file. With this scheme, even if the authentication table is comprised, the system security is preserved. The user's password is effectively bound to the user's identification in a timely, efficient, and simple manner View full abstract»

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