• Aucun résultat trouvé

query performance

Predicting SPARQL Query Performance

Predicting SPARQL Query Performance

... 1 Query Performance Prediction The emerging dataspace of Linked Data presents tremendous potential for large- scale data integration over cross domain data to support a new generation of intelligent ...a ...

5

Predicting SPARQL Query Performance and Explaining Linked Data

Predicting SPARQL Query Performance and Explaining Linked Data

... Web query processing, SPARQL query engines can be categorized into two categories: SQL-based and RDF native query en- gines ...SQL-based query engines rely on relational database systems stor- ...

11

Forward and Backward Feature Selection for Query Performance Prediction

Forward and Backward Feature Selection for Query Performance Prediction

... In terms of performance prediction, we found that our model is consistently better than non-selective linear regression. We also compare our model with the penalized regression model called LASSO [17], which ...

9

A Machine Learning Approach to SPARQL Query Performance Prediction

A Machine Learning Approach to SPARQL Query Performance Prediction

... SPARQL query cost estimation ap- proaches are based on data statistics and ...for query cost estimation is ...SPARQL query cost estimation. We learn SPARQL query performance metrics ...

9

Forward and Backward Feature Selection for Query Performance Prediction

Forward and Backward Feature Selection for Query Performance Prediction

... of query performance prediction (QPP) is to automatically estimate the effectiveness of a search result for any given query, without relevance ...the query running time is of utter ...of ...

10

Predicting query performance and explaining results to assist Linked Data consumption

Predicting query performance and explaining results to assist Linked Data consumption

... Predicting Query Performance we assign randomly selected RDF terms from the RDF data set to the placeholders in the query ...measure query performance under normal op- erational ...

211

Predicting SPARQL Query Execution Time and Suggesting SPARQL Queries Based on Query History

Predicting SPARQL Query Execution Time and Suggesting SPARQL Queries Based on Query History

... SPARQL query execution time prior to query execution; (ii) how to suggest similar SPARQL queries based on query ...study query performance, we apply the same scientific approach that ...

19

On the impact of domain expertise on query formulation, relevance assessment and retrieval performance in clinical settings

On the impact of domain expertise on query formulation, relevance assessment and retrieval performance in clinical settings

... non-experts, query performance was computed using the MAP and NDCG scores based on various pools of gold ...system performance comparisons for effectiveness measures con- sidering both numerical and ...

20

Combined complexity of probabilistic query evaluation

Combined complexity of probabilistic query evaluation

... The algorithm transforms the input circuit bottom-up, considering all possible valuations of the gates in each bag of the tree decomposition, and keeping track of additional information to remember which guessed values ...

177

Query enumeration and nowhere dense graphs

Query enumeration and nowhere dense graphs

... FO query only talk about neighborhoods of elements and that two unrelated el- ements of the database can be treated independently [ 35 ...FO query can effectively be decomposed into local queries [ 45 ...

125

Linguistic features to predict query difficulty

Linguistic features to predict query difficulty

... 4.1. Linguistic Features The use of linguistic features in order to study a document is a well-known technique. It has been thoroughly used in several NLP tasks, ranging from classification to genre analysis. The ...

4

SPARQL Query Containment under Schema

SPARQL Query Containment under Schema

... conjunctive query containment has been studied using contain- ment mappings also known as graph homomorphism and canonical ...queries, query answering and con- tainment are equivalent problems since ...

42

A Generic Mapping-Based Query Translation from SPARQL to Various Target Database Query Languages

A Generic Mapping-Based Query Translation from SPARQL to Various Target Database Query Languages

... look at (Michel et al., 2015a; Callou et al., 2015). We consider a MongoDB database with a collection people depicted in Listing 1: each JSON document provides the identifier, email addresses and contacts of a person; ...

13

On Armstrong-compliant Logical Query Languages

On Armstrong-compliant Logical Query Languages

... Paper contribution. We extend the relational domain cal- culus with attribute-variables and schema-variables that range over attributes and sets of attributes respectively. A simple logical language called RL for ...

9

IRIT-QFR: IRIT Query Feature Resource

IRIT-QFR: IRIT Query Feature Resource

... of query fea- tures associated with TREC adhoc ...of query features: linguistics features that can be calculated from the query itself, prior to any search although some are collection-dependent and ...

13

Heuristics-based SPARQL Query Planning

Heuristics-based SPARQL Query Planning

... best query plan Aiming at finding the best query plan, we search ESG using the estimated costs on vertices and edges from section ...candidate query plans in advance because a trade-off is necessary ...

21

Complex correspondences for query patterns rewriting

Complex correspondences for query patterns rewriting

... to query patterns rewriting, the problem can be seen, at a lower level of abstraction, as a problem of SPARQL ...rewriting query patterns is close to these SPARQL rewriting proposals in the sense of using ...

13

Query-Oriented Summarization of RDF Graphs

Query-Oriented Summarization of RDF Graphs

... The Resource Description Framework (RDF) is a graph- based data model promoted by the W3C as the standard for Semantic Web applications. Its associated query language is SPARQL. RDF graphs are often large and ...

5

Combined Complexity of Probabilistic Query Evaluation

Combined Complexity of Probabilistic Query Evaluation

... The algorithm transforms the input circuit bottom-up, considering all possible valuations of the gates in each bag of the tree decomposition, and keeping track of additional information to remember which guessed values ...

177

Query-Oriented Summarization of RDF Graphs

Query-Oriented Summarization of RDF Graphs

... for query optimization as typically used in semi-structured graph data management [10] ...is query- oriented, ...instance, query- ing a summary of a graph should reflect whether the query has ...

6

Show all 5135 documents...

Sujets connexes