By Topic

Cooperative Database Systems for Advanced Applications, 2001. CODAS 2001. The Proceedings of the Third International Symposium on

Date 24-24 April 2001

Filter Results

Displaying Results 1 - 25 of 26
  • Proceedings of the Third International Symposium on Cooperative Database Systems for Advanced Applications. CODAS 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 200
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Cooperative content analysis agents for online multimedia indexing and filtering

    Publication Year: 2001, Page(s):118 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    New integrated services are emerging from the rapid technological advances in networking, multi-agents, media and broadcasting technologies. This advancement allows for large amounts of multimedia information to be distributed and shared on the Internet. To fulfill the goal of the efficient searching and effective redistribution of online multimedia, automatic segmentation, efficient content analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automated integration approach for semi-structured and structured data

    Publication Year: 2001, Page(s):12 - 21
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB) | HTML iconHTML

    As data access beyond the traditional intranet boundary is popular on the Internet these days, the demand for an integrated and uniform method for accessing Web data sources that are different in structures and semantics is increasing. This demand is partly driven by users who want to access more diverse information, such as up-to-date information on stock market, entertainment, news, and science.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous monitoring of events for distributed cooperative environments

    Publication Year: 2001, Page(s):22 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB) | HTML iconHTML

    Most of the work in active databases (event specification and detection) has concentrated on centralized environments. In other words, ECA rules are accepted and managed by active DBMSs within the same address space. However, cooperative problem solving environments are inherently distributed and heterogeneous; hence there is a need for supporting ECA (Event-Condition-Action) rules in a distribute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented representation for XML data

    Publication Year: 2001, Page(s):40 - 49
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB) | HTML iconHTML

    XML is a new standard for representing and exchanging data on the Internet. How to model XML data for Web applications and data management is a hot topic in the XML research area. The paper presents an object representation model for XML data. A set of transformation rules and steps are established to transform DTDs, as well as XML documents with DTDs, into this model. This model capsulizes elemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Customized atomicity specification for transactional workflows

    Publication Year: 2001, Page(s):140 - 147
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB) | HTML iconHTML

    We introduce a new approach for specifying transaction management requirements for workflow applications. We propose independent models for the specification of workflow and transaction properties. Although we distinguish multiple transaction properties in our approach, we focus on atomicity. We propose an intuitive notation to specify atomicity and provide generic rules to integrate the workflow ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective and efficient boundary-based clustering for three-dimensional geoinformation studies

    Publication Year: 2001, Page(s):82 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB) | HTML iconHTML

    Due to their inherent volumetric nature, underground and marine geoinformation studies and even astronomy demand clustering techniques capable of dealing with three-dimensional data. However, most robust and exploratory spatial clustering approaches for GIS only consider two dimensions. We extend robust argument-free two-dimensional boundary-based clustering (Estivill-Castro and Lee, 2000) to thre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concealing a secret image using the breadth first traversal linear quadtree structure

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

    This paper presents an image hiding method which embeds the secret image in the least significant bits (LSB) of the pixels selected from a cover image. Generally, LSB-related methods are rather sensitive to the modifications on the cover image. To abate the damage to the reconstructed cover image, this proposed method hence embeds the vital data of the cover image in more significant bits. This pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving performance of the k-nearest neighbor classifier by tolerant rough sets

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

    The authors report on efforts to improve the performance of k-nearest neighbor classification by introducing the tolerant rough set. We relate the tolerant rough relation with object similarity. Two objects are called similar if and only if these two objects satisfy the requirements of the tolerant rough relation. Hence, the tolerant rough set is used to select objects from the training data and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing repairs for inconsistent databases

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

    The paper addresses the problem of managing inconsistencies derived from the integration of multiple autonomous information sources. We propose a general framework for computing repairs and consistent answers over inconsistent databases, i.e. databases which violate integrity constraints. A repair for a database is a minimal set of insert and delete operations which makes the database consistent. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Set-based access conflicts analysis of concurrent workflow definition

    Publication Year: 2001, Page(s):172 - 176
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    An error-comprising workflow definition might provoke serious problems to an enterprise, especially when it is involved with mission critical business processes. Concurrency of workflow processes is known as one of the major sources causing such an invalid workflow process definition. So, the conflicts caused by concurrent workflow processes should be considered deliberately when defining concurre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incorporating adaptive interaction property in cooperative agent for emergent process management

    Publication Year: 2001, Page(s):110 - 117
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB) | HTML iconHTML

    An adaptive agent interaction strategy, is presented. It has been trialled in a system for emergent process management. That system was constructed using generic process agents. Their architecture is a three-layered BDI hybrid architecture. The agent interaction strategy substantially determines the performance of a multi-agent system. The interaction strategy described is derived by observing the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting voluntary disconnection in WFMSs

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

    With the network and computing environment improvement in both wireless and wired area, mobile or portable devices like palmtops and notebooks have become prevalent. They are even considered as essential ingredients of the business workplace. Thus this mobile business environment should be accommodated in the business automation systems like workflow management systems (WFMSs). Researchers have fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-weighted tree based query optimization method for parallel relational database systems

    Publication Year: 2001, Page(s):186 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB) | HTML iconHTML

    A multi-weighted tree based query optimization method for parallel relational databases is proposed. The method consists of a multi-weighted tree based parallel query plan model, a cost model for parallel query plans and a query optimizer. The parallel query plan model models three types of parallelism of query execution, processor and memory allocation to operations, memory allocation to buffers ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • To a man with an ORDBMS everything looks like a row in a table

    Publication Year: 2001, Page(s):65 - 71
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    In large software projects it is required to manage all project-related artefacts in a shared database in order to support cooperation of developers and reuse of design. Unfortunately, such projects have to be supported by various development tools using proprietary strategies for storing their persistent data. Since we need a strong query language to analyse the project-related data we choose an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraints for information cooperation in virtual enterprise systems

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

    In recent years, research about distributing information sources over a network has become increasingly important. We concentrate on the issues of information cooperation among heterogeneous virtual enterprise information sources. When a virtual enterprise was built up, enterprise information will be bound together with some constraints enforcing virtual enterprise logic across several enterprises... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An intelligent agent for Web advertisements

    Publication Year: 2001, Page(s):102 - 109
    Cited by:  Papers (1)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    The rapid growth of Internet users attracts advertisers to post their advertisements on the Internet. The probabilistic selection algorithm was not satisfactory; while other advertising agents are unable to guarantee the quality due to insufficient and unstable user information. We describe a new advertising agent based on user information. The users' interests are discovered by the order pattern ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible data management and execution to support cooperative workflow: the COO approach

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

    This paper introduces an evolution to classical workflow that allows more flexible execution of processes while retaining its simplicity. On the one hand it allows describing processes in the same way that they are in design and engineering manuals, on the other hand it allows to control these processes in a way that is close to the way they are actually enacted. Flexible execution is combined wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range sum queries in dynamic OLAP data cubes

    Publication Year: 2001, Page(s):74 - 81
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    Range sum queries play an important role in analyzing data in data cubes. Many application domains require that data cubes should be updated quite often to provide real time information. Previous techniques for range sum queries, however, can incur an update cost of O(nd) in the worst case, where d is the number of dimensions of the data cube and n is the size of each dimension. To addr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realizing temporal XML repositories using temporal relational databases

    Publication Year: 2001, Page(s):60 - 64
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    This paper addresses development of general storage and retrieval methods for changes of XML documents. In this approach, histories of XML documents are modeled by the TXPath data model, which is a temporal extension of the XPath data model. Given an XML document, changes of the document are modeled by the TXPath data model, and it is then mapped into valid-time relational tables of temporal relat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enterprise model as a basis of administration on role-based access control

    Publication Year: 2001, Page(s):150 - 158
    Cited by:  Papers (10)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB) | HTML iconHTML

    Access control is one of the important security issues for large enterprise organizations. The role-based access control (RBAC) model is well known and recognized as a good security model for the enterprise environment. Though RBAC is a good model, the administration of RBAC including building and maintaining access control information remains a difficult problem in large companies. The RBAC model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The personalized index service system in digital library

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

    China Digital Library is a federated digital library, which is composed of library components such as: local digital libraries, publishing companies, and so on. The objective of the federated digital library is to share resources and services of its components, therefore users can access distributed information transparently. The immense distributed electronic information available in the federate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying event-condition-action mechanism in healthcare: a computerised clinical test-ordering protocol system (TOPS)

    Publication Year: 2001, Page(s):2 - 9
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB) | HTML iconHTML

    The paper addresses issues of active database application in the challenging healthcare area: the management and execution of computerised clinical practice guidelines/protocols. The problem of how to efficiently and effectively query and manipulate the computerised clinical protocols/guidelines has posed a major challenge, but received little research attention until very recently. By proposing a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel join algorithms based on parallel B+-trees

    Publication Year: 2001, Page(s):178 - 185
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB) | HTML iconHTML

    Within the last several years, a number of parallel algorithms for the join operation have been proposed. However, almost all of these algorithms do not take advantage of the underlying parallel storage structures or data declustering methods of the operand relations. The paper introduces the concept of parallel storage structure or declustering aware parallel join algorithm. Two classes of parall... View full abstract»

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