By Topic

Data Engineering Workshops (ICDEW), 2011 IEEE 27th International Conference on

Date 11-16 April 2011

Filter Results

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

    Publication Year: 2011, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (1248 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • Session list

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

    Publication Year: 2011, Page(s):1 - 8
    Request permission for commercial reuse | PDF file iconPDF (57 KB)
    Freely Available from IEEE
  • Brief author index

    Publication Year: 2011, Page(s):1 - 4
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • Detailed author index

    Publication Year: 2011, Page(s):1 - 28
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • The end of indexes

    Publication Year: 2011, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • [PDF Reader FAQ and support]

    Publication Year: 2011, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (126 KB)
    Freely Available from IEEE
  • [PDF Reader FAQ and support]

    Publication Year: 2011, Page(s):1 - 5
    Request permission for commercial reuse | PDF file iconPDF (455 KB)
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2011, Page(s):1 - 3
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • A call for order in search space generation process of query optimization

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

    Many search space generation algorithms used by query optimizers focus on efficiently and exhaustively enumerating the set of alternative plans. However, newly emerged systems, such as Object-Relational Mapping (ORM) tools, introduce new challenges to the query optimizer. This is because dynamically generated queries are very complex, relatively inexpensive to execute, and they must be optimized a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DILoS: A dynamic integrated load manager and scheduler for continuous queries

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

    In a Data Stream Management System (DSMS), continuous queries (CQs) registered by different applications inherently have different levels of importance (i.e., quality of service (QoS) and quality of data (QoD) requirements). Moreover, the shift to cloud services and the growing need for monitoring applications will inevitably lead to the establishment of data stream management cloud services. In s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balancing load in stream processing with the cloud

    Publication Year: 2011, Page(s):16 - 21
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    Stream processing systems must handle stream data coming from real-time, high-throughput applications, for example in financial trading. Timely processing of streams is important and requires sufficient available resources to achieve high throughput and deliver accurate results. However, static allocation of stream processing resources in terms of machines is inefficient when input streams have si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autonomous workload-driven reorganization of column groupings in MMDBS

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

    A current trend to achieve high query performance even for huge data warehouse and business intelligence systems is to exploit main-memory-based processing techniques such as compression, cache-conscious strategies, and optimized data structures. However, update processing and skews in data distribution might lead to degenerations in such densely packed and highly compressed data structures affect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ‘Pause and resume’ functionality for index operations

    Publication Year: 2011, Page(s):28 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (474 KB) | HTML iconHTML

    Online index functionality allows concurrent queries and updates during index maintenance tasks, e.g., creation of a new secondary index. Nonetheless, index operations can be both extremely resource-intensive and also extremely long-running. As such, necessary system activities such as adding a new secondary index or changing the primary index may introduce significant contention for resources suc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dealing proactively with data corruption: Challenges and opportunities

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

    The danger of production or backup data becoming corrupted is a problem that database administrators dread. This position paper aims to bring this problem to the attention of the database research community, which, surprisingly, has by and large overlooked this problem. We begin by pointing out the causes and consequences of data corruption. We then describe the Proactive Checking Framework (PCF),... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First International workshop on managing data throughout its lifecycle (DaLí 2011)

    Publication Year: 2011, Page(s):40 - 45
    Request permission for commercial reuse | PDF file iconPDF (50 KB) | HTML iconHTML
    Freely Available from IEEE
  • Classification algorithms for relation prediction

    Publication Year: 2011, Page(s):46 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB) | HTML iconHTML

    Knowledge discovery from the Web is a cyclic process. In this paper we focus on the important part of transforming unstructured information from Web pages into structured relations. Relation extraction systems capture information from natural language text on Web pages, called Web text. However, extraction is quite costly and time consuming. Worse, many Web pages may not contain a textual represen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data lineage in the MOMIS data fusion system

    Publication Year: 2011, Page(s):53 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    Data Lineage is an open research problem. This is particularly true in data integration systems, where information coming from different sources, potentially uncertain or even inconsistent with each other, is integrated. In this context, having the possibility to trace the lineage of certain data can help unraveling possible unexpected or questionable results. In this paper, we describe our prelim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for semi-automatic identification, disambiguation and storage of protein-related abbreviations in scientific literature

    Publication Year: 2011, Page(s):59 - 61
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (79 KB) | HTML iconHTML

    We propose a framework for identifying, disambiguating and storing protein-related abbreviations as found in the full texts of scientific papers, in order to build and maintain a publicly available abbreviation repository via a semi-automatic process. This process involves information extraction methods and techniques for acronym identification and resolution, based on lexical clues and syntactica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RADAR: Radial applications' depiction around relations for data-centric ecosystems

    Publication Year: 2011, Page(s):62 - 67
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (799 KB) | HTML iconHTML

    A data-centric ecosystem is the configuration of a central database along with all the applications that operate on top of it and are (a) dependent upon the database for performing their task appropriately and (b) closely related in terms of coding to the database. This paper presents first results towards addressing the issue of visualization of such a data-centric ecosystem in a reference ȁ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using structured changes for elucidating data evolution

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

    In this paper we argue that changes should be treated as first class citizens in data management systems. In our approach, changes are not just transformation operations but complex objects retaining structural, semantic, and temporal characteristics. We believe that accommodating structured changes in information modeling and querying can provide users with new insights into data lifecycle. In pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the reduction of sequences of XML document and schema update operations

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

    Automating the management of data throughout its lifecycle requires solutions to effectively and efficiently handle updates, both on data and on the corresponding schema. Such solutions are especially needed for XML documents and schemata, due to the high dynamicity of the contexts in which they are employed. XML documents need to be kept up-to-date, schemata as well are often subjected to updates... View full abstract»

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

    Publication Year: 2011, Page(s): 87
    Request permission for commercial reuse | PDF file iconPDF (54 KB) | HTML iconHTML
    Freely Available from IEEE
  • Key-key-value stores for efficiently processing graph data in the cloud

    Publication Year: 2011, Page(s):88 - 93
    Cited by:  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    Modern cloud data storage services have powerful capabilities for data-sets that can be indexed by a single key-key-value stores-and for data-sets that are characterized by multiple attributes (such as Google's BigTable). These data stores have non-ideal overheads, however, when graph data needs to be maintained; overheads are incurred because related (by graph edges) keys are managed in physicall... View full abstract»

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