Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 2 • Apr 1993

Filter Results

Displaying Results 1 - 14 of 14
  • Garbage collection in a distributed object-oriented system

    Publication Year: 1993, Page(s):257 - 265
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    An algorithm for garbage collection in distributed systems with object sharing across processor boundaries is described. The algorithm allows local garbage collection at each node in the system to proceed independently of local collection at the other nodes. It requires no global synchronization or knowledge of the global state of the system and exhibits the capability for graceful degradation. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coupling production systems and database systems: a homogeneous approach

    Publication Year: 1993, Page(s):240 - 256
    Cited by:  Papers (12)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1496 KB)

    Methods for storing and manipulating large rule bases using a relational database management systems (DBMS) are discussed. An approach to decomposing and storing the condition elements in the antecedents of rules such as those used in production rule-based systems is presented. A set-oriented approach, DBCond, which uses a special data structure that is implemented using relations is proposed. A m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A possible world semantics for disjunctive databases

    Publication Year: 1993, Page(s):282 - 292
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    The fundamental problem that arises when a ground atom in a disjunctive database is assumed false is discussed. There are basically two different approaches for inferring negative information for disjunctive databases: J. Minker's (1982) generalized closed world assumption (GCWA) and K.A. Ross and R.W. Topor's (1988) disjunctive database rule (DDR). It is argued that neither approach is satisfacto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge representation model for multiuser knowledge-based systems

    Publication Year: 1993, Page(s):177 - 189
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    A description is given of a multiuser knowledge-based system (MKBS) model. In this system, knowledge is represented in a collection of interlinked, largely autonomous user knowledge bases (UKBs) and supports use of the system by multipole heterogeneous users. The UKBs are defined so that while each user's view of the knowledge base is limited to the local UKB, problem solving can be achieved using... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parsing electronic circuits in a logic grammar

    Publication Year: 1993, Page(s):225 - 239
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    Understanding circuits is a prerequisite for circuit design and trouble shooting. Circuit understanding by engineers is described as a process that starts with a structural analysis and then proceeds to a causal analysis. As a step toward automatic circuit understanding, a method for analyzing circuit structures is presented. In this method, a circuit is reviewed as a sentence and its elements as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing inference control by hypothesis-based association

    Publication Year: 1993, Page(s):363 - 367
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    An approach for representing inference control is presented. It is proposed that the representation of inference control should consist of two levels: planning level which realizes problem solving strategies, and a performing level, which represents inference tactics. Based on this approach, the representation system hypothesis-based associative representation (HAR) has been developed to realize t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast in-place verification of data dependencies

    Publication Year: 1993, Page(s):266 - 281
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1320 KB)

    Several fast and space-optimal sequential and parallel algorithms for solving the satisfaction problem of functional and multivalued dependencies (FDs and MVDs) are presented. Two frameworks to verify an MVD for a relation and their implementation by exploring the existing fast space-optimal sorting techniques are described. The space optimality means that only a constant amount of extra memory sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incomplete relational database models based on intervals

    Publication Year: 1993, Page(s):293 - 308
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1356 KB)

    Tables are used to represent unknown relations. The three partial tuple types are defined in a table to specify incompleteness relationships among tuples of the same table. For tuples of different tables, the cases where incompleteness is introduced at the relation level, tuple level, or attribute value level are discussed. For each of the models, it is shown that query evaluation is sound in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical organization of knowledge with inconsistent and undecidable algorithms using imaginary and transfinite exponential number forms in a non-Boolean field-I. Basic principles

    Publication Year: 1993, Page(s):190 - 203
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1372 KB)

    In order to consider the organization of knowledge using inconsistent algorithms, a mathematical set-theoretic definition of axioms and undecidability is discussed. Ways in which imaginary numbers, exponentials, and transfinite ordinals can be given logical meanings that result in a new way to definite axioms are presented. This presentation is based on a proposed logical definition for axioms tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Obtaining coteries that optimize the availability of replicated databases

    Publication Year: 1993, Page(s):309 - 321
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1164 KB)

    Techniques for implementing the coterie scheme and for obtaining optimal coteries for a system are presented. Central to the techniques is the notion of an acceptance set, which is an alternative representation of the information contained in a coterie. Using this concept, the coterie scheme can be implemented efficiently, and an optimal coterie for a system can be obtained more directly. The prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating performance and quality of knowledge-based systems: foundation and methodology

    Publication Year: 1993, Page(s):204 - 224
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2052 KB)

    A survey of knowledge-based system (KBS) evaluation methods is presented. The authors argue that these methods are partial, poorly systematic, and not easily applicable. An approach to KBS evaluation that comprises a precise definition of the concepts of performance and quality, a general evaluation methodology, and a set of criteria to support its practical application is presented. The proposed ... View full abstract»

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

    Publication Year: 1993, Page(s):322 - 338
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1516 KB)

    A practical join processing strategy that allows effective utilization of arbitrary degrees of parallelism in both the I/O subsystem and join processing subsystems is presented. Analytic bounds on the minimum execution time, minimum number of processors, and processor utilization are presented along with bounds on the execution time, given a fixed number of processors. These bounds assume that suf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for matching multiple patterns

    Publication Year: 1993, Page(s):339 - 351
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    An efficient algorithm for performing multiple pattern match in a string is described. The match algorithm combines the concept of deterministic finite state automata (DFSA) and the Boyer-Moore algorithm to achieve better performance. Experimental results indicate that in the average case, the algorithm is able to perform pattern match operations sublinearly, i.e. it does not need to inspect every... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ancestor controlled submodule inclusion in design databases

    Publication Year: 1993, Page(s):352 - 362
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    A paradigm is proposed for representing hierarchically specified design data in CAD database systems in which there are alternate expansions of hierarchically specified modules. The paradigm uses an ancestor-based scheme to control which instances of submodules are to be placed in the expansion of each instance of a given module and is formalized using a versioned directed acyclic multigraph (VDAG... 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