By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 12 • Date Dec. 2011

Filter Results

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

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

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Guest Editors Introduction: Special Section on Keyword Search on Structured Data

    Publication Year: 2011, Page(s):1761 - 1762
    Request permission for commercial reuse | PDF file iconPDF (96 KB) | HTML iconHTML
    Freely Available from IEEE
  • SPARK2: Top-k Keyword Query in Relational Databases

    Publication Year: 2011, Page(s):1763 - 1780
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2437 KB) | HTML iconHTML

    With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assembled from multiple relational tables, traditional IR-style ranking and query evaluation methods cannot be applied directly. In this paper, we study the effectiveness and the efficiency issues of answering top-k keyword query... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding Top-k Answers in Keyword Search over Relational Databases Using Tuple Units

    Publication Year: 2011, Page(s):1781 - 1794
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2289 KB) | HTML iconHTML

    Existing studies on keyword search over relational databases usually find Steiner trees composed of connected database tuples as answers. They on-the-fly identify Steiner trees by discovering rich structural relationships between database tuples, and neglect the fact that such structural relationships can be precomputed and indexed. Recently, tuple units are proposed to improve search efficiency b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Keyword-Based Search for Top-K Cells in Text Cube

    Publication Year: 2011, Page(s):1795 - 1810
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1815 KB) | HTML iconHTML

    Previous studies on supporting free-form keyword queries over RDBMSs provide users with linked structures (e.g., a set of joined tuples) that are relevant to a given keyword query. Most of them focus on ranking individual tuples from one table or joins of multiple tables containing a set of keywords. In this paper, we study the problem of keyword search in a data cube with text-rich dimension(s) (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Returning Clustered Results for Keyword Search on XML Documents

    Publication Year: 2011, Page(s):1811 - 1825
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1784 KB) | HTML iconHTML

    Keyword search is an effective paradigm for information discovery and has been introduced recently to query XML documents. In this paper, we address the problem of returning clustered results for keyword search on XML documents. We first propose a novel semantics for answers to an XML keyword query. The core of the semantics is the conceptually related relationship between keyword matches, which i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fuzzy Logic Approach to Wrapping PDF Documents

    Publication Year: 2011, Page(s):1826 - 1841
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1567 KB) | HTML iconHTML

    The PDF format represents the de facto standard for print-oriented documents. In this paper, we address the problem of wrapping PDF documents, which raises new challenges in several contexts of text data management. Our proposal is based on a novel bottom-up hierarchical wrapping approach that exploits fuzzy logic to handle the “uncertainty” which is intrinsic to the structure and pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Spectrum-Based Framework for Quantifying Randomness of Social Networks

    Publication Year: 2011, Page(s):1842 - 1856
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1486 KB) | HTML iconHTML

    Social networks tend to contain some amount of randomness and some amount of nonrandomness. The amount of randomness versus nonrandomness affects the properties of a social network. In this paper, we theoretically analyze graph randomness and present a framework which provides a series of nonrandomness measures at levels of edge, node, subgraph, and the overall graph. We show that graph nonrandomn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anomalous Window Discovery for Linear Intersecting Paths

    Publication Year: 2011, Page(s):1857 - 1871
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1433 KB)

    The focus of this paper is to discover anomalous windows in linear intersecting paths. Anomalous windows are the contiguous groupings of data points. A linear path refers to a path represented by a line with a single dimensional spatial coordinate marking an observation point. In this paper, we propose an approach for discovering anomalous windows using a class of algorithms based on scan statisti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materialization and Decomposition of Dataspaces for Efficient Search

    Publication Year: 2011, Page(s):1872 - 1887
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1367 KB) | HTML iconHTML

    Dataspaces consist of large-scale heterogeneous data. The query interface of accessing tuples should be provided as a fundamental facility by practical dataspace systems. Previously, an efficient index has been proposed for queries with keyword neighborhood over dataspaces. In this paper, we study the materialization and decomposition of dataspaces, in order to improve the query efficiency. First,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Producing High and Early Result Throughput in Multijoin Query Plans

    Publication Year: 2011, Page(s):1888 - 1902
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1117 KB) | HTML iconHTML

    This paper introduces an efficient framework for producing high and early result throughput in multijoin query plans. While most previous research focuses on optimizing for cases involving a single join operator, this work takes a radical step by addressing query plans with multiple join operators. The proposed framework consists of two main methods, a flush algorithm and operator state manager. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics of Ranking Queries for Probabilistic Data

    Publication Year: 2011, Page(s):1903 - 1917
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1350 KB) | HTML iconHTML Multimedia Media

    Recently, there have been several attempts to propose definitions and algorithms for ranking queries on probabilistic data. However, these lack many intuitive properties of a top-k over deterministic data. We define several fundamental properties, including exact-k, containment, unique rank, value invariance, and stability, which are satisfied by ranking queries on certain data. We argue that thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Transactions on Computers EssentialSets Available

    Publication Year: 2011, Page(s): 1918
    Request permission for commercial reuse | PDF file iconPDF (385 KB)
    Freely Available from IEEE
  • ePUB available for all Magazines and Transactions

    Publication Year: 2011, Page(s): 1919
    Request permission for commercial reuse | PDF file iconPDF (161 KB)
    Freely Available from IEEE
  • Stay Connected with the IEEE Computer Society [advertisement]

    Publication Year: 2011, Page(s): 1920
    Request permission for commercial reuse | PDF file iconPDF (297 KB)
    Freely Available from IEEE
  • TKDE Information for authors

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

    Publication Year: 2011, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (179 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