![]() ![]() Concurrent execution of thousand subqueries generated by multiple fed-erated query engines makes the query tracking process challenging and uncertain. In this paper, we propose FETA (FEderated query TrAcking), a query tracking algorithm that infers Basic Graph Patterns (BGPs) processed by a federation from a shared log maintained by data providers. Consequently, unlike warehousing approaches, LD data providers have no access to secondary data. However, as feder-ated queries are decomposed into potentially thousands of subqueries distributed among SPARQL endpoints, data providers do not know fed-erated queries, they only know subqueries they process. more Federated query engines allow data consumers to execute queries over the federation of Linked Data (LD). Moreover, results abo.įederated query engines allow data consumers to execute queries over the federation of Linked Dat. The match between web page concepts and ontology concepts is then pres ented. At each candidate concept is associated a couple of coefficient: the convenience coeffici ent and the weighted frequency coefficient. Th en, from the previous extracted terms, associated concepts are generated using a linguistic ontology and a sem ntic similarity measure. They used a web page particularity: HTML markers. Natural language techniques ba sed on extraction of well-formed terms are also presented. This disambiguation process uses several hierarchical heurist ics that take advantage of the “isa” relationship on both the ontology and the thesaurus. ![]() First, a linguistic ontology (a thesaurus) is used to isambiguate the label of ontology concepts. Ontologies are used to index a web site and, as a result to represent the web pages content. more This report presents a new approach to index a web site using o ntologies and natural language techniques for Internet information retrieval. This report presents a new approach to index a web site using o ntologies and natural language te. In this paper, we propose h-LSEQ, an improvement of LSEQ that preserves its. While experiments show that it works locally, it fails to provide this bound with multiple users and latency. LSEQ lowers the space complexity of variable-size identifiers CRDTs from linear to sub-linear. Recently, a strategy for assigning variable-size identifiers called LSEQ has been proposed for CRDTs for sequences. The identifiers of elements can be either of fixed-size or variable-size. CRDTs for sequences model a document as a set of elements (character, line, paragraph, etc.) with unique identifiers, providing two commutative update operations: insert and delete. CRDTs encompass a set of well-known data types such as sets, graphs, sequences, etc. In this paper, we focus on distributed collaborative editors based on the Conflict-free Replicated Data Type approach (CRDT). more Distributed collaborative editors such as Google Docs or Etherpad allow to distribute the work across time, space and organizations. ĭistributed collaborative editors such as Google Docs or Etherpad allow to distribute the work ac. Ce mod\`ele propose de repr\'esenter un sch\'ema XML sous la forme d'un graphe mettant en valeur les caract\'eristiques structurelles des documents valides. ![]() Nous avons donc mis au point un mod\`ele permettant d'appuyer l'enseignement de XML. Dans le cadre des formations en informatique, il est indispensable d'initier les \'etudiants \`a ce format et, surtout, \`a tout son \'eco-syst\`eme. We present in this report different graphic elements of the model and the improvements it brings to data modeling in XML.-XML est un format actuellement tr\`es utilis\'e. We propose to represent an XML schema as a graph highlighting the structural characteristics of the valide documents. We have developed a model to support the teaching of XML. In the context of computer science teaching, it is necessary to introduce students to this format and, especially, at its eco-system. more Currently, XML is a format widely used. In the context of computer science teaching, it is necess. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |