By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 4 • Date Jul/Aug 1997

Filter Results

Displaying Results 1 - 14 of 14
  • Establishing the relevancy of the bookkeeping libraries to the functional testing of computer implementations

    Publication Year: 1997, Page(s):646 - 652
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    We address issues related to the definition of faults, errors and failures and their separability, and attribution to the different development processes of computing systems. In particular, we deal with historical databases, which presumably contain certain data (i.e., test failure data) and describe the methodology that can be used to analyze the database and obtain the pertinent information. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature selection via discretization

    Publication Year: 1997, Page(s):642 - 645
    Cited by:  Papers (121)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    Discretization can turn numeric attributes into discrete ones. Feature selection can eliminate some irrelevant and/or redundant attributes. Chi2 is a simple and general algorithm that uses the χ 2 statistic to discretize numeric attributes repeatedly until some inconsistencies are found in the data. It achieves feature selection via discretization. It can handle mixed attributes, wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical study of domain knowledge and its benefits to substructure discovery

    Publication Year: 1997, Page(s):575 - 586
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working with a database in their area of expertise often search for predetermined types of structures or for structures exhibiting characteristics specific to the domain. The paper presents a method for guiding the discovery process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transparent schema-evolution system based on object-oriented view technology

    Publication Year: 1997, Page(s):600 - 624
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    When a database is shared by many users, updates to the database schema are almost always prohibited because there is a risk of making existing application programs obsolete when they run against the modified schema. The paper addresses the problem by integrating schema evolution with view facilities. When new requirements necessitate schema updates for a particular user, then the user specifies s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiprocessor document allocation: a genetic algorithm approach

    Publication Year: 1997, Page(s):640 - 642
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    We formally define the Multiprocessor Document Allocation Problem (MDAP) and prove it to be computationally intractable (NP complete). Once it is shown that MDAP is NP complete, we describe a document allocation algorithm based on genetic algorithms. This algorithm assumes that the documents are clustered using any one of the many clustering techniques. We later show that our allocation algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authorization and revocation in object-oriented databases

    Publication Year: 1997, Page(s):668 - 672
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    Few studies of object-oriented databases deal with their security, a fundamental aspect of systems with complex data structures. Most authorization systems give users who own resources only some basic control over them; here, we provide users with more direct control over their resources by associating with each grant propagation numbers. Propagation numbers govern the grantability and exercisabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of tabled evaluation with delaying in Prolog

    Publication Year: 1997, Page(s):559 - 574
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Unlike SLD resolution as implemented in Prolog, tabled evaluation with delaying guarantees termination for function free logic programs, avoids repeated computation of identical subqueries, and handles recursion through negation. It is often used in query processing and nonmonotonic reasoning where termination is required. The paper presents a new technique for incorporating tabled evaluation into... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cell suppression methodology: the importance of suppressing marginal totals

    Publication Year: 1997, Page(s):513 - 523
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Safeguarding confidential information is of paramount concern to government agencies in publishing statistical data. Given a set of sensitive cells, the problem is to identify a set of complementary cells to suppress so as to mask the values of the sensitive cells. All of the existing cell suppression methods fail to consider the relationships among cell values and the representation of these rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The NUMA with clusters of processors for parallel join

    Publication Year: 1997, Page(s):653 - 660
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A number of hybrid systems have been proposed to combine the advantages of shared nothing and shared everything concepts for computing relational join operations. Most of these proposed systems, however, presented a few analytical results and have produced limited or no implementations on actual multiprocessors. In this paper, we present a parallel join algorithm with load-balancing for a hybrid s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programming with logical queries, bulk updates, and hypothetical reasoning

    Publication Year: 1997, Page(s):587 - 599
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    The paper presents a language of update programs that integrates logical queries, bulk updates and hypothetical reasoning in a seamless manner. There is no syntactic or semantic distinction between queries and updates. Update programs extend logic programs with negation in both syntax and semantics. They allow bulk updates in which an arbitrary update is applied simultaneously for all answers of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent critic system for architectural design

    Publication Year: 1997, Page(s):625 - 639
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    The paper describes an intelligent computer aided architectural design system (ICAAD) called ICADS. ICADS encapsulates different types of design knowledge into independent “critic” modules. Each “critic” module possesses expertise in evaluating an architect's work in different areas of architectural design and can offer expert advice when needed. This research focuses on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information flow control in object-oriented systems

    Publication Year: 1997, Page(s):524 - 538
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    We describe a high assurance discretionary access control model for object oriented systems. The model not only ensures protection against Trojan horses leaking information, but provides the flexibility of discretionary access control at the same time. The basic idea of our approach is to check all information flows among objects in the system in order to block possible illegal flows. An illegal f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a pattern-oriented model for intrusion detection

    Publication Year: 1997, Page(s):661 - 667
    Cited by:  Papers (29)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Operational security problems, which are often the result of access authorization misuse, can lead to intrusion in secure computer systems. We motivate the need for pattern-oriented intrusion detection, and present a model that tracks both data and privilege flows within secure systems to detect context-dependent intrusions caused by operational security problems. The model allows the uniform repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deductive environment for dealing with objects and nonmonotonic reasoning

    Publication Year: 1997, Page(s):539 - 558
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    The Bottom-up Query machine (BQM)-the role played by our system in the framework of the KIWIS system (K. Apt et al., 1987)-extends deductive database technology with knowledge structuring capabilities to provide an advanced environment for the development of data and knowledge based applications. The system relies on a knowledge representation language that combines the declarativeness of logic pr... 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