By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 2 • March-April 1999

Filter Results

Displaying Results 1 - 7 of 7
  • 1998 TKDE reviewers list

    Publication Year: 1999, Page(s): 360
    Request permission for commercial reuse | PDF file iconPDF (7 KB)
    Freely Available from IEEE
  • Techniques for increasing the stream capacity of a high-performance multimedia server

    Publication Year: 1999, Page(s):284 - 302
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and a high I/O bandwidth. In order to maximize the system utilization, and thus minimize the cost, it is essential that the load be balance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof of the correctness of EMYCIN sequential propagation under conditional independence assumptions

    Publication Year: 1999, Page(s):355 - 359
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    In this paper, we prove that, under the assumption of conditional independence, the EMYCIN formula for sequential propagation can be derived strictly from the definition of the certainty factor according to probability theory. J.B. Adams (1984) and S. Schocken (1988) have proved that the EMYCIN formula for parallel propagation is partially consistent with probability theory. Our result supplements... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic programming in Datalog with aggregates

    Publication Year: 1999, Page(s):265 - 283
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    Dynamic programming is a general technique for solving optimization problems. It is based on the division of problems into simpler subproblems that can be computed separately. In this paper, we show that Datalog with aggregates and other nonmonotonic constructs can express classical dynamic programming optimization problems in a natural fashion, and then we discuss the important classes of queries... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid estimator for selectivity estimation

    Publication Year: 1999, Page(s):338 - 354
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Traditional sampling-based estimators infer the actual selectivity of a query based purely on runtime information gathering, excluding the previously collected information, which underutilizes the information available. Table-based and parametric estimators extrapolate the actual selectivity of a query based only on the previously collected information, ignoring online information, which results i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource scheduling in a high-performance multimedia server

    Publication Year: 1999, Page(s):303 - 320
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    Supporting continuous media data-such as video and audio-imposes stringent demands on the retrieval performance of a multimedia server. In this paper, we propose and evaluate a set of data placement and retrieval algorithms to exploit the full capacity of the disks in a multimedia server. The data placement algorithm declusters every object over all of the disks in the server-using a time-based de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join index hierarchy: an indexing structure for efficient navigation in object-oriented databases

    Publication Year: 1999, Page(s):321 - 337
    Cited by:  Papers (5)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    A novel indexing structure-the join index hierarchy-is proposed to handle the “gotos on disk” problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer-chasing operations into a simple search in an appropriate join index file, and thus accelerates navigation in object-oriented databases. The method extends the jo... 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