By Topic

9th International Database Engineering & Application Symposium (IDEAS'05)

Date 25-27 July 2005

Filter Results

Displaying Results 1 - 25 of 55
  • Proceedings. 9th International Database Engineering and Applications Symposium (IDEAS 2005)

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (148 KB)
    Freely Available from IEEE
  • 9th International Database Engineering & Application Symposium - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • 9th International Database Engineering & Application Symposium - Copyright Page

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • 9th International Database Engineering & Application Symposium - Table of contents

    Publication Year: 2005, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (24 KB) | HTML iconHTML
    Freely Available from IEEE
  • Preface

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (28 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee Reviewers

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

    Publication Year: 2005, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Incremental methods for simple problems in time series: algorithms and experiments

    Publication Year: 2005, Page(s):3 - 14
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    A time series (or equivalently a data stream) consists of data arriving in time order. Single or multiple data streams arise in fields including physics, finance, medicine, and music, to name a few. Often the data comes from sensors (in physics and medicine for example) whose data rates continue to improve dramatically as sensor technology improves and as the number of sensors increases. So fast a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection for conflicts of dependencies in advanced transaction models

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

    Transactional dependencies play an important role in coordinating the execution of subtransactions in advanced transaction models, such as, nested transactions and workflow transactions. The correct execution of the advanced transactions depends on ensuring the satisfaction of all the dependencies, which are specified by the application developer. Incorrect specification of transaction dependencie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building information systems by orchestrating open services

    Publication Year: 2005, Page(s):27 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5112 KB) | HTML iconHTML

    Service oriented computing has gained a considerable momentum as a new paradigm for building enterprise information systems. Notable efforts have been made recently from both researchers and industrials to support the construction of service-based applications, nevertheless several issues still need to be tackled including service definition and adaptation, and services orchestration. This work pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Persistent middle tier components without logging

    Publication Year: 2005, Page(s):37 - 46
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2848 KB) | HTML iconHTML

    Enterprise applications need to be highly available and scalable. In the past, this has required "stateless" applications, which essentially require the application to manage its state explicitly by storing it in transactional resource managers. Despite "stateful" applications being more natural and hence easier to write and get correct, having the system manage this state automatically has been c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the intersection of XPath expressions

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

    XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the last years some of the characteristics of XPath have been discussed. Examples include the containment of two XPath expressions p and p' (p ⊆ p'). To the best of our knowledge the intersection of two XPath expressions (p &... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying with negation in data integration systems

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

    Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. It is characterized by an architecture based on a global schema, with the set of integrity constraints, and a set of sources. In this paper, we investigate the way in which Closed World Assumption on a source data base can be coherently propagated to the global... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of queries on tree-structured data using dimension graphs

    Publication Year: 2005, Page(s):65 - 74
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of tree-structured data. Querying tree-structured data is a challenging issue due to the diversity of the structural aspect in the same or in different trees. In this paper, we show how to evaluate queries on tree-structured data, called value t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data updating between the operational and analytical databases through dw-log algorithm

    Publication Year: 2005, Page(s):77 - 82
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Data warehouse systems (DWS) make use of storage techniques for efficient end user accessing and query facilities. DWS applications have implemented classic data synchronism operations that do not support an immediate data update. With the evolution of semantic data representation in the operational database environment, the accomplished analysis in DWS demands new synchronism ways. Hence, there i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilizing indexes for approximate and on-line nearest neighbor queries

    Publication Year: 2005, Page(s):83 - 88
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    We explore using index structures for effective approximate and on-line nearest neighbor queries. While many index structures have showed to suffer from the dimensionality curse, we believe that indexes can still be useful in providing quick approximate solutions to the nearest neighbor queries. Moreover, the information provided by the indexes can provide certain bounds that can be invaluable for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An incremental clustering scheme for duplicate detection in large databases

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

    We propose an incremental algorithm for clustering duplicate tuples in large databases, which allows to assign any new tuple t to the cluster containing the database tuples which are most similar to t (and hence are likely to refer to the same real-world entity t is associated with). The core of the approach is a hash-based indexing technique that tends to assign highly similar objects to the same... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XML and relational data: towards a common model and algebra

    Publication Year: 2005, Page(s):96 - 101
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    In this paper we present a model for the management of relational, XML, and mixed data. The main high-level approaches to manipulate XML, i.e., SQL/XML, XQuery, and object/relational XML columns, can all be based on our common model and algebra. Our query algebra, yet very simple, can represent queries not expressible by other proposals and by the current implementation of TAX. Moreover, we show t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatically maintaining wrappers for Web sources

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

    A substantial subset of the Web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents. A program able to provide software applications with a structured view of those semi-structured Web sources is usually called a wrapper. Wrappers are able to accept a query against the source and return a set of structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-structured data management in the enterprise: a nimble, high-throughput, and scalable approach

    Publication Year: 2005, Page(s):115 - 124
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    In this paper we describe an approach and system for managing enterprise semi-structured data that is high-throughput, nimble, and scalable. We present the NETMARK system, which provides for a "schemaless" way of managing semi-structured documents. We describe in particular detail the unique underlying data storage approach and efficient query processing mechanisms given this storage system. We pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern-based information integration in dynamic environments

    Publication Year: 2005, Page(s):125 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    The convenient availability of information is an essential factor in science and business. While Internet technology has made large amounts of data available to the general public, the data is largely provided in human-readable format only. New technologies are now making direct access to millions of structured or semi-structured databases possible, but only through integration of these data sourc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agents and databases: friends or foes?

    Publication Year: 2005, Page(s):137 - 147
    Cited by:  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    On first glance agent technology seems more like a hostile intruder into the database world. On the other hand, the two could easily complement each other, since agents carry out information processes whereas databases supply information to processes. Nonetheless, to view agent technology from a database perspective seems to question some of the basic paradigms of database technology, particularly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RelaXML: bidirectional transfer between relational and XML data

    Publication Year: 2005, Page(s):151 - 162
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    In modern enterprises, almost all data is stored in relational databases. Additionally, most enterprises increasingly collaborate with other enterprises in long-running read-write workflows, primarily through XML-based data exchange technologies such as Web services. However, bidirectional XML data exchange is cumbersome and must often be hand-coded, at considerable expense. This paper remedies th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rewriting-based optimization for XQuery transformational queries

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

    The modern XML query language called XQuery includes advanced facilities both to query and to transform XML data. An XQuery query optimizer should be able to optimize any query. For "querying" queries almost all techniques inherited from SQL-oriented DBMS may be applied. The XQuery transformation facilities are XML-specific and have no counterparts in other query languages. That is why XQuery tran... View full abstract»

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