Search by property

Jump to: navigation, search

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

Search by property

A list of all pages that have property "Has Results" with value "No data available now.". Since there have been only a few results, also nearby values are displayed.

Showing below up to 28 results starting with #1.

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


    

List of results

    • SLINT: A Schema-Independent Linked Data Interlinking System  + (SLINT system totally outperforms the other
      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.
      of SLINT is still 0.05 higher in overall.)
    • Querying Distributed RDF Data Sources with SPARQL  + (The experiments show that our optimization
      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.
      same time because Q2 is rewritten into Q1.)
    • A Probabilistic-Logical Framework for Ontology Matching  + (Using stability constraints improves alignment quality with both learned and manually set weights.)
    • Querying the Web of Data with Graph Theory-based Techniques  + (We divide evaluation results of GDS, FedX
      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.
      ct results or is time out on many queries.)
    • ANAPSID: An Adaptive Query Processing Engine for SPARQL Endpoints  + (We observe that SHJ and ANAPSID operators
      We observe that SHJ and ANAPSID operators are able to produce the first tuple faster than ARQ or Hash join, even in an ideal scenario with no delays; further, ARQ performance is clearly aff_ected by data transfer distribution and its execution time can be almost two orders of magnitude greater than the time of SHJ or ANAPSID. We notice that SHJ and ANAPSID are competitive, this is because the number of intermediate results is very small, and the benefits of the RJTs cannot be exploited. This suggests that the performance of ANAPSID operators depends on the selectivity of the join operator and the data transfer delays.
      oin operator and the data transfer delays.)
    • 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.)
    • Querying over Federated SPARQL Endpoints : A State of the Art Survey  + ({{{Results}}})