Ephedra: Efficiently Combining RDF Data and Services Using SPARQL Federation

  title={Ephedra: Efficiently Combining RDF Data and Services Using SPARQL Federation},
  author={Andriy Nikolov and Peter Haase and Johannes Trame and Artem Kozlov},
Knowledge graph management use cases often require addressing hybrid information needs that involve multitude of data sources, multitude of data modalities (e.g., structured, keyword, geospatial search), and availability of computation services (e.g., machine learning and graph analytics algorithms). Although SPARQL queries provide a convenient way of expressing data requests over RDF knowledge graphs, the level of support for hybrid information needs is limited: existing query engines usually… 
Integrando Bases Autônomas Externas no Processamento de Consultas em Bases RDF Distribuídas
This article proposes an alternative to the federated architecture, called FeSHyD, which explores a distributed proprietary base, allowing its servers to communicate with third-party databases during the query processing.
Combining RDF Graph Data and Embedding Models for an Augmented Knowledge Graph
RDF data is integrated with vector space models to construct an augmented knowledge graph to be used in customer applications and federated hybrid SPARQL queries are used for combining explicit information stated in the graph, implicit information from the associated embedding models, and information extracted using vector embeddings in a transparent way for the end user.
Bringing Federated Semantic Queries to the GIS-Based Scenario
This work presents an approach to request, retrieve, and consume (geospatial) knowledge graphs available at diverse and distributed platforms, prototypically implemented on Apache Marmotta, supporting SPARQL 1.1 and GeoSPARQL standards.
metaphactory: A platform for knowledge graph management
The paper discusses how the platform architecture design built on open standards enables its reusability in various application domains and use cases as well as facilitates integration of the knowledge graph with other parts of the organizational data and software infrastructure.


SCRY: Extending SPARQL with Custom Data Processing Methods for the Life Sciences
SCRY is a lightweight SPARQL endpoint that interprets parts of basic graph patterns as input for user defined procedures, generating an RDF graph against which the query is resolved on-demand, and incorporates BLAST in a query which simultaneously finds the tissues expressing Hemoglobin β and its homologs.
FedSearch: Efficiently Combining Structured Queries and Full-Text Search in a SPARQL Federation
FedSearch — a novel hybrid query engine based on the SPARQL federation framework FedX is presented, extending the SParQL algebra to incorporate keyword search clauses as first-class citizens and applying novel optimization techniques to improve the query processing efficiency while maintaining a meaningful ranking of results.
SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions
In order to leverage the full potential of the Semantic Web it is necessary to transparently query distributed RDF data sources in the same way as it has been possible with federated databases for
Extending SPARQL for Data Analytic Tasks
This work extended SPARQL with generalized service, constructs for accessing services beyond the SParQL endpoints supported by service, and provides an open source implementation in an RDF store called Quetzal, to evaluate its use in the two data analytic scenarios over real datasets.
FedX: Optimization Techniques for Federated Query Processing on Linked Data
FedX is presented, a practical framework that enables efficient SPARQL query processing on heterogeneous, virtually integrated Linked Data sources and achieves a significant improvement in query performance over state-of-the-art federated query engines.
HiBISCuS: Hypergraph-Based Source Selection for SPARQL Endpoint Federation
This work presents HiBISCuS, a novel hypergraph-based source selection approach to federated SParQL querying that can be directly combined with existing SPARQL query federation engines to achieve the same recall while querying fewer data sources.
ANAPSID: An Adaptive Query Processing Engine for SPARQL Endpoints
ANAPSID is presented, an adaptive query engine for SPARQL endpoints that adapts query execution schedulers to data availability and run-time conditions and speeds up execution time in some cases, in more than one order of magnitude.
Supporting views in data stream management systems
The sliding window approach is generalized by introducing the synchronization principle that empowers SyncSQL with a formal mechanism to express queries with arbitrary refresh conditions and the article introduces the Nile-SyncSQL prototype to support SyncSQL queries.
Efficient Execution of Top-K SPARQL Queries
An incremental execution model for $\mathcal{S}$PARQL-$\mathcal {R}$ANK queries is proposed, the performance of alternative physical operators are compared, and a rank-aware join algorithm optimized for native RDF stores is proposed.
Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1
An in-depth formal analysis of the semantics and expressive power of these new constructs as defined in the SPARQL 1.1 specification are provided, and hence lay the necessary foundations for the development of robust, scalable and extensible query engines supporting complex numerical and analytics tasks.