[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.
  • Modeling semantic constraints with logic in the EARL data model

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

    The authors present a portion of the EARL semantic data model, an augmentation of the entity-relationship model, which uses notational constructs based on propositional logic to allow a greater selection of semantic integrity constraints to be captured during the specification and design of a domain schema. The use of these logic-based constructs is shown to allow more subtle constraints to be spe... 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.
  • Incremental protocol verification using deductive database systems

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

    A deductive approach which incorporates first-order logic into a relational database is proposed to remedy the problems incurred in the relational algebraic approach. The method not only allows recursive definitions for more complex logical reasoning but also provides a uniform query interface to the users for verifying functional properties of a protocol. Most important, with the deductibility of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SDDM-a prototype of a distributed architecture for database security

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

    A description is given of the secure distributed data management (SDDM) system, which is a prototype of a distributed architecture for multilevel database security that meets the US Department of Defense's trusted computer system evaluation criteria at the B3 level. The distributed architecture separates data by its security classification onto multiple single-level back-end database hosts and use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scheme for maintaining consistency and availability of replicated files in a partitioned distributed system

    Publication Year: 1989, Page(s):530 - 537
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (604 KB)

    A dynamic voting scheme is presented that enhances the availability of replicated files in a distributed system in the presence of network partitions. In such situations, the proposed scheme maintains consistency of replicated files by imposing the following constraint; a node can commit a file update only if its current enclosing group is a majority of the nodes that participated in the most rece... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing vote and quorum assignments for reading and writing replicated data

    Publication Year: 1989, Page(s):271 - 279
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (604 KB)

    The problem is discussed of determining the vote assignment and quorum that yields the highest availability in a system where node availabilities can be different and the mix of the read and write operations is arbitrary. For this purpose, an enumeration algorithm is presented that can be used to find the vote and quorum assignments that need to be considered for achieving optimal availability. An... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification as a query processing technique in the CANDIDE semantic data model

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

    The use of classification and subsumption to process database queries is discussed. The data model, called CANDIDE, is essentially an extended version of the FL-1, KANDOR and BACK, frame-based knowledge representation languages. A novel feature of the approach is that the data-description language and data-manipulation language are identical, thus providing uniform treatment of data objects, query... View full abstract»

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

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

    The authors argue for implementing composition as a primitive operation and present a single-sided composition algorithm that performs join protection and duplicate elimination as one unified operation. They report experimental results that show an operating region in which this algorithm outperforms composition by the standard method. This operating region is characterized by a join result many t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compact representation for file versions: a preliminary report

    Publication Year: 1989, Page(s):321 - 329
    Cited by:  Papers (2)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (592 KB)

    A system is presented for the compact representation of multiple versions of a file. The presentation is in terms of vectors and matrices, which results in conceptual simplicity. Algebraic transformations enable the retrieval process to be optimized for any given version or set of versions, in contrast to always optimizing for the most recent or least recent version. Moreover, any version can be a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Set-oriented disk access to large complex objects

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

    The use of set-oriented disk access whereby a variable-sized set of pages can be fetched or flushed to disk in a single call to the I/O system is proposed. This solution provides fast access to variable-length complex objects, yet retains the advantages of a page-structured buffer pool with a conventional frame size. A set-oriented I/O manager has been implemented in the Darmstadt database kernel ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On software and hardware techniques of data engineering

    Publication Year: 1989, Page(s):208 - 215
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (424 KB)

    Methods are discussed to enhance the efficiency and speed of data compression techniques in DBMS (database management systems). Arithmetic coding utilizes the skewness of character distribution by assigning larger intervals (code ranges) to characters having higher probabilities of occurrence. A scheme is presented which effectively increases the code ranges of individual characters by splitting t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A seamless integration in object-oriented database systems

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

    A discussion is given on the use of object-oriented database systems for supporting database applications such as office information systems, knowledge-based systems, engineering design databases, (computer-aided design/manufacturing), hypermedia and software engineering databases. Typically, the research on object-oriented database systems has been addressed from two different disciplines: the pr... 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.
  • A data model and access method for summary data management

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

    A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple <statistical function, category, summary>, consist of metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. The concept of category (type or class) and the additivity property of statistical ... 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.
  • 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.
  • An object-based query evaluation scheme for deductive databases in massively parallel computing environment

    Publication Year: 1989, Page(s):497 - 504
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (800 KB)

    An algorithm is introduced to evaluate queries in a massively parallel computing environment under an object-based representation of a database. By distributing facts into connected networks of processing elements, it is shown that parallel execution of a query can be achieved in a cooperative way, so that the conventional tuple-by-tuple evaluation can be avoided. Furthermore, it is shown that dep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending a DBMS for geographic applications

    Publication Year: 1989, Page(s):590 - 597
    Cited by:  Papers (9)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (680 KB)

    A method is presented for extending a conventional DBMS (database management system) for geographic applications. The interface language SQL is augmented to allow formulation of queries involving both spatial and nonspatial selection criteria. A novel indexing structure is supported to facilitate query retrieval that is based on spatial proximity. To enable hybrid queries to be evaluated efficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized events in temporal databases

    Publication Year: 1989, Page(s):118 - 125
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (692 KB)

    The concepts of temporal entities and temporal events are distinguished, and the conventional crisp notion of events is extended to define generalized events. Novel definitions are provided for temporal operators used for generalized events. A temporal data model is chosen which is independent of conventional data models, but is similar to temporal data models proposed by other researchers and is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complex and composite objects in CAD/CAM databases

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

    It is shown that the concept of interfaces and the concept of composite objects are based on the same mechanism, an instance inheritance relationship. This relationship is integrated into an object-oriented data model which represents interfaces and composite objects in an easy way. The concept of interfaces is generalized to an abstraction mechanism. This allows some severe drawbacks of a rigid i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of loose coupling in expert database system architectures

    Publication Year: 1989, Page(s):255 - 256
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (220 KB)

    The author maintains that loose AI-DBMS (artificial intelligence-database-management system) coupling will thrive in the future. The specific approaches adopted for the coupling (loose or tight) of AI-DBMS systems will depend on engineering, economic, social, organizational factors. A number of applications involving the processing of knowledge and data are presented and classified in terms of the... 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.
  • Parallel computing; one opportunity, four challenges

    Publication Year: 1989, Page(s):482 - 484
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (236 KB)

    Integration technologies for parallel computing are discussed. Requirements imposed by the need to properly interconnect large numbers of processing elements are emphasized. Four topics discussed as cornerstones in the field of parallel computing are programmability, communication network design, reliable operation, and performance evaluation and benchmarking View full abstract»

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