By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 6 • Date Nov.-Dec. 1997

Filter Results

Displaying Results 1 - 13 of 13
  • Author index

    Publication Year: 1997, Page(s):1 - 9
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Efficient scheduling of page access in index-based join processing

    Publication Year: 1997, Page(s):1005 - 1011
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    The paper examines the issue of scheduling page accesses in join processing, and proposes new heuristics for the following scheduling problems: 1) an optimal page access sequence for a join such that there are no page reaccesses using the minimum number of buffer pages, and 2) an optimal page access sequence for a join such that the number of page reaccesses for a given number of buffer pages is m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method of learning implication networks from empirical data: algorithm and Monte-Carlo simulation-based validation

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

    The paper describes an algorithmic means for inducing implication networks from empirical data samples. The induced network enables efficient inferences about the values of network nodes if certain observations are made. This implication induction method is approximate in nature as probabilistic network requirements are relaxed in the construction of dependence relationships based on statistical t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Content-based indexing of multimedia databases

    Publication Year: 1997, Page(s):978 - 989
    Cited by:  Papers (17)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    Content-based retrieval of multimedia database calls for content-based indexing techniques. Different from conventional databases, where data items are represented by a set of attributes of elementary data types, multimedia objects in multimedia databases are represented by a collection of features; similarity of object contents depends on context and frame of reference; and features of objects ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema evolution of an object-oriented real-time database system for manufacturing automation

    Publication Year: 1997, Page(s):956 - 977
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    Database schemata often experience considerable changes during the development and initial use phases of database systems for advanced applications such as manufacturing automation and computer-aided design. An automated schema evolution system can significantly reduce the amount of effort and potential errors related to schema changes. Although schema evolution for nonreal-time databases was the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Case-based reasoning systems: from automation to decision-aiding and stimulation

    Publication Year: 1997, Page(s):911 - 922
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Over the past decade, case-based reasoning (CBR) has emerged as a major research area within the artificial intelligence research field due to both its widespread usage by humans and its appeal as a methodology for building intelligent systems. Conventional CBR systems have been largely designed as automated problem-solvers for producing a solution to a given problem by adapting the solution to a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boolean similarity measures for resource discovery

    Publication Year: 1997, Page(s):863 - 876
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    As the number of Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. The authors develop a new method to rank Internet servers for Boolean queries. Their method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. They contrast it with other known methods and describe its implementati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query optimization in multidatabase systems considering schema conflicts

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

    In a multidatabase system, the participating databases are autonomous. The schemas of these databases may be different in various ways, while the same information is represented. A global query issued against the global database needs to be translated to a proper form before it can be executed in a local database. Since data requested by a query (or a part of a query) is sometimes available in mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implication and referential constraints: a new formal reasoning

    Publication Year: 1997, Page(s):894 - 910
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    The authors address the issue of reasoning with two classes of commonly used semantic integrity constraints in database and knowledge-base systems: implication constraints and referential constraints. They first consider a central problem in this respect, the IRC-refuting problem, which is to decide whether a conjunctive query always produces an empty relation on (finite) database instances satisf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized production rules as a basis for integrating active and deductive databases

    Publication Year: 1997, Page(s):848 - 862
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The authors address the problem of providing a homogeneous framework for integrating, in a database environment, active rules, which allow the specification of actions to be executed whenever certain events take place, and deductive rules, which allow the specification of deductions in a logic programming style. Actually, it is widely recognized that both kinds of rules enhance the capabilities of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategic reasoning under trade-offs between action costs and advantages

    Publication Year: 1997, Page(s):923 - 940
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The paper proposes a model for making the most opportune choice among a number of alternatives in situations involving trade-offs and uncertainty. Alternative actions are evaluated on the basis of strategic attributes, such as cost and effectiveness, and the choice is dynamically determined. The issue is addressed by proposing a set of rules (trade-off rules) representing strategic knowledge speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-order pattern discovery from discrete-valued data

    Publication Year: 1997, Page(s):877 - 893
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    To uncover qualitative and quantitative patterns in a data set is a challenging task for research in the area of machine learning and data analysis. Due to the complexity of real-world data, high-order (polythetic) patterns or event associations, in addition to first-order class-dependent relationships, have to be acquired. Once the patterns of different orders are found, they should be represente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QUEM: an achievement test for knowledge-based systems

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

    This paper describes the Quality and Experience Metric (QUEM), a method for estimating the skill level of a knowledge based system based on the quality of the solutions it produces. It allows one to assess how many years of experience the system would be judged to have if it were a human by providing a quantitative measure of the system's overall competence. QUEM can be viewed as a type of achieve... 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