196,152 research outputs found

    Dealing With Data Heterogeneity in a Data Fusion Perspective: Models, Methodologies, and Algorithms

    No full text
    Dealing with multiple manifestations of the same real-world entity across several data sources is a very common challenge for many modern applications, including life science applications. This challenge is referenced as data heterogeneity in the data management research field where the final aim is often to get a unified or integrated view of the real-world entities represented in the data sources. Data heterogeneity is a long-standing challenge that has attracted much interest in different computer science disciplines. The main aim of the chapter is to show how data heterogeneity problems that are typical of life science application contexts can be afforded by adopting systematic solutions stemming from the computer science field. To this end, it focusses on the main sources of heterogeneity in the life science context, presents the main problems that arise when dealing with heterogeneity, and provides a review of the solutions proposed in the computer science literature

    A P2P-based Architecture for Semantic Web Service Automatic Composition

    No full text
    The ultimate vision for eBusiness is an Internet-based global market place, accessible to all enterprises, regardless of size and geographical location, where automatic cooperation and integration among firms are allowed and enhanced. A powerful mean for these purposes is represented by sharing, reusing and composing value-added services made available on the Web, i.e. Web services. In this scenario, by making the Web content machine accessible and understandable, semantic Web services aim to provide efficient and effective Web service automatic discovery, selection, and composition. As part of the NeP4B project, in this paper we propose an architecture to address these issues in a flexible and scalable P2P network

    The Valid Web: an XML/XSL Infrastructure for Temporal Management of Web Documents.

    No full text
    In this paper we present a temporal extension of the World Wide Web based on a complete XML/XSL infrastructure to support valid time. The proposed technique enables the explicit definition of temporal information within HTML/XML documents, whose contents can then be selectively accessed according to their valid time. By acting on a navigation validity context, the proposed solution makes it possible to “travel in time” in a given virtual environment with any XML-compliant browser; this allows, for instance, to cut personalized visit routes for a specific epoch in a virtual museum or a digital historical library, to visualize the evolution of an archaeological site through successives ages, to selectively access past issues of magazines, to browse historical time series (e.g. stock quote archives), etc. The proposed Web extensions have been tested on a demo prototype showing, as application example, the functionalities of a temporal Web museum

    Semantic Web Service Composition in the NeP4B Project: Challenges and Architectural Issues

    No full text
    Semantic Web service discovery and composition frameworks proposed so far assume for the most part a centralized registry that holds information of all the Web services available at any given time. This solution does not well cope with the scalability and flexibility requirements of dynamic, fast changing contexts. As part of the NeP4B project, in this paper we propose an alternative peer to peer architecture based on the Goal concept

    A Generalized Modeling Framework for Schema Versioning Support

    No full text
    Advanced object-oriented applications require the management of schema versions, in order to cope with changes in the structure of the stored data. Two types of versioning have been separately considered so far: branching and temporal.The former arose in application domains like CAD/CAM and software engineering, where different solutions have been proposed to support design schema versions (consolidated versions). The latter concerns temporal databases, where some works considered temporal schema versioning to fulfil advanced needs of other typical object-oriented applications like GIS and the multimedia ones.In this work, we propose a general model which integrates the two approaches by supporting both design and temporal schema versions.The model is provided with a complete set of schema change primitives for full-fledged version manipulation whose semantics is described in the paper

    Semantic Web Service Composition in the NeP4B Project: Challenges and Architectural Issues

    No full text
    SemanticWeb service discovery and composition frameworksproposed so far assume for the most part a centralized registry that holds information of all the Web services available at any given time. This solution does not well cope with the scalability and flexibility requirements of dynamic, fast changing contexts. As part of the NeP4B project, in this paper we propose an alternative peer to peer architecture based on the Goal concept

    Dealing with data and software interoperability issues in digital factories

    No full text
    The digital factory paradigm comprises a multi-layered integration of the information related to various activities along the factory and product lifecycle manufacturing related resources. A central aspect of a digital factory is that of enabling the product lifecycle stakeholders to collaborate through the use of software solutions. The digital factory thus expands outside the actual company boundaries and offers the opportunity for the business and its suppliers to collaborate on business processes that affect the whole supply chain. This paper discusses an interoperability architecture for digital factories. To this end, it delves into the issue by analysing the main challenges that must be addressed to support an integrated and scalable factory architecture characterized by access to services, aggregation of data, and orchestration of production processes. Then, it revises the state of the art in the light of these requirements and proposes a general architectural framework conjugating the most interesting features of serviceoriented architectures and data sharing architectures. The study is exemplified through a case study

    OLAP query reformulation in peer-to-peer data warehousing

    No full text
    Inter-business collaborative contexts prefigure a distributed scenario where companies organize and coordinate themselves to develop common and shared opportunities, but traditional business intelligence systems do not provide support to this end. To fill this gap, in this paper we envision a peer-to-peer data warehousing architecture based on a network of heterogeneous peers, each exposing query answering functionalities aimed at sharing business information. To enhance the decision making process, an OLAP query expressed on a peer needs to be properly reformulated on the local multidimensional schemata of the other peers. To this end, we present a language for the definition of mappings between the multidimensional schemata of peers and we introduce a query reformulation framework that relies on the translation of mappings, queries, and multidimensional schemata onto the relational level. Then, we formalize a query reformulation algorithm and prove two properties: correctness and closure, that are essential in a peer-to-peer setting. Finally, we discuss the main implementation issues related to the reformulation setting proposed, with specific reference to the case in which the local multidimensional engines hosted by peers use the standard MDX language

    Unordered XML Pattern Matching with Tree Signatures (Extended Abstract)

    No full text
    Pavel Zezula , Federica Mandreoli , and Riccardo Martoglia Masaryk University, Brno, Czech Republic [email protected] University of Modena and Reggio Emilia, Modena, Italy {mandreoli.federica, martoglia.riccardo}@unimo.it Abstract. We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find qualifying patterns through integration of structurally consistent query path qualifications
    corecore