By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 7 • July 2004

Filter Results

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

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (59 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
  • Guest Editors' Introduction: Special Section on Peer-to-Peer-Based Data Management

    Publication Year: 2004, Page(s):785 - 786
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (64 KB) | HTML iconHTML
    Freely Available from IEEE
  • The Piazza peer data management system

    Publication Year: 2004, Page(s):787 - 798
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    Intuitively, data management and data integration tools are well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two significant problems: They typically require a comprehensive schema design before they can be used to store or share information and they are difficult to extend because schema evolution is heavyweight and may break backward compat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilient and coherence preserving dissemination of dynamic data using cooperating peers

    Publication Year: 2004, Page(s):799 - 812
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB) | HTML iconHTML

    The focus of our work is to design and build a dynamic data distribution system that is coherence-preserving, i.e. the delivered data must preserve associated coherence requirements (the user-specified bound on tolerable imprecision) and resilient to failures. To this end, we consider a system in which a set of repositories cooperate with each other and the sources, forming a peer-to-peer network.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient semantic-based content search in P2P network

    Publication Year: 2004, Page(s):813 - 826
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB) | HTML iconHTML

    Most existing peer-to-peer (P2P) systems support only title-based searches and are limited in functionality when compared to today's search engines. We present the design of a distributed P2P information sharing system that supports semantic-based content searches of relevant documents. First, we propose a general and extensible framework for searching similar documents in P2P network. The framewo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust-𝒳;: a peer-to-peer framework for trust establishment

    Publication Year: 2004, Page(s):827 - 842
    Cited by:  Papers (110)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1536 KB) | HTML iconHTML

    We present Trust-𝒳;, a comprehensive XML-based framework for trust negotiations, specifically conceived for a peer-to-peer environment. Trust negotiation is a promising approach for establishing trust in open systems like the Internet, where sensitive interactions may often occur between entities at first contact, with no prior knowledge of each other. The framework we propose takes into acco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities

    Publication Year: 2004, Page(s):843 - 857
    Cited by:  Papers (811)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such communities is to use community-based reputations to help estimate the trustworthiness of peers. We present PeerTrust - a reputation-based trust supporting framework, which includes a coherent adaptive trust model for quantifying and comparing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient, self-contained handling of identity in peer-to-peer systems

    Publication Year: 2004, Page(s):858 - 869
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique and deterministic way. Name/directory services, such as DNS, X.500, or UDDI, are a well-established concept to address this problem in distributed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Main memory indexing: the case for BD-tree

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

    We adapt and optimize the BD-tree for main memory data processing. We compare the memory-based BD-tree against the B+-tree and CSB+-tree. We present cost models for exact match query for these indexes, including L2 cache and translation lookahead buffer (TLB) miss model and execution time model. We also implemented these structures and conducted experimental study. Our analyt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A support-ordered trie for fast frequent itemset discovery

    Publication Year: 2004, Page(s):875 - 879
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    The importance of data mining is apparent with the advent of powerful data collection and storage tools; raw data is so abundant that manual analysis is no longer possible. Unfortunately, data mining problems are difficult to solve and this prompted the introduction of several novel data structures to improve mining efficiency. Here, we critically examine existing preprocessing data structures use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology