Griwes: Generic Model and Preliminary Specifications for a Graph-Based Knowledge Representation Toolkit, ICCS'2008, 2008. ,
DOI : 10.1007/978-3-540-70596-3_21
URL : https://hal.archives-ouvertes.fr/lirmm-00389753
Frequent graph pattern to advertise the content of rdf triple stores on the web, Web Science Conference, 2010. ,
Bridging the semantic Web and Web 2.0 with Representational State Transfer (REST), Web Semantics: Science, Services and Agents on the World Wide Web, vol.6, issue.1, pp.61-69, 2008. ,
DOI : 10.1016/j.websem.2007.11.002
Web, Graphs and Semantics, ICCS'2008, 2008. ,
DOI : 10.1007/978-3-540-70596-3_3
Querying the semantic web with the corese search engine, ECAI'2004, pp.705-709, 2004. ,
Scalable Grounded Conjunctive Query Evaluation over Large and Expressive Knowledge Bases, ISWC'2008, pp.403-418, 2008. ,
DOI : 10.1007/3-540-45744-5_59
The Summary Abox: Cutting Ontologies Down to Size, ISWC'2006, pp.343-356, 2006. ,
DOI : 10.1007/11926078_25
Agents handling annotation distribution in a corporate semantic web, Web Intelligence and Agent Systems, vol.1, issue.1, pp.23-45, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-01146425
Un modele d'index pour la résolution distribuée de requetes sur un nombre restreint de bases d'annotations rdf, 2008. ,
Join index hierarchies for supporting efficient navigations in objectoriented databases, VLDB'1994, pp.522-533, 1994. ,
Fsp: Frequent substructure pattern mining, ICICS'07, pp.10-13, 2007. ,
Data summaries for on-demand queries over linked data, Proceedings of the 19th international conference on World wide web, WWW '10, pp.411-420, 2010. ,
DOI : 10.1145/1772690.1772733
Efficient mining of frequent subgraphs in the presence of isomorphism, Third IEEE International Conference on Data Mining, pp.549-552, 2003. ,
DOI : 10.1109/ICDM.2003.1250974
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, PKDD'00, pp.13-23, 2000. ,
DOI : 10.1007/3-540-45372-5_2
Frequent subgraph discovery, Proceedings 2001 IEEE International Conference on Data Mining, pp.313-320, 2001. ,
DOI : 10.1109/ICDM.2001.989534
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7488
Graph Summaries for Subgraph Frequency Estimation, ESWC'08, pp.508-523, 2008. ,
DOI : 10.1007/978-3-540-68234-9_38
URL : http://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=2175&context=knoesis
Index structures and algorithms for querying distributed RDF repositories, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.10-14, 2004. ,
DOI : 10.1145/988672.988758
Comparing data summaries for processing live queries over Linked Data, World Wide Web, vol.1, issue.1, pp.5-6495, 2011. ,
DOI : 10.1007/s11280-010-0107-z
URL : http://hdl.handle.net/11858/00-001M-0000-0010-1430-B
Computing frequent graph patterns from semistructured data, 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pp.458-465, 2002. ,
DOI : 10.1109/ICDM.2002.1183988
gspan: Graph-based substructure pattern mining, ICDM'02, pp.721-724, 2002. ,
CloseGraph, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.286-295, 2003. ,
DOI : 10.1145/956750.956784
Graph indexing, Proceedings of the 2004 ACM SIGMOD international conference on Management of data , SIGMOD '04, pp.335-346, 2004. ,
DOI : 10.1145/1007568.1007607