13 research outputs found

    SemLAV: Local-As-View Mediation for SPARQL Queries

    Get PDF
    International audienceThe Local-As-View(LAV) integration approach aims at querying heterogeneous data in dynamic environments. In LAV, data sources are described as views over a global schema which is used to pose queries. Query processing requires to generate and execute query rewritings, but for SPARQL queries, the LAV query rewritings may not be generated or executed in a reasonable time. In this paper, we present SemLAV, an alternative technique to process SPARQL queries over a LAV integration system without generating rewritings. SemLAV executes the query against a partial instance of the global schema which is built on-the-fly with data from the relevant views. The paper presents an experimental study for SemLAV, and compares its performance with traditional LAV-based query processing techniques. The results suggest that SemLAV scales up to SPARQL queries even over a large number of views, while it significantly outperforms traditional solutions

    Enabling Semantics in Enterprises

    No full text

    Fuzzy Semantic Labeling of Semi-structured Numerical Datasets

    No full text
    SPARQL endpoints provide access to rich sources of data (e.g. knowledge graphs), which can be used to classify other less structured datasets (e.g. CSV files or HTML tables on the Web). We propose an approach to suggest types for the numerical columns of a collection of input files available as CSVs. Our approach is based on the application of the fuzzy c-means clustering technique to numerical data in the input files, using existing SPARQL endpoints to generate training datasets. Our approach has three major advantages: it works directly with live knowledge graphs, it does not require knowledge-graph profiling beforehand, and it avoids tedious and costly manual training to match values with types. We evaluate our approach against manually annotated datasets. The results show that the proposed approach classifies most of the types correctly for our test sets

    Exposing open street map in the linked data cloud

    No full text
    After the mobile revolution, geographical knowledge has getting more and more importance in many location-aware application scenarios. Its popularity influenced also the production and publication of dedicated datasets in the Linked Data (LD) cloud. In fact, its most recent representation shows Geonames competing with DBpedia as the largest and most linked knowledge graph available in the Web. Among the various projects related to the collection and publication of geographical information, as of today, Open Street Map (OSM) is for sure one of the most complete and mature one exposing a huge amount of data which is continually updated in a crowdsourced fashion. In order to make all this knowledge available as Linked Data, we developed LOSM: a SPARQL endpoint able to query the data available in OSM by an on-line translation form syntax to a sequence of calls to the OSM overpass API. The endpoint makes also possible an on-the-fly integration among Open Street Map information and the one contained in external knowledge graphs such as DBpedia, Freebase or Wikidata

    RODI: Benchmarking relational-to-ontology mapping generation quality

    No full text
    Accessing and utilizing enterprise or Web data that is scattered across multiple data sources is an important task for both applications and users. Ontology-based data integration, where an ontology mediates between the raw data and its consumers, is a promising approach to facilitate such scenarios. This approach crucially relies on useful mappings to relate the ontology and the data, the latter being typically stored in relational databases. A number of systems to support the construction of such mappings have recently been developed. A generic and effective benchmark for reliable and comparable evaluation of the practical utility of such systems would make an important contribution to the development of ontology-based data integration systems and their application in practice. We have proposed such a benchmark, called RODI. In this paper, we present a new version of RODI, which significantly extends our previous benchmark, and we evaluate various systems with it. RODI includes test scenarios from the domains of scientific conferences, geographical data, and oil and gas exploration. Scenarios are constituted of databases, ontologies, and queries to test expected results. Systems that compute relational-to-ontology mappings can be evaluated using RODI by checking how well they can handle various features of relational schemas and ontologies, and how well the computed mappings work for query answering. Using RODI, we conducted a comprehensive evaluation of seven systems

    Equivalent Rewritings on Path Views with Binding Patterns

    No full text
    International audienceA view with a binding pattern is a parameterized query on a database. Such views are used, e.g., to model Web services. To answer a query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services
    corecore