By Topic

21st International Conference on Data Engineering (ICDE'05)

5-8 April 2005

Filter Results

Displaying Results 1 - 25 of 158
  • Proceedings. 21st International Conference on Data Engineering

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (861 KB)
    Freely Available from IEEE
  • 21st International Conference on Data Engineering - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • 21st International Conference on Data Engineering - Copyright Page

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • 21st International Conference on Data Engineering - Table of contents

    Publication Year: 2005, Page(s):v - xvii
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Message from the General Chairs

    Publication Year: 2005, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (31 KB) | HTML iconHTML
    Freely Available from IEEE
  • Welcome from the Program Chairs

    Publication Year: 2005, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (34 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Officers

    Publication Year: 2005, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005, Page(s): xxiv
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Demo Program Committee

    Publication Year: 2005, Page(s): xxviii
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2005, Page(s): xxix
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • "One size fits all": an idea whose time has come and gone

    Publication Year: 2005, Page(s):2 - 11
    Cited by:  Papers (52)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    The last 25 years of commercial DBMS development can be summed up in a single phrase: "one size fits all". This phrase refers to the fact that the traditional DBMS architecture (originally designed and optimized for business data processing) has been used to support many data-centric applications with widely varying characteristics and requirements. In this paper, we argue that this concept is no ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Top five data challenges for the next decade

    Publication Year: 2005
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (34 KB) | HTML iconHTML

    Summary form only given. For the past three decades, those of us in the database field have principally focused attention and significant effort on technology for storing, querying, accessing, and securing data with well-known structure in high-performance data management systems. Our focus has been riveted on performance, performance, and performance. The world has changed dramatically since the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IC Tag Based Traceability: System and Solutions

    Publication Year: 2005, Page(s):13 - 17
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB) | HTML iconHTML

    An increasing number of companies want to improve product traceability for several reasons: to meet stricter government regulations about food and medical safety, to cope with ever-stronger consumer demands to know exactly what they are buying, and to improve and protect the company's brand value through more transparent business operations. Two aspects of traceability are technically important: (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective computation of biased quantiles over data streams

    Publication Year: 2005, Page(s):20 - 31
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    Skew is prevalent in many data sources such as IP traffic streams. To continually summarize the distribution of such data, a high-biased set of quantiles (e.g., 50th, 90th and 99th percentiles) with finer error guarantees at higher ranks (e.g., errors of 5, 1 and 0.1 percent, respectively) is more useful than uniformly distributed quantiles (e.g., 25th, 50th and 75th percentiles) with uniform erro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range-efficient computation of F0 over massive data streams

    Publication Year: 2005, Page(s):32 - 43
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider the problem of efficiently estimating F0 of a data stream where each element of the stream is an interval of integers. We present a randomized algorithm which gives an (ε, δ) approximat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified framework for monitoring data streams in real time

    Publication Year: 2005, Page(s):44 - 55
    Cited by:  Papers (29)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Online monitoring of data streams poses a challenge in many data-centric applications, such as telecommunications networks, traffic management, trend-related analysis, Web-click streams, intrusion detection, and sensor networks. Mining techniques employed in these applications have to be efficient in terms of space usage and per-item processing time while providing a high quality of answers to (1)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corpus-based schema matching

    Publication Year: 2005, Page(s):57 - 68
    Cited by:  Papers (75)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Schema matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past solutions have proposed a principled combination of multiple algorithms. However, these solutions sometimes perform rather poorly due to the lack of sufficient evidence in the schemas being matched. In this paper we show h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema matching using duplicates

    Publication Year: 2005, Page(s):69 - 80
    Cited by:  Papers (42)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Most data integration applications require a matching between the schemas of the respective data sets. We show how the existence of duplicates within these data sets can be exploited to automatically identify matching attributes. We describe an algorithm that first discovers duplicates among data sets with unaligned schemas and then uses these duplicates to perform schema matching between schemas ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing and querying data transformations

    Publication Year: 2005, Page(s):81 - 92
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    Modern information systems often store data that has been transformed and integrated from a variety of sources. This integration may obscure the original source semantics of data items. For many tasks, it is important to be able to determine not only where data items originated, but also why they appear in the integration as they do and through what transformation they were derived. This problem i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bypass caching: making scientific databases good network citizens

    Publication Year: 2005, Page(s):94 - 105
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitable for their workloads, which compare and join large data sets. Existing techniques reduce parallelism by conducting distributed queries in a single cache and lose the data reduction benefits of performing selections at ea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymmetric Batch Incremental View Maintenance

    Publication Year: 2005, Page(s):106 - 117
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    Incremental view maintenance has found a growing number of applications recently, including data warehousing, continuous query processing, publish/subscribe systems, etc. Batch processing of base table modifications, when applicable, can be much more efficient than processing individual modifications one at a time. In this paper, we tackle the problem of finding the most efficient batch incrementa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive caching for continuous queries

    Publication Year: 2005, Page(s):118 - 129
    Cited by:  Papers (22)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as conventional maintenance of materialized join views. Our adaptive approach handles streams of updates whose rates and data characteristics may change over time, as well as changes in system conditions such ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Snapshot queries: towards data-centric sensor networks

    Publication Year: 2005, Page(s):131 - 142
    Cited by:  Papers (61)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment that are used for electing, using a localized algorithm, a small set of representative nodes in the network. These representative nodes constitute a network snapshot and can be used to provide quick approximate answers to u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Correlated Attributes in Acquisitional Query Processing

    Publication Year: 2005, Page(s):143 - 154
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB) | HTML iconHTML

    Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency, or computational resources. When executing queries that contain several predicates over such expensive attributes, we observe that it can be beneficial to use correlations to automatically introduce low-cost attributes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Triage: an adaptive architecture for load shedding in TelegraphCQ

    Publication Year: 2005, Page(s):155 - 156
    Cited by:  Papers (20)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    Many of the data sources used in stream query processing are known to exhibit bursty behavior. Data in a burst often has different characteristics than steady-state data, and therefore may be of particular interest. In this paper, we describe the Data Triage architecture that we are adding to TelegraphCQ to provide low latency results with good accuracy under such bursts. View full abstract»

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