By Topic

2007 IEEE 23rd International Conference on Data Engineering

15-20 April 2007

Filter Results

Displaying Results 1 - 25 of 220
  • 2007 IEEE 23rd International Conference on Data Enginering

    Publication Year: 2007, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 2007, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (575 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (18 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2007, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • [Opinion]

    Publication Year: 2007, Page(s):1 - 11
    Request permission for commercial reuse | PDF file iconPDF (8043 KB) | HTML iconHTML
    Freely Available from IEEE
  • Contributor listings

    Publication Year: 2007, Page(s):1 - 22
    Request permission for commercial reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • Reviewer and referee listings

    Publication Year: 2007, Page(s):1 - 8
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2007, Page(s):1 - 4
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Sessions

    Publication Year: 2007, Page(s):1 - 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (34 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

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

    Publication Year: 2007, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (25 KB)

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

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

    Publication Year: 2007, Page(s):1 - 49
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE
  • Papers by author

    Publication Year: 2007, Page(s):1 - 114
    Request permission for commercial reuse | PDF file iconPDF (48681 KB)
    Freely Available from IEEE
  • Emerging Open Agoras of Data and Information

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

    Open Agoras of information are distributed environments of independent systems, where seeking for information is similar to real-life searching for material goods. Interaction with these systems may occur in several unconventional modalities, user behavior may be personalized and context-dependent, system reaction may be unpredictable, and the information produced as a result may also be personali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Challenges on Distributed Web Retrieval

    Publication Year: 2007, Page(s):6 - 20
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB) | HTML iconHTML

    In the ocean of Web data, Web search engines are the primary way to access content. As the data is on the order of petabytes, current search engines are very large centralized systems based on replicated clusters. Web data, however, is always evolving. The number of Web sites continues to grow rapidly and there are currently more than 20 billion indexed pages. In the near future, centralized syste... View full abstract»

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

    Publication Year: 2007, Page(s):21 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (68 KB) | HTML iconHTML

    Ordinary people have access to unprecedented volumes of information today. Researchers in the fields of information management (IM) and human-computer interaction (HCI) are reacting to this challenge from their own unique perspectives. Having access to a billion records is cool, but having access to a billion people is awesome. In this paper, we look at recent research from both communities, and s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptively Reordering Joins during Query Execution

    Publication Year: 2007, Page(s):26 - 35
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5395 KB) | HTML iconHTML

    Traditional query processing techniques based on static query optimization are ineffective in applications where statistics about the data are unavailable at the start of query execution or where the data characteristics are skewed and change dynamically. Several adaptive query processing techniques have been proposed in recent years to overcome the limitations of static query optimizers through e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypertree Decompositions for Query Optimization

    Publication Year: 2007, Page(s):36 - 45
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (798 KB) | HTML iconHTML

    The database community has investigated many structure-driven methods, which guarantee that large classes of queries may be answered in (input-output) polynomial-time. However, despite their very nice computational properties, these methods are not currently used for practical applications, since they do not care about output variables and aggregate operators, and do not exploit quantitative infor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unnesting Scalar SQL Queries in the Presence of Disjunction

    Publication Year: 2007, Page(s):46 - 55
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present the first unnesting strategy that can effectively deal with such queries. The starting point of our approach is to translate SQL into the relational algebra extended by bypass operators. Then we present for the first time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Maintenance of Materialized Outer-Join Views

    Publication Year: 2007, Page(s):56 - 65
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5621 KB) | HTML iconHTML

    Queries containing outer joins are common in data warehousing applications. Materialized outer-join views could greatly speed up many such queries but most database systems do not allow outer joins in materialized views. In part, this is because outer-join views could not previously be maintained efficiently when base tables are updated. In this paper we show how to efficiently maintain general ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A General Cost Model for Dimensionality Reduction in High Dimensional Spaces

    Publication Year: 2007, Page(s):66 - 75
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    Similarity search usually encounters a serious problem in the high dimensional space, known as the "curse of dimensionality". In order to speed up the retrieval efficiency, previous approaches usually reduce the dimensionality of the entire data set to a fixed lower value before building indexes (referred to as global dimensionality reduction (GDR)). More recent works focus on locally reducing the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating Profile Queries in Elevation Maps

    Publication Year: 2007, Page(s):76 - 85
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB) | HTML iconHTML

    Elevation maps are a widely used spatial data representation in geographical information systems (GIS). Paths on elevation maps can be characterized by profiles, which describe relative elevation as a function of distance. In this research, we address the inverse of this mapping - given a profile, how to efficiently find paths that could have generated it. This is called the profile query problem.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selecting Stars: The k Most Representative Skyline Operator

    Publication Year: 2007, Page(s):86 - 95
    Cited by:  Papers (76)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points, which are dominated by at least one of these k skyline points, is maximized. We first present an efficient dynamic programming based exact algorithm in a 2d-space. Then, we show that the problem is NP-hard when the dimen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing Compressed Multidimensional Skyline Cubes Efficiently

    Publication Year: 2007, Page(s):96 - 105
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (203 KB) | HTML iconHTML

    Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some applications. Particularly, compressed skyline cubes in the form of skyline groups and their decisive subspaces provide a succinct summarization and compression of multidimensional subspace skylines. However, computing skyline cubes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • t-Closeness: Privacy Beyond k-Anonymity and l-Diversity

    Publication Year: 2007, Page(s):106 - 115
    Cited by:  Papers (338)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (319 KB) | HTML iconHTML

    The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to certain "identifying" attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of l-diversity has been proposed to address this;... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregate Query Answering on Anonymized Tables

    Publication Year: 2007, Page(s):116 - 125
    Cited by:  Papers (60)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    Privacy is a serious concern when microdata need to be released for ad hoc analyses. The privacy goals of existing privacy protection approaches (e.g., k-anonymity and l-diversity) are suitable only for categorical sensitive attributes. Since applying them directly to numerical sensitive attributes (e.g., salary) may result in undesirable information leakage, we propose privacy goals to better cap... View full abstract»

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