36
U

Property:Has Results

From Openresearch
Jump to: navigation, search

This is a property of type Text.

Pages using the property "Has Results"

Showing 25 pages using this property.

View (previous 25 | next 25) (20 | 50 | 100 | 250 | 500)

A
Adaptive Integration of Distributed Semantic Web Data +No data available now.  +
AgreementMaker: Efficient Matching for Large Real-World Schemas and Ontologies +Experiments have shown that our quality measure is usually effective in defining weights for the LWC matcher.  +
Analysing Scholarly Communication Metadata of Computer Science Events +No data available now.  +
Avalanche: Putting the Spirit of the Web back into Semantic Web Querying +Avalanche is able to successfully execute query plans and retrieves many up-to-date results without having any prior knowledge of the data distribution. We, furthermore, see that different objective functions have a significant influence on the outcome and should play a critical role when deployed on the Semantic Web.  +
B
Bringing Relational Databases into the Semantic Web: A Survey +No data available now.  +
C
Cross: an OWL wrapper for teasoning on relational databases +No data available now.  +
D
D2RQ – Treating Non-RDF Databases as Virtual RDF Graphs +No data available now.  +
DataMaster – a Plug-in for Importing Schemas and Data from Relational Databases into Protégé +No data available now.  +
Discovering and Maintaining Links on the Web of Data +No data available now.  +
F
FedX: Optimization Techniques for Federated Query Processing on Linked Data +With our optimization techniques, we are able to reduce the number of requests significantly, e.g., from 170,579 (DARQ) and 93,248 (AliBaba) to just 23 (FedX) for query CD3.  +
From Relational Data to RDFS Models +No data available now.  +
I
Integration of Scholarly Communication Metadata using Knowledge Graphs +No data available now.  +
K
KnoFuss: A Comprehensive Architecture for Knowledge Fusion +-  +
L
LIMES - A Time-Efficient Approach for Large-Scale Link Discovery on the Web of Data +LIMES outperforms SILK in all experimental settings. It is important to notice that the difference in performance grows with the (product of the) size of the source and target knowledge bases.  +
LogMap: Logic-based and Scalable Ontology Matching +No data available now.  +
O
Optimizing SPARQL Queries over Disparate RDF Data Sources through Distributed Semi-joins +No data available now.  +
Q
Querying Distributed RDF Data Sources with SPARQL +The experiments show that our optimizations significantly improve query evaluation performance. For query Q1 the execution times of optimized and unoptimized execution are almost the same. This is due to the fact that the query plans for both cases are the same and bind joins of all sub-queries in order of appearance is exact the right strategy. For queries Q2 and Q4 the unoptimized queries took longer than 10 min to answer and timed out, whereas the execution time of the optimized queries is quiet reasonable. The optimized execution of Q1 and Q2 takes almost the same time because Q2 is rewritten into Q1.  +
Querying over Federated SPARQL Endpoints : A State of the Art Survey +{{{Results}}}  +
Querying the Web of Data with Graph Theory-based Techniques +We divide evaluation results of GDS, FedX and DARQ into three categories. First is query performance related metrics. Limited by space, we only provide QPS in this paper7. Second is system loads including CPU usage and memory usage. Third is network overhead including uploading data and downloading data. Here we especially compare GDS with FedX, because DARQ fails providing correct results or is time out on many queries.  +
Querying the Web of Interlinked Datasets using VOID Descriptions +-  +
R
RDB2ONT: A Tool for Generating OWL Ontologies From Relational Database Systems +No data available now.  +
Relational.OWL - A Data and Schema Representation Format Based on OWL +No data available now.  +
S
SERIMI – Resource Description Similarity, RDF Instance Matching and Interlinking +No data available now.  +
SLINT: A Schema-Independent Linked Data Interlinking System +SLINT system totally outperforms the others on both precision and recall. AgreementMaker has a competitive precision with SLINT on dataset D3 but this system is much lower in recall. Zhishi.Links results on dataset D3 are very high, but the F1 score of SLINT is still 0.05 higher in overall.  +
SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions +AliBaba and DARQ fail to return results for six out of the 14 queries for different reasons. AliBaba generates malformed sub queries for CD3, CD5, LS6, and LS7. DARQ can not handle the unbound predicate in CD1 and LS2. For CD3 and CD5 DARQ opens too many connections to GeoNames. All other unsuccessful queries take longer than the time limit of five minutes. Overall, FedX has the best query evaluation performance. The reason is its novel and efficient query execution based on block transmission of result tuples and parallelization of joins. However, there is only a significant difference between FedX and SPLENDID for CD6, CD7, LS3, LS5-7. For the other queries SPLENDID is close to FedX and for CD3 and CD4 even slightly faster, which indicates that SPLENDID, indeed, generates better query execution plans.  +
Facts about "Has Results"
Has type
"Has type" is a predefined property that describes the datatype of a property and is provided by Semantic MediaWiki.
Text +