By Topic

[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.
  • The inter-database instance identification problem in integrating autonomous systems

    Publication Year: 1989, Page(s):46 - 55
    Cited by:  Papers (30)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The issue of joining information about the same instance across disparate databases in a composite information system (CIS) environment is discussed. A technique called interdatabase instance identification is presented that is a combination of database management systems and artificial intelligence techniques. Common attributes in the disparate databases are applied first to reduce the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing operations over mismatched domains

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

    A solution is proposed to the problem of providing support for operations over partially matched domains. Mismatched domains occur when information must be obtained from databases that were developed independently. Domain differences are resolved by mapping conflicting attributes to a common domain and the applying a set of extended relational operations to the resulting values. The values that re... 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 (17)  |  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.
  • 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.
  • Integrating AI and DBMS through stream processing

    Publication Year: 1989, Page(s):259 - 260
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    An approach is presented for integrating AI (artificial intelligence) systems with DBMS (database management systems). The impedance mismatch that has made this integration a problem is, in essence, a difference in the two system models of data processing. The present approach is to avoid the mismatch by forcing both AI systems and DBMS into the common model of stream processing. The approach take... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic query processing in object-oriented databases

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

    Cyclic query processing issues in object-oriented databases are investigated. A data and cyclic query model is defined for an object-oriented database system, using a graph model. Then the efficient processing of a general object-oriented cyclic query is discussed. For efficient processing, a general cyclic query and the access plans generated for a given query are defined and a cost model is deve... 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.
  • 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.
  • The Tangram stream query processing system

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

    Tangram, an environment for modeling which is under development at UCLA, is discussed. One of the driving concepts behind Tangram has been the combination of large-scale data access and data reduction with a powerful programming environment. The Tangram environment is based on PROLOG, extending it with a number of features, including process management, distributed database access, and generalized... 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.
  • A feasibility and performance study of dependency inference [database design]

    Publication Year: 1989, Page(s):635 - 641
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The feasibility of inferring functional dependencies from an example relation is investigated. The problem occurs in the context of automatic database design, when a tool is needed to assist the database designer in the process of specifying logical dependencies. The complexity of the dependency inference problem is inherently exponential. However, algorithms could be developed that perform well w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Read-only transactions in partitioned replicated databases

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

    Environments where read-only transactions predominate update transactions are considered. The notion of a group in replicated databases, the recognition of which maximizes the data availability for read-only transactions in error-prone environments, is developed. It is shown that the group identification problem is NP-complete. Replica control algorithms that attempt to approximately determine gro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An access authorization model for relational databases based on algebraic manipulation of view definitions

    Publication Year: 1989, Page(s):339 - 347
    Cited by:  Papers (7)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A model of access authorization is described for relational databases. In this model access permissions are a form of database knowledge, from which access permissions that apply to specific requests are inferred. Database access is specified in terms of views: a set of views is defined, and each user is granted permission to access one or more views. Users direct queries at the actual database, n... 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.
  • Quasi-partitioning: a new paradigm for transaction execution in partitioned distributed database systems

    Publication Year: 1989, Page(s):546 - 553
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The quasi-partitioning paradigm of operation for partitioned database systems is discussed in which a broken main link between two partitions can be replaced by a much slower backup link (e.g. a dial-up telephone connection). The paradigm solves the problem of preparation for network partitioning. The quasi-partitioning mode of operation has two primitive operations: creeping retrieval and creepin... 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.
  • Communications issues in data engineering: `have bandwidth-will move data'

    Publication Year: 1989
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    It is argued that those areas of data engineering research which are based on the assumption that communication bandwidth is a constraint, should be investigated. Some additional distributed database issues that require reinvestigation include concurrency control, network partitioning, backup storage and recovery algorithms. With the availability of increased bandwidth, global flooding of informat... 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 (17)  |  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.
  • Automatic validation of object-oriented database structures

    Publication Year: 1989, Page(s):2 - 9
    Cited by:  Papers (2)
    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.
  • Towards efficient algorithms for deadlock detection and resolution in distributed systems

    Publication Year: 1989, Page(s):287 - 294
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    A theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds (number of messages) for deadlock detection and resolution are both O(n3) in the worst case when n transactions are involved. This result is better than previous... 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.
  • Measuring the effect of data distribution and replication models on performance evaluation of distributed database systems

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

    The effect of assumptions about data distribution and replication on the performance measures as well as the computational complexity and accuracy of performance evaluations is investigated. The size of the participating node set of a transaction is chosen as the desired performance measure. Probabilistic analysis is used to evaluate six models. It is concluded that even though some of the data di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational division: four algorithms and their performance

    Publication Year: 1989, Page(s):94 - 101
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Three known algorithms for relational division, the algebra operator used to express universal quantification (for-all conditions) and an algorithm called hash-division are outlined. By comparing the algorithms analytically and experimentally, it is shown that the algorithm provides performance competitive with or superior to that of techniques used to date, namely techniques using sorting or aggr... View full abstract»

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