Ontology Query Languages for Ontology-Based Databases

2010 ◽  
pp. 227-247
Author(s):  
Stéphane Jean ◽  
Yamine Aït Ameur ◽  
Guy Pierra
Keyword(s):  
Semantic Web ◽  
Query Languages ◽  
Logical Model ◽  
Web Community ◽  
New Generation ◽  
Current Database

Current databases and their associated languages allow a user to exploit data according to their logical model. Usually, there is a gap between this logical model and the actual concepts represented. As a consequence, exploiting, exchanging and integrating data stored in databases are difficult. To overcome these problems, several approaches have proposed to extend current databases with ontologies. We called Ontology-Based Databases (OBDB) such databases. However, current database languages such as SQL have not been designed to exploit ontologies. Thus, a new generation of languages we called ontology query languages has emerged. The goal of this chapter is to provide an up to date survey on ontology query languages. We survey languages coming from the Semantic Web community as well as those coming from the database community.

Querying the Web Reconsidered

2011 ◽  
pp. 190-212
Author(s):  
François Bry ◽  
Christoph Koch ◽  
Tim Furche ◽  
Sebastian Schaffert ◽  
Liviu Badea
Keyword(s):  
Semantic Web ◽  
Incomplete Data ◽  
Query Languages ◽  
Markup Language ◽  
Query By Example ◽  
Precise Knowledge ◽  
Recent Emergence ◽  
Heterogeneous Nature ◽  
New Generation ◽  
The Web

A decade of experience with research proposals as well as standardized query languages for the conventional Web and the recent emergence of query languages for the Semantic Web call for a reconsideration of design principles for Web and Semantic Web query languages. This chapter first argues that a new generation of versatile Web query languages is needed for solving the challenges posed by the changing Web: We call versatile those query languages able to cope with both Weband Semantic Web data expressed in any (Web or Semantic Web) markup language. This chapter further suggests that well-known referential transparency and novel answer-closedness are essential features of versatile query languages. Indeed, they allow queries to be considered like forms and answers like form-fillings in the spirit of the query-by-example paradigm. This chapter finally suggests that the decentralized and heterogeneous nature of the Web requires incomplete data specifications (or incomplete queries) and incomplete data selections (or incomplete answers); the form-like query can be specified without precise knowledge of the queried data, and answers can be restricted to contain only an excerpt of the queried data.

Semantic Web Query Languages

2018 ◽  
pp. 3429-3433
Author(s):  
James Bailey ◽  
François Bry ◽  
Tim Furche ◽  
Sebastian Schaffert
Keyword(s):  
Semantic Web ◽  
Query Languages

Service-Oriented Development of Workflow-Based Semantic Reasoning Applications

2016 ◽  
pp. 687-700
Author(s):  
Alexey Cheptsov ◽  
Stefan Wesner ◽  
Bastian Koller
Keyword(s):  
Semantic Web ◽  
High Performance ◽  
Web Applications ◽  
Heterogeneous Data ◽  
Multiple Sources ◽  
Semantic Reasoning ◽  
Service Oriented ◽  
Cloud Infrastructures ◽  
New Generation ◽  
Reasoning Algorithm

The modern Semantic Web scenarios require reasoning algorithms to be flexible, modular, and highly-configurable. A solid approach, followed in the design of the most currently existing reasoners, is not sufficient when dealing with today's challenges of data analysis across multiple sources of heterogeneous data or when the data amount grows to the “Big Data” sizes. The “reasoning as a workflow” concept has attracted a lot of attention in the design of new-generation Semantic Web applications, offering a lot of opportunities to improve both flexibility and scalability of the reasoning process. Considering a single workflow component as a service offers a lot of opportunities for a reasoning algorithm to target a much wider range of potentially enabled Semantic Web use cases by taking benefits of a service-oriented and component-based implementation. We introduce a technique for developing service-oriented Semantic Reasoning applications based on the workflow concept. We also present the Large Knowledge Collider - a software platform for developing workflow-based Semantic Web applications, taking advantages of on-demand high performance computing and cloud infrastructures.

A Next Generation of IT

2020 ◽  
pp. 2048-2071
Author(s):  
Anthony J. Mallia
Keyword(s):  
Semantic Web ◽  
Health Record ◽  
Snomed Ct ◽  
Model Driven ◽  
Generation Computing ◽  
Wiki Technology ◽  
Hl7 Fhir ◽  
High Level ◽  
New Generation ◽  
Semantic Mediawiki

A potential new generation computing environment is emerging which combines wiki technology with semantic web concepts. This has brought about the fusion of the wiki execution ecosystem, a semantic web for model-driven applications, and a high-level language as an extension to wiki text for accelerated development. Semantic MediaWiki provides this platform and a fragment of a health record, including allergy intolerance as structured in HL7 FHIR with terminology bindings to SNOMED CT and to HL7 terminologies was developed by the author in a short timeframe (approximately 10 hours). The system navigates around the health record and controls the entry of terms in the record from controlled ValueSets. All terminologies and ValueSets are integrated into the prototype.

A Semantic Web-Based Approach for Building Personalized News Services

2011 ◽  
pp. 503-521
Author(s):  
Flavius Frasincar ◽  
Jethro Borsje ◽  
Leonard Levering
Keyword(s):  
Semantic Web ◽  
Language Processing ◽  
Word Sense Disambiguation ◽  
Query Languages ◽  
Word Sense ◽  
Web Based ◽  
Semantic Query ◽  
Web Standards ◽  
Processing Techniques ◽  
News Services

This article proposes Hermes, a Semantic Webbased framework for building personalized news services. It makes use of ontologies for knowledge representation, natural language processing techniques for semantic text analysis, and semantic query languages for specifying wanted information. Hermes is supported by an implementation of the framework, the Hermes News Portal, a tool which allows users to have a personalized online access to news items. The Hermes framework and its associated implementation aim at advancing the state-of-the-art of semantic approaches for personalized news services by employing Semantic Web standards, exploiting domain information, using a word sense disambiguation procedure, and being able to express temporal constraints for the desired news items.

WEBCONTENT VISUALIZER: A VISUALIZATION SYSTEM FOR SEARCH ENGINES IN SEMATIC WEB

2011 ◽  
Vol 10 (05) ◽  
pp. 913-931 ◽  
Author(s):  
XIANYONG FANG ◽  
CHRISTIAN JACQUEMIN ◽  
FRÉDÉRIC VERNIER
Keyword(s):  
Semantic Web ◽  
Search Engine ◽  
Search Engines ◽  
Web Search ◽  
Search Query ◽  
Visualization System ◽  
Xml Documents ◽  
Web Search Engines ◽  
New Generation

Since the results from Semantic Web search engines are highly structured XML documents, they cannot be efficiently visualized with traditional explorers. Therefore, the Semantic Web calls for a new generation of search query visualizers that can rely on document metadata. This paper introduces such a visualization system called WebContent Visualizer that is used to display and browse search engine results. The visualization is organized into three levels: (1) Carousels contain documents with the same ranking, (2) carousels are piled into stacks, one for each date, and (3) these stacks are organized along a meta-carousel to display the results for several dates. Carousel stacks are piles of local carousels with increasing radii to visualize the ranks of classes. For document comparison, colored links connect documents between neighboring classes on the basis of shared entities. Based on these techniques, the interface is made of three collaborative components: an inspector window, a visualization panel, and a detailed dialog component. With this architecture, the system is intended to offer an efficient way to explore the results returned by Semantic Web search engines.

Service-Oriented Development of Workflow-Based Semantic Reasoning Applications

2014 ◽  
Vol 5 (1) ◽  
pp. 40-53
Author(s):  
Alexey Cheptsov ◽  
Stefan Wesner ◽  
Bastian Koller
Keyword(s):  
Semantic Web ◽  
High Performance ◽  
Web Applications ◽  
Heterogeneous Data ◽  
Multiple Sources ◽  
Semantic Reasoning ◽  
Service Oriented ◽  
Cloud Infrastructures ◽  
New Generation ◽  
Reasoning Algorithm

The modern Semantic Web scenarios require reasoning algorithms to be flexible, modular, and highly-configurable. A solid approach, followed in the design of the most currently existing reasoners, is not sufficient when dealing with today's challenges of data analysis across multiple sources of heterogeneous data or when the data amount grows to the “Big Data” sizes. The “reasoning as a workflow” concept has attracted a lot of attention in the design of new-generation Semantic Web applications, offering a lot of opportunities to improve both flexibility and scalability of the reasoning process. Considering a single workflow component as a service offers a lot of opportunities for a reasoning algorithm to target a much wider range of potentially enabled Semantic Web use cases by taking benefits of a service-oriented and component-based implementation. We introduce a technique for developing service-oriented Semantic Reasoning applications based on the workflow concept. We also present the Large Knowledge Collider - a software platform for developing workflow-based Semantic Web applications, taking advantages of on-demand high performance computing and cloud infrastructures.

Nested Optional Join for Efficient Evaluation of SPARQL Nested Optional Graph Patterns

2010 ◽  
pp. 281-308
Author(s):  
Artem Chebotko ◽  
Shiyong Lu
Keyword(s):  
Semantic Web ◽  
Relational Databases ◽  
Real Life ◽  
Query Languages ◽  
Efficient Algorithms ◽  
Relational Algebra ◽  
Nested Loops ◽  
Web Data Management ◽  
Rdf Data ◽  
Rdf Query Languages

Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF data using SQL and RDF query languages. This chapter studies how RDF queries with the so called well-designed graph patterns and nested optional patterns can be efficiently evaluated in an RDBMS. The authors propose to extend relational algebra with a novel relational operator, nested optional join (NOJ), that is more efficient than left outer join in processing nested optional patterns of well-designed graph patterns. They design three efficient algorithms to implement the new operator in relational databases: (1) nested-loops NOJ algorithm, NL-NOJ, (2) sort-merge NOJ algorithm, SM-NOJ, and (3) simple hash NOJ algorithm, SH-NOJ. Using a real life RDF dataset, the authors demonstrate the efficiency of their algorithms by comparing them with the corresponding left outer join implementations and explore the effect of join selectivity on the performance of these algorithms.

Sign in / Sign up

Export Citation Format

Share Document