• Aucun résultat trouvé

query-based faceted search

Scalable Query-based Faceted Search on top of SPARQL Endpoints for Guided and Expressive Semantic Search

Scalable Query-based Faceted Search on top of SPARQL Endpoints for Guided and Expressive Semantic Search

... criteria based on previous research [ 10 , 17 , 24 , 14 ...a query language. We used those criteria to classify existing search systems into ...of search systems: the ones requiring one ...

40

Scalable Query-based Faceted Search on top of SPARQL Endpoints for Guided and Expressive Semantic Search

Scalable Query-based Faceted Search on top of SPARQL Endpoints for Guided and Expressive Semantic Search

... Existing search systems [ 10 , 17 , 23 , 14 ] can be classified according to a number of criteria: usability, expressivity, scalability, portability, flexibility and the formal degree of a query ...of ...

29

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

... Query-based Faceted Search allows for more expressive search than traditional set-based Faceted ...are query elements and selecting a facet adds it to the ...

5

Expressive and Scalable Query-Based Faceted Search over SPARQL Endpoints

Expressive and Scalable Query-Based Faceted Search over SPARQL Endpoints

... different profiles, and results are already instructive. On average, they have built correct queries for 7.8 questions. For non-IT people (2/6), the average goes only slightly down to 7. For people having some knowledge ...

17

Reconciling faceted search and query languages for the Semantic Web

Reconciling faceted search and query languages for the Semantic Web

... Abstract Faceted search and querying are two well-known paradigms to search the Semantic ...for search- ing RDF datasets, but they are difficult to use. Query assistants help users to ...

19

A Collaborative Document Ranking Model for a Multi-Faceted Search

A Collaborative Document Ranking Model for a Multi-Faceted Search

... multi-faceted search issue can arise within two search settings, namely the individual-based search and the collaborative ...Individual-based search is a classic IR ...

14

A Collaborative Document Ranking Model for a Multi-faceted Search

A Collaborative Document Ranking Model for a Multi-faceted Search

... multi-faceted search issue can arise within two search settings, namely the individual-based search and the collaborative ...Individual-based search is a classic IR ...

14

Combining Faceted Search and Query Languages for the Semantic Web

Combining Faceted Search and Query Languages for the Semantic Web

... the query will be syntactically correct and semantically consistent ...extend faceted search to the Semantic Web, so as to offer an exploratory search that is (1) easy to use, (2) safe, and ...

11

Linked data based exploratory search

Linked data based exploratory search

... Exploratory search can be used to describe an information- seeking problem context that is open-ended, persistent, and multi-faceted; and to describe information-seeking processes that are opportunistic, ...

295

Direct Search Based on Probabilistic Descent

Direct Search Based on Probabilistic Descent

... However, recent numerical results indicated that randomly generating the polling direc- tions without imposing the positive spanning property can improve the performance of these methods, especially when the number of ...

30

A License-Based Search Engine

A License-Based Search Engine

... licenses that are compliant with l i are above l i . We recall that the ordering relations of compatibility and compliance that we define are reflexive, transitive and asymmetric. During the demonstration, attendees will ...

6

Multiple query evaluation based on an enchanced genetic algorithm

Multiple query evaluation based on an enchanced genetic algorithm

... multiple query evaluation are based on a residual ranking ...single query evaluation results at the same iteration, wich corresponds to the list resulting from just keeping the next 15 documents at ...

18

Implementation of SPARQL Query Language Based on Graph Homomorphism

Implementation of SPARQL Query Language Based on Graph Homomorphism

... 3 Highest Precedence for Relations in Conceptual Graphs Our algorihm takes advantage of the hypergraph structure of our representation of rdf graphs as conceptual graphs to limit the search space for node ...

6

Improving People Search Using Query Expansions: How Friends Help To Find People

Improving People Search Using Query Expansions: How Friends Help To Find People

... text-based query over captions can significantly improve search ...can search for a large group of highly similar ...improve search results by exploiting faces of other people that ...

15

Query-based Comparison of Mappings in Ontology-based Data Access

Query-based Comparison of Mappings in Ontology-based Data Access

... in query answering, since its form may affect the system per- formance in answering queries: different, yet semantically equivalent specifications may give rise to very different exe- cution times for the same ...

17

A faceted search system for facilitating discovery-driven scientific activities: a use case from functional ecology

A faceted search system for facilitating discovery-driven scientific activities: a use case from functional ecology

... gation of the information available in multiple data sources. Our previous work focused on how metadata could be exploited during the collaborative building of a thesaurus, through edition and extension mechanisms using ...

13

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

... Unbehauen et al. (Unbehauen et al., 2013a) de- fine the concept of compatibility between the RDF terms of a triple pattern and R2RML term maps. This more general approach effectively manages vari- able predicate maps, ...

13

Explanation-Based Large Neighborhood Search

Explanation-Based Large Neighborhood Search

... Local search techniques are very effective to solve hard optimization ...local search techniques is the Large Neighborhood Search (LNS) algorithm [25, ...a search iteration instead of ...

66

R2 Indicator Based Multiobjective Search

R2 Indicator Based Multiobjective Search

... fronts based on different quality indicators were ana- lyzed in order to select the most suitable indicator for the used Sequential Parameter Optimization (SPO) ...

27

Rewriting-Based Query Answering for Semantic Data Integration Systems

Rewriting-Based Query Answering for Semantic Data Integration Systems

... at query time, a query is first reformulated using the ontological knowledge, then the ob- tained reformulation is rewritten into another query using the ...

17

Show all 10000 documents...

Sujets connexes