By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 3 • Date May/Jun 2000

Filter Results

Displaying Results 1 - 8 of 8
  • Real-time index concurrency control

    Publication Year: 2000 , Page(s): 429 - 447
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (544 KB)  

    Real time database systems are expected to rely heavily on indexes to speed up data access and thereby help more transactions meet their deadlines. Accordingly, high performance index concurrency control (ICC) protocols are required to prevent contention for the index from becoming a bottleneck. We develop real time variants of a representative set of classical B-tree ICC protocols and, using a de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic taxonomies: a model for large information bases

    Publication Year: 2000 , Page(s): 468 - 479
    Cited by:  Papers (37)  |  Patents (12)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1744 KB)  

    A novel taxonomic model for structuring and accessing large heterogeneous information bases is presented. The model is designed to simplify both classification and access by computer-illiterate people. It defines simple and intuitive operations to access large information bases at the conceptual level and at different levels of abstraction, in a totally assisted way, through a simple, yet effectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid representation of vague collections for distributed object management systems

    Publication Year: 2000 , Page(s): 448 - 467
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (356 KB)  

    An important characteristic of distributed object management systems is that due to network or machine failure, the environment may become partitioned into subenvironments that cannot communicate with each other. In some application scenarios, it is important that the subenvironments remain operable even in this case. In particular, queries should be processed in an appropriate way. To this end, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Response time analysis of OPS5 production systems

    Publication Year: 2000 , Page(s): 391 - 409
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (764 KB)  

    The paper focuses on the problem of determining a priori the maximal response time of rule based programs. The response time analysis problem is an important problem, especially for real time systems. We study this problem in the context of OPS5 production systems. Two aspects of the response time of a program are investigated, the maximal number of rule firings and the maximal number of basic com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load sharing in distributed multimedia-on-demand systems

    Publication Year: 2000 , Page(s): 410 - 428
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (344 KB)  

    Service providers have begun to offer multimedia-on-demand services to residential estates by installing isolated, small-scale multimedia servers at individual estates. Such an arrangement allows the service providers to operate without relying on a highspeed, large-capacity metropolitan area network, which is still not available in many countries. Unfortunately, installing isolated servers can in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering structural association of semistructured data

    Publication Year: 2000 , Page(s): 353 - 371
    Cited by:  Papers (32)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (516 KB)  

    Many semistructured objects are similarly, though not identically structured. We study the problem of discovering “typical” substructures of a collection of semistructured objects. The discovered structures can serve the following purposes: 1) the “table-of-contents” for gaining general information of a source, 2) a road map for browsing and querying information sources, 3)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable parallel data mining for association rules

    Publication Year: 2000 , Page(s): 337 - 352
    Cited by:  Papers (38)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (600 KB)  

    The authors propose two new parallel formulations of the Apriori algorithm (R. Agrawal and R. Srikant, 1994) that is used for computing association rules. These new formulations, IDD and HD, address the shortcomings of two previously proposed parallel formulations CD and DD. Unlike the CD algorithm, the IDD algorithm partitions the candidate set intelligently among processors to efficiently parall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable algorithms for association mining

    Publication Year: 2000 , Page(s): 372 - 390
    Cited by:  Papers (227)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2900 KB)  

    Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. We present efficient algorithms for the discovery of frequent itemsets which forms the compute intensive phase of the task. The algorithms utilize the structural p... 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