By Topic

22nd International Conference on Data Engineering (ICDE'06)

Date 3-7 April 2006

Filter Results

Displaying Results 1 - 25 of 180
  • 22nd International Conference on Data Engineering - Cover

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (431 KB)
    Freely Available from IEEE
  • 22nd International Conference on Data Engineering - Title

    Publication Year: 2006, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • 22nd International Conference on Data Engineering - Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (431 KB)
    Freely Available from IEEE
  • 22nd International Conference on Data Engineering - TOC

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

    Publication Year: 2006, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (95 KB) | HTML iconHTML
    Freely Available from IEEE
  • General Chairs

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

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

    Publication Year: 2006, Page(s): xxiv
    Request permission for commercial reuse | PDF file iconPDF (91 KB)
    Freely Available from IEEE
  • MiniCount: Efficient Rewriting of COUNT-Queries Using Views

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

    We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with count and conjunctive views without aggregation. An efficient and scalable solution to this problem yields significant benefits for data warehousing and decision support systems, as well as for powerful data integration sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Updates Through Views: A New Hope

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

    Database views are extensively used to represent unmaterialized tables. Applications rarely distinguish between a materialized base table and a virtual view, thus, they may issue update requests on the views. Since views are virtual, update requests on them need to be translated to updates on the base tables. Existing literature has shown the difficulty of translating view updates in a side-effect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning from Aggregate Views

    Publication Year: 2006, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    In this paper, we introduce a new class of data mining problems called learning from aggregate views. In contrast to the traditional problem of learning from a single table of training examples, the new goal is to learn from multiple aggregate views of the underlying data, without access to the un-aggregated data. We motivate this new problem, present a general problem framework, develop learning ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking

    Publication Year: 2006, Page(s): 4
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2) closed cube, where a group of cells which preserve roll-up/drill-down semantics are losslessly compressed to one cell. Due to its usability and importance, efficient computation of closed cubes still warrants a thorough... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Primitive Operator for Similarity Joins in Data Cleaning

    Publication Year: 2006, Page(s): 5
    Cited by:  Papers (80)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Data cleaning based on similarities involves identification of "close" tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the domain and application. Current approaches for efficiently implementing such similarity joins are tightly tied to the chosen similarity function. In this paper, we propose a new primitive operator which can be used as a foundation to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques for Warehousing of Sample Data

    Publication Year: 2006, Page(s): 6
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    We consider the problem of maintaining a warehouse of sampled data that "shadows" a full-scale data warehouse, in order to support quick approximate analytics and metadata discovery. The full-scale warehouse comprises many "data sets," where a data set is a bag of values; the data sets can vary enormously in size. The values constituting a data set can arrive in batch or stream form. We provide an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Working Models for Uncertain Data

    Publication Year: 2006, Page(s): 7
    Cited by:  Papers (45)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but these representations are generally incomplete―standard operations over the data may result in unrepresentable types of uncertainty. Complete models are theoretically attractive, but they can be nonintuitive and more c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning About Approximate Match Query Results

    Publication Year: 2006, Page(s): 8
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such operations and some have been embedded in a declarative data cleaning framework. These techniques return pairs of tuples from both relations, tagged with a score, signifying the degree of similarity between the tuples in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors

    Publication Year: 2006, Page(s): 9
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying measuring techniques or environmental circumstances. Since these circumstances are not necessarily the same when determining the features for different individuals, the exactness might strongly vary between the individuals as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding Fastest Paths on A Road Network with Speed Patterns

    Publication Year: 2006, Page(s): 10
    Cited by:  Papers (26)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of I. Note that the query algorithm should find a partitioning of I into sub-intervals. Existing methods can only be used to solve a very special ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases

    Publication Year: 2006, Page(s): 11
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal with tremendous quantities of images, videos or audio files stored in large multimedia databases. For content-based data mining and retrieval purposes suitable similarity models are crucial. The Earth Mover’s Distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing for Dynamic Abstract Regions

    Publication Year: 2006, Page(s): 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB) | HTML iconHTML

    We propose a new main memory index structure for abstract regions (objects) which may heavily overlap, the RCtree. These objects are "dynamic" and may have short life spans. The novelty is that rather than representing an object by its minimum bounding rectangle (MBR), possibly with pre-processed segmentation into many small MBRs, we use the actual shape of the object to maintain the index. This s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Processing of Updates in Dynamic XML Data

    Publication Year: 2006, Page(s): 13
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we propose a novel Compact Dynamic Binary String (CDBS) encoding to efficiently process the updates. CDBS has two important properties which form the foundations of this paper: (1) CDBS supports that codes can be inserted betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Complete and Efficient Algebraic Compiler for XQuery

    Publication Year: 2006, Page(s): 14
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propose an algebra and optimization techniques that are suitable for building an XQuery compiler that is complete, correct, and efficient. We describe the compilation rules for the complete language into that algebra and presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making Designer Schemas with Colors

    Publication Year: 2006, Page(s): 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    XML schema design has two opposing goals: elimination of update anomalies requires that the schema be as normalized as possible; yet higher query performance and simpler query expression are often obtained through the use of schemas that permit redundancy. In this paper, we show that the recently proposed MCT data model, which extends XML by adding colors, can be used to address this dichotomy eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining Actionable Patterns by Role Models

    Publication Year: 2006, Page(s): 16
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Data mining promises to discover valid and potentially useful patterns in data. Often, discovered patterns are not useful to the user."Actionability" addresses this problem in that a pattern is deemed actionable if the user can act upon it in her favor. We introduce the notion of "action" as a domain-independent way to model the domain knowledge. Given a data set about actionable features and an u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases

    Publication Year: 2006, Page(s): 17
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    Many real world applications involve not just a single dataset, but a view of multiple datasets. These datasets may be collected from different sources and/or at different time instances. In such scenarios, comparing patterns or features from different datasets and understanding their relationships can be an extremely important part of the KDD process. This paper considers the problem of optimizin... View full abstract»

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