By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 8 • Date Aug. 2010

Filter Results

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

    Publication Year: 2010 , Page(s): c1
    Request Permissions | PDF file iconPDF (158 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2010 , Page(s): c2
    Request Permissions | PDF file iconPDF (206 KB)  
    Freely Available from IEEE
  • Guest Editor's Introduction to the Special Section on the IEEE International Conference on Data Engineering

    Publication Year: 2010 , Page(s): 1057 - 1058
    Request Permissions | PDF file iconPDF (80 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Projective Distribution of XQuery with Updates

    Publication Year: 2010 , Page(s): 1059 - 1076
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4672 KB) |  | HTML iconHTML  

    We investigate techniques to automatically decompose any XQuery query-including updating queries specified by the XQuery Update Facility (XQUF)-into subqueries, that can be executed near their data sources, i.e., function-shipping. The main challenge addressed here is to ensure that the decomposed queries properly respect XML node identity and preserve structural properties, when (parts of) XML no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards an Effective XML Keyword Search

    Publication Year: 2010 , Page(s): 1077 - 1092
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1920 KB) |  | HTML iconHTML  

    Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: 1) Identify the user search intention, i.e., identify the XML node types that user wants to search for and search via. 2) Resolve keyword ambiguity problems: a keyword can appe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams

    Publication Year: 2010 , Page(s): 1093 - 1109
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2609 KB) |  | HTML iconHTML  

    Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network traffic data, and pattern matching over users' visiting logs. However, most of the existing works focus on search over static graph databases, while in many real applications, graphs are changing over time. In this paper,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Join Operators for Result Rate Optimization on Streaming Inputs

    Publication Year: 2010 , Page(s): 1110 - 1125
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2702 KB) |  | HTML iconHTML  

    Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data are provided by autonomous data sources through heterogeneous network environments. Their main advantage over traditional join techniques is that they can start producing join results as soon as the first input tuples are available, thus, improving pipelining by smoothing join result production ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining Recursive Views of Regions and Connectivity in Networks

    Publication Year: 2010 , Page(s): 1126 - 1141
    Cited by:  Patents (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2823 KB) |  | HTML iconHTML  

    The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguous regions, declarative networks that maintain shortest paths, and distributed and peer-to-peer stream systems that detect transitive relationships among data at the distributed sources. In each case, the fundamental operatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Histograms and Wavelets on Probabilistic Data

    Publication Year: 2010 , Page(s): 1142 - 1157
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1593 KB) |  | HTML iconHTML  

    There is a growing realization that uncertain information is a first-class citizen in modern database management. As such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data reduction techniques that can produce concise, accurate synopses of large probabilistic relations are crucial. Similar to their deterministic relation counterparts, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query Processing Using Distance Oracles for Spatial Networks

    Publication Year: 2010 , Page(s): 1158 - 1175
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1979 KB) |  | HTML iconHTML  

    The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding shortest paths and finding nearest neighbors. The challenge here is that the efficient execution of spatial operations usually involves the computation of distance along a spatial network instead of "as the crow flies,&#x... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BinRank: Scaling Dynamic Authority-Based Search Using Materialized Subgraphs

    Publication Year: 2010 , Page(s): 1176 - 1190
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2651 KB) |  | HTML iconHTML  

    Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases, and the Web. Conceptually, these algorithms require a query-time PageRank-style iterative computation over the full graph. This computation is too expensive for large graphs, and not feasible at query time. Alt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multimodal Fusion for Video Search Reranking

    Publication Year: 2010 , Page(s): 1191 - 1199
    Cited by:  Papers (12)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2275 KB) |  | HTML iconHTML  

    Analysis on click-through data from a very large search engine log shows that users are usually interested in the top-ranked portion of returned search results. Therefore, it is crucial for search engines to achieve high accuracy on the top-ranked documents. While many methods exist for boosting video search performance, they either pay less attention to the above factor or encounter difficulties ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 7 Great Reasons for Joining the IEEE Computer Society [advertisement]

    Publication Year: 2010 , Page(s): 1200
    Request Permissions | PDF file iconPDF (590 KB)  
    Freely Available from IEEE
  • TKDE Information for authors

    Publication Year: 2010 , Page(s): c3
    Request Permissions | PDF file iconPDF (206 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010 , Page(s): c4
    Request Permissions | PDF file iconPDF (158 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