By Topic

Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on

Date March 29 2009-April 2 2009

Filter Results

Displaying Results 1 - 25 of 235
  • [Front cover]

    Publication Year: 2009 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (467 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (50 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009 , Page(s): v - xix
    Save to Project icon | Request Permissions | PDF file iconPDF (211 KB)  
    Freely Available from IEEE
  • Message from the General Co-chairs

    Publication Year: 2009 , Page(s): xx
    Save to Project icon | Request Permissions | PDF file iconPDF (90 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Letter from the Program Chairs

    Publication Year: 2009 , Page(s): xxi - xxii
    Save to Project icon | Request Permissions | PDF file iconPDF (98 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organization Committee

    Publication Year: 2009 , Page(s): xxiii - xxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (96 KB)  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009 , Page(s): xxv - xxxii
    Save to Project icon | Request Permissions | PDF file iconPDF (129 KB)  
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2009 , Page(s): xxxiii - xxxvi
    Save to Project icon | Request Permissions | PDF file iconPDF (84 KB)  
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2009 , Page(s): xxxvii
    Save to Project icon | Request Permissions | PDF file iconPDF (153 KB)  
    Freely Available from IEEE
  • Search Computing

    Publication Year: 2009 , Page(s): 1 - 3
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (183 KB) |  | HTML iconHTML  

    ldquoWho are the strongest European competitors on software ideas? Who is the best doctor to cure insomnia in a nearby hospital? Where can I attend an interesting conference in my field close to a sunny beach?rdquo This information is available on the Web, but no software system can accept such queries nor compute the answer. We hereby propose search computing as a new multi-disciplinary science w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Why Can't I Find My Data the Way I Find My Dinner?

    Publication Year: 2009 , Page(s): 4
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (58 KB) |  | HTML iconHTML  

    A primary strength of this IPY derives from its scientific breadth. One can find almost every discipline represented in the IPY projects, and funding has come from geophysical, biological and social agencies and programs. Addressing the urgent multifaceted problem of change of polar regions requires this interdisciplinary approach. IPY also has an advanced open access data policy, clearly stated a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Management in the Cloud

    Publication Year: 2009 , Page(s): 5
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (57 KB) |  | HTML iconHTML  

    We are in the midst of a computing revolution. As the cost of provisioning hardware and software stacks grows, and the cost of securing and administering these complex systems grows even faster, we're seeing a shift towards computing clouds. Clouds are essentially services accessed over a network, and offer developers scalable, robust computing infrastructure on a "pay as you go" basis, with the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Integrating Background Knowledge in Data Anonymization

    Publication Year: 2009 , Page(s): 6 - 17
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (387 KB) |  | HTML iconHTML  

    Recent work has shown the importance of considering the adversary's background knowledge when reasoning about privacy in data publishing. However, it is very difficult for the data publisher to know exactly the adversary's background knowledge. Existing work cannot satisfactorily model background knowledge and reason about privacy in the presence of such knowledge. This paper presents a general fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deriving Private Information from Association Rule Mining Results

    Publication Year: 2009 , Page(s): 18 - 29
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (381 KB) |  | HTML iconHTML  

    Data publishing can provide enormous benefits to the society. However, due to privacy concerns, data cannot be published in their original forms. Two types of data publishing can address the privacy issue: one is to publish the sanitized version of the original data, and the other is to publish the aggregate information from the original data, such as data mining results. There have been extensive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Light-Weight, Runtime Verification of Query Sources

    Publication Year: 2009 , Page(s): 30 - 41
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (525 KB) |  | HTML iconHTML  

    Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of attack on databases is arbitrary modification of data in a database through the file system, bypassing database access control. Additionally, for many applications, ensuring strict and definite authenticity of query source and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Auditing a Database under Retention Restrictions

    Publication Year: 2009 , Page(s): 42 - 53
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (734 KB) |  | HTML iconHTML  

    Auditing the changes to a database is critical for identifying malicious behavior, maintaining data quality, and improving system performance. But an accurate audit log is a historical record of the past that can also pose a serious threat to privacy. Policies which limit data retention conflict with the goal of accurate auditing, and data owners have to carefully balance the need for policy compl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ApproxRank: Estimating Rank for a Subgraph

    Publication Year: 2009 , Page(s): 54 - 65
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (545 KB) |  | HTML iconHTML  

    Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgraph of the global Web graph. The challenge for these applications is to compute PageRank-style scores efficiently on the subgraph, i.e., the ranking must reflect the global link structure of the Web graph but it must do so without pay... 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: 2009 , Page(s): 66 - 77
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (472 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. Alte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AJAX Crawl: Making AJAX Applications Searchable

    Publication Year: 2009 , Page(s): 78 - 89
    Cited by:  Papers (11)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (746 KB) |  | HTML iconHTML  

    Current search engines such as Google and Yahoo! are prevalent for searching the Web. Search on dynamic client-side Web pages is, however, either inexistent or far from perfect, and not addressed by existing work, for example on Deep Web. This is a real impediment since AJAX and Rich Internet Applications are already very common in the Web. AJAX applications are composed of states which can be see... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Data Structure for Sponsored Search

    Publication Year: 2009 , Page(s): 90 - 101
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1317 KB) |  | HTML iconHTML  

    Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (all the terms in the query need to be in the document, but not vice versa). For sponsored search, ads are associated with bids. When a user issues a search query, bids are typically matched to the query using broad-match semantics: ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Framework for Clustering Massive-Domain Data Streams

    Publication Year: 2009 , Page(s): 102 - 113
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (319 KB) |  | HTML iconHTML  

    In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each attribute are very large and cannot be easily tracked for clustering purposes. Some examples of such streams include IP-address streams, credit-card transaction streams, or streams of sales data over large numbers of item... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams

    Publication Year: 2009 , Page(s): 114 - 125
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (642 KB) |  | HTML iconHTML  

    We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approaches minimize bandwidth cost under fixed precision constraints, they may still overload a monitoring system during traffic bursts. To facilitate practical deployment of monitoring systems, SMART therefore bounds the worst-ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Efficient Processing of General-Purpose Joins in Sensor Networks

    Publication Year: 2009 , Page(s): 126 - 137
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (387 KB) |  | HTML iconHTML  

    Join processing in wireless sensor networks is difficult: As the tuples can be arbitrarily distributed within the network, matching pairs of tuples is communication intensive and costly in terms of energy. Current solutions only work well with specific placements of the nodes and/or make restrictive assumptions. In this paper, we present SENS-Join, an efficient general-purpose join method for sens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.