By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 3 • Date Jun 1993

Filter Results

Displaying Results 1 - 14 of 14
  • Investigating the applicability of Petri nets for rule-based system verification

    Publication Year: 1993, Page(s):402 - 415
    Cited by:  Papers (54)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB)

    It is suggested that as rule-based system (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. An approach to RBS verification in which the system is modeled as a Petri net on which error detection is performed is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining joint and semi-join operations for distributed query processing

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

    The application of a combination of join and semi-join operations to minimize the amount of data transmission required for distributed query processing is discussed. Specifically, two important concepts that occur with the use of join operations as reducers in query processing, namely, gainful semi-joins and pure joint attributes, are used. Some semi-joint, though not profitable themselves, may be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deductive entity relationship modeling

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

    An entity relationship oriented model, that includes the notion of class, together with different types of assertions on classes, is presented. The assertions are used to model IS-A and disjointness relations both between entities and between relationships, part-of relations between entities and relationships, mandatory participation of an entity in a relationship, and interdependencies between th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge representation for natural language understanding: the L LILOG approach

    Publication Year: 1993, Page(s):386 - 401
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    The logic-based knowledge representation language LLILOG, which is used to represent both the semantic background knowledge as well as the information extracted from German texts within the LILOG project, is discussed. LLILOG integrates frame-like features-value descriptions used in computational linguistics into an order-sorted predicated logic framework. The basis design pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On robustness of B-trees

    Publication Year: 1993, Page(s):530 - 534
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    A method is presented to detect index corruption and pointer corruption in B+-trees. The method uses the semantic information of indices and requires no extra pointers to be added to the data structure. Previous research on the robustness on B-trees has considered index corruption and pointer corruption separately and required extra pointers to be added to the data structure to achieve ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Manager Associate [IKBS]

    Publication Year: 1993, Page(s):426 - 438
    Cited by:  Papers (5)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1192 KB)

    The knowledge-based Manager Associate, which assists managers in planning, organizing, staffing, scheduling, measuring, visualizing, and controlling software development processes, is described. The Manager Associate operates in a distributed Unix environment in which the manager has access to the software developer workstations through a computer network. The Manager Associate helps managers anti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for putting strategic common sense into expert systems

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

    Strategic common sense is defined as the heuristic considerations human experts often apply to decide which choice is the most opportune to make from a set of possible alternatives. A method for acquiring modeling, and representing human strategic common sense in diagnostic expert systems is presented. The preference parameter and preference criterion tools, which are used to define a basic level ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal foundations for object-oriented data modeling

    Publication Year: 1993, Page(s):462 - 478
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1572 KB)

    Class dictionary graphs, axiomatic definitions of basic structures used by object-oriented designers and programmers during the software development process, are discussed. An axiomatic foundation for object-oriented data modeling and efficient algorithms for checking whether a given data model satisfies the axioms are presented. The data model is the foundation for a number of techniques for deve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and distributed processing of rules by data-reduction

    Publication Year: 1993, Page(s):523 - 530
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    The parallel evaluation of datalog rule programs, mainly by processors that are interconnected by a communication network, is discussed. Data-reduction, a paradigm for the parallel evaluation of a datalog program, is introduced. Parallelization is accomplished by partitioning the rule-instantiations among the processors. After presenting the paradigm, its implementation with seminaive evaluation, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical inference of Horn clauses in Petri net models

    Publication Year: 1993, Page(s):416 - 425
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    Petri net models for the Horn clause form of propositional logic and of first-order predicate logic are studied. A net model for logical inconsistency check is proposed. Algorithms for computing T-invariants of Petri net models of logical inference systems are investigated. The algorithms are based on the idea of resolution and exploit the presence of one-literal, pure-literal, and splitting claus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RQL: a recursive query language

    Publication Year: 1993, Page(s):451 - 461
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB)

    Different classes of recursive queries in the relational databases are identified. It is shown that existing proposals to extend the relational query languages are either not powerful enough to express queries in many of these classes or use nonfirst normal form constructs. RQL, a recursive database query language that can be used to express recursive queries on all the classes identified, is pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation and optimization of query programs in an object-oriented and symbolic information system

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

    OASIS, a database programming environment that extends UNIX with the concept of persistent objects, is discussed. The OASIS query languages extend conventional database query languages with procedural methods and general control statements. As the complexity of the languages makes it difficult to device a query optimizer based on a universally applicable algorithm, each query in OASIS is optimized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient indexing methods for temporal relations

    Publication Year: 1993, Page(s):496 - 509
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1212 KB)

    The primary issues that affect the design of indexing methods are examined, and several structures and algorithms for specific cases are proposed. The append-only tree (AP-tree) structure indexes data for append-only databases to help event-join optimization and queries that can exploit the inherent time ordering of such databases. Two variable indexing for the surrogate and time is discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of index partitioning schemes on the performance of distributed query processing

    Publication Year: 1993, Page(s):510 - 522
    Cited by:  Papers (2)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1148 KB)

    An indexing scheme called partitioned global indexes (PGI) for a locally distributed database system is presented. The scheme builds a global index for the entire relation and partitions the index across the sites. A strategy for processing such an index is also presented. In order to evaluate the performance of the scheme, a simulation model is developed. The simulation results are compared to th... 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
Jian Pei
Simon Fraser University

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

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