By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 4 • Dec 1991

Filter Results

Displaying Results 1 - 11 of 11
  • Controlling FD and MVD inferences in multilevel relational database systems

    Publication Year: 1991, Page(s):474 - 485
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1180 KB)

    The authors investigate the inference problems due to functional dependencies (FD) and multivalued dependencies (MVD) in a multilevel relational database (MDB) with attribute and record classification schemes, respectively. The set of functional dependencies to be taken into account in order to prevent FD-compromises is determined. It is proven that incurring minimum information loss to prevent co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning by discovering problem solving heuristics through experience

    Publication Year: 1991, Page(s):415 - 420
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    The authors present a system, called SAFE (strategy acquisition from experience), which incorporates novel methods for discovering domain-dependent problem-solving heuristics. SAFE is implemented as a sorting system whose sorting strategies are represented as production rules. SAFE initially uses the insertion sort strategy to solve problems. After solving each given problem. SAFE learns symbolic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and analysis of a time-stamp history based certification protocol for concurrency control

    Publication Year: 1991, Page(s):525 - 537
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    An examination is made of a technique to derive the time-stamp or interval of time-stamps dynamically by using limited time-stamp history information to re-order transaction at commit time and to derive a back-shifted time-stamp for certification to reduce read-write conflicts. An analytic model to quantify the performance improvement by comparison with the basic time-stamp certification scheme is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental implementation model for relational databases with transaction time

    Publication Year: 1991, Page(s):461 - 473
    Cited by:  Papers (31)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1164 KB)

    An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deductive approximate reasoning systems

    Publication Year: 1991, Page(s):399 - 414
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB)

    A formal deductive view for the theory of approximate reasoning, called AR-1, is introduced. A central feature of this framework is the view of propositions as statements involving the assignment of possible values to variables. A unified method for managing joint variables is given. AR-2, which allows for the introduction of probability theory into approximate reasoning, is presented. AR-5, a res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal data management systems: a comparative view

    Publication Year: 1991, Page(s):504 - 524
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1828 KB)

    Characteristics and requirements of systems for temporal data management in the areas of data and knowledge bases, artificial intelligence, and software engineering are investigated and discussed on the basis of a case study. Six representative approaches were selected for this analysis, with the goal of identifying particular features of systems proposed in different areas. The six approaches are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MORE: an object-oriented data model with a facility for changing object structures

    Publication Year: 1991, Page(s):444 - 460
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1928 KB)

    An object-oriented data model, MORE, in which the database specification facilities have been extended so that users can specify an object with various structures is presented. The structure of an object is changed by passing messages. MORE also provides a classtype, a user-defined type for classes with similar structures, in order to simplify the specification of class descriptions. The system ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pipeline N-way join algorithm based on the 2-way semijoin program

    Publication Year: 1991, Page(s):486 - 495
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    The semijoin has been used as an effective operator in reducing data transmission and processing over a network that allows forward size reduction of relations and intermediate results generated during the processing of a distributed query. The authors propose a relational operator, two-way semijoin, which enhanced the semijoin with backward size reduction capability for more cost-effective query ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Creating domain specific metadata for scientific data and knowledge bases

    Publication Year: 1991, Page(s):421 - 434
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 KB)

    The authors examine a particular type of domain-based metadata for which a complete ready-made conceptual framework is not and probably cannot be directly supported in predefined data models of knowledge-based representation paradigms. The data or knowledge base designer thus has the burden of sometimes working outside a familiar and otherwise appropriate model. The authors discuss issues arising ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational complexity of sorting and joining relations with duplicates

    Publication Year: 1991, Page(s):496 - 503
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    It is shown that the existence of duplicate values in some attribute columns has a significant impact on the computational complexity of the sorting and joining operations. This is especially true when the number of distinct tuple values is a small fraction of the total number of tuples. The authors characterize a multirelation M (n, L) by its cardinality n and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal state space search in parallel production systems

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

    A methodology for transforming the original search space into an equivalent but minimal search space is proposed. First, the concept of dependences leads to a procedure for reduction of the search space. The search procedure using this method can produce a minimal and complete search space. It is shown that this method is applicable to parallel search as well. An added advantage of this method is ... View full abstract»

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

Aims & Scope

IEEE Transactions on Knowledge and Data Engineering (TKDE) informs researchers, developers, managers, strategic planners, users, and others interested in state-of-the-art and state-of-the-practice activities in the knowledge and data engineering area.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology