Query languages for graph databases
PT Wood - ACM Sigmod Record, 2012 - dl.acm.org
Query languages for graph databases started to be investigated some 25 years ago. With
much current data, such as linked data on the Web and social network data, being graph …
much current data, such as linked data on the Web and social network data, being graph …
Natural language interfaces to ontologies: Combining syntactic analysis and ontology-based lookup through the user interaction
D Damljanovic, M Agatonovic… - Extended Semantic Web …, 2010 - Springer
With large datasets such as Linked Open Data available, there is a need for more user-
friendly interfaces which will bring the advantages of these data closer to the casual users …
friendly interfaces which will bring the advantages of these data closer to the casual users …
Querying linked data graphs using semantic relatedness: A vocabulary independent approach
Linked Data brings inherent challenges in the way users and applications consume the
available data. Users consuming Linked Data on the Web, should be able to search and …
available data. Users consuming Linked Data on the Web, should be able to search and …
Combining approximation and relaxation in semantic web path queries
We develop query relaxation techniques for regular path queries and combine them with
query approximation in order to support flexible querying of RDF data when the user lacks …
query approximation in order to support flexible querying of RDF data when the user lacks …
Handling failing RDF queries: from diagnosis to relaxation
Recent years have witnessed the development of large knowledge bases (KBs). Due to the
lack of information about the content and schema semantics of KBs, users are often not able …
lack of information about the content and schema semantics of KBs, users are often not able …
Model checking infinite-state systems: generic and specific approaches
AW To - 2010 - era.ed.ac.uk
Model checking is a fully-automatic formal verification method that has been extremely
successful in validating and verifying safety-critical systems in the past three decades. In the …
successful in validating and verifying safety-critical systems in the past three decades. In the …
Learning to hash for efficient search over incomplete knowledge graphs
Knowledge graph (KG) embedding techniques represent entities and relations as low-
dimensional, continuous vectors, and thus enables machine learning models to be easily …
dimensional, continuous vectors, and thus enables machine learning models to be easily …
Ranking documents semantically using ontological relationships
Although arguable success of today's keyword based search engines in certain information
retrieval tasks, ranking search results in a meaningful way remains an open problem. In this …
retrieval tasks, ranking search results in a meaningful way remains an open problem. In this …
Query answering over uncertain RDF knowledge bases: explain and obviate unsuccessful query results
Several large uncertain knowledge bases (KBs) are available on the Web where facts are
associated with a certainty degree. When querying these uncertain KBs, users seek high …
associated with a certainty degree. When querying these uncertain KBs, users seek high …
On addressing the empty answer problem in uncertain knowledge bases
Abstract Recently, several large Knowledge Bases (KBs) have been constructed by mining
the Web for information. As an increasing amount of inconsistent and non-reliable data are …
the Web for information. As an increasing amount of inconsistent and non-reliable data are …