By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 11 • Date Nov. 2004

Filter Results

Displaying Results 1 - 15 of 15
  • [Front cover]

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • Index selection for databases: a hardness study and a principled heuristic solution

    Publication Year: 2004, Page(s):1313 - 1323
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    We study the index selection problem: Given a workload consisting of SQL statements on a database, and a user-specified storage constraint, recommend a set of indexes that have the maximum benefit for the given workload. We present a formal statement for this problem and show that it is computationally "hard" to solve or even approximate it. We develop a new algorithm for the problem which is base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Augmenting a conceptual model with geospatiotemporal annotations

    Publication Year: 2004, Page(s):1324 - 1338
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB) | HTML iconHTML

    While many real-world applications need to organize data based on space (e.g., geology, geomarketing, environmental modeling) and/or time (e.g., accounting, inventory management, personnel management), existing conventional conceptual models do not provide a straightforward mechanism to explicitly capture the associated spatial and temporal semantics. As a result, it is left to database designers ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modeling technique for the performance analysis of Web searching applications

    Publication Year: 2004, Page(s):1339 - 1356
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1488 KB) | HTML iconHTML

    This paper proposes a methodological approach for the performance analysis of Web-based searching applications on the Internet. It specifically investigates the behavior of the client/server (C/S), remote-evaluation (REV) and mobile-agent (MA) communication paradigms and describes how Petri-net models can be developed to derive performance indices which can help the designer to improve the efficie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hierarchical degree-of-visibility tree

    Publication Year: 2004, Page(s):1357 - 1369
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1480 KB) | HTML iconHTML

    In this paper, we present a novel structure called the hierarchical degree-of-visibility tree (HDoV-tree) for visibility query processing in visualization systems. The HDoV-tree builds on and extends the R-tree such that 1) the search space is pruned based on the degree of visibility of objects and 2) internal nodes store level-of-details (LoDs) that represent a collection of objects in a coarser ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cluster analysis for gene expression data: a survey

    Publication Year: 2004, Page(s):1370 - 1386
    Cited by:  Papers (336)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    DNA microarray technology has now made it possible to simultaneously monitor the expression levels of thousands of genes during important biological processes and across collections of related samples. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HARP: a practical projected clustering algorithm

    Publication Year: 2004, Page(s):1387 - 1397
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    In high-dimensional data, clusters can exist in subspaces that hide themselves from traditional clustering methods. A number of algorithms have been proposed to identify such projected clusters, but most of them rely on some user parameters to guide the clustering process. The clustering accuracy can be seriously degraded if incorrect values are used. Unfortunately, in real situations, it is rarel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information retrieval in document image databases

    Publication Year: 2004, Page(s):1398 - 1410
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1832 KB) | HTML iconHTML

    With the rising popularity and importance of document images as an information source, information retrieval in document image databases has become a growing and challenging problem. In this paper, we propose an approach with the capability of matching partial word images to address two issues in document image retrieval: word spotting and similarity measurement between documents. First, each word... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of edge caching/off loading for dynamic content delivery

    Publication Year: 2004, Page(s):1411 - 1423
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB) | HTML iconHTML

    As dynamic content becomes increasingly dominant, it becomes an important research topic as how the edge resources such as client-side proxies, which are otherwise underutilized for such content, can be put into use. However, it is unclear what will be the best strategy, and the design/deployment trade offs lie therein. In this paper, using one representative e-commerce benchmark, we report our ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining sequential patterns by pattern-growth: the PrefixSpan approach

    Publication Year: 2004, Page(s):1424 - 1440
    Cited by:  Papers (269)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB) | HTML iconHTML

    Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Most of the previously developed sequential pattern mining methods, such as GSP, explore a candidate generation-and-test approach [R. Agrawal et al. (1994)] to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View adaptation in the fragment-based approach

    Publication Year: 2004, Page(s):1441 - 1455
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1928 KB) | HTML iconHTML

    View adaptation relies on adapting a set of materialized views in response to schema changes of source relations and/or after view redefinition. Recently, several view selection methods that are based on materializing fragments of the view rather than the whole view have been proposed. We call this approach the fragment-based approach. This paper presents a view adaptation method in the fragment-b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for Special Issue on Intelligent Data Preparation

    Publication Year: 2004, Page(s): 1456
    Request permission for commercial reuse | PDF file iconPDF (31 KB) | HTML iconHTML
    Freely Available from IEEE
  • TKDE Information for authors

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE

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