Michel Scholl
About the author:
No description available of Michel Scholl...
Publications by Michel Scholl (bibliography)
» 2005 «
Mouza, Cédric du, Rigaux, Philippe and Scholl, Michel (2005): Efficient evaluation of parameterized pattern queries. In: Herzog, Otthein, Schek, Hans-Jörg and Fuhr, Norbert (eds.) Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management October 31 - November 5, 2005, Bremen, Germany. pp. 728-735. Available online
» 2003 «
Christophides, Vassilis, Plexousakis, Dimitris, Scholl, Michel and Tourtounis, Sotirios (2003): On labeling schemes for the semantic web. In: Proceedings of the 2003 International Conference on the World Wide Web 2003. pp. 544-555. Available online
“This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We advocate for the use of labeling schemes for modeling these hierarchies in order to efficiently answer queries such as subsumption check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. We first give a qualitative comparison of three main families of schemes, namely bit vector, prefix and interval based schemes. We then show that two labeling schemes are good candidates for an efficient implementation of label querying using standard relational DBMS, namely, the Dewey Prefix scheme [6] and an Interval scheme by Agrawal, Borgida and Jagadish [1]. We compare their storage and query evaluation performance for the 16 ODP hierarchies using the PostgreSQL engine.”
Copyrights may apply
» 2002 «
Karvounarakis, Gregory, Alexaki, Sofia, Christophides, Vassilis, Plexousakis, Dimitris and Scholl, Michel (2002): RQL: a declarative query language for RDF. In: Proceedings of the 2002 International Conference on the World Wide Web 2002. pp. 592-603. Available online
“Real-scale Semantic Web applications, such as Knowledge Portals and E-Marketplaces, require the management of large volumes of metadata, i.e., information describing the available Web content and services. Better knowledge about their meaning, usage, accessibility or quality will considerably facilitate an automated processing of Web resources. The Resource Description Framework (RDF) enables the creation and exchange of metadata as normal Web data. Although voluminous RDF descriptions are already appearing, sufficiently expressive declarative languages for querying both RDF descriptions and schemas are still missing. In this paper, we propose a new RDF query language called RQL. It is a typed functional language (a la OQL) and relies on a formal model for directed labeled graphs permitting the interpretation of superimposed resource descriptions by means of one or more RDF schemas. RQL adapts the functionality of semistructured/XML query languages to the peculiarities of RDF but, foremost, it enables to uniformly query both resource descriptions and schemas. We illustrate the RQL syntax, semantics and typing system by means of a set of example queries and report on the performance of our persistent RDF Store employed by the RQL interpreter.”
Copyrights may apply
» 1995 «
Amann, Bernd, Scholl, Michel and Rizk, Antoine (1995): Schema-Based Authoring and Querying of Large Hypertexts. In International Journal of Human-Computer Studies, 43 (3) pp. 281-299
“Modern hypertext applications require new system support for hypertext authoring and user navigation through large sets of documents connected by links. This system support must be based on advanced, typed data models for describing the information structure in different application domains. Schema based structuring through strongly typed documents and links has already been proposed and put to practical use in a multitude of hypertext applications. Systems such as Multicard/0{sub:2} and MORE have moreover exploited conceptual schemas for querying the resulting hyperdocuments in a more structured way. In this paper, we show how hypertext schemas and query languages can be utilized for designing hypertext authoring and browsing environments for large hypertexts. We illustrate our mechanisms using the Gram data model and describe their implementation on top of the Multicard hypermedia system connected to the O{sub:2} object-oriented database management system.”
Copyrights may apply
» 1994 «
Amann, Bernd, Scholl, Michel and Rizk, Antoine (1994): Querying Typed Hypertexts in Multicard/O2. In: Proceedings of ECHT 94 the ACM European Conference on Hypermedia Technology Sept 18-23, 1994, Edinburgh, UK. pp. 198-205. Available online
“Due to the growing complexity of modern hypertext applications, current hypertext systems require new mechanisms to support authoring and user navigation through large sets of documents connected by links. A general solution is to extend hypertext systems to cater for semantics of application domains. This requires new hypertext models providing strongly typed documents and links. Such models have been proposed and put to use in systems such as HDM and MacWeb to facilitate authoring of large hypertexts. In addition, Gram and MORE use typing and graph-based hypertext schemas for querying hyperdocuments. In this paper, we will show how query languages could be further exploited for designing sophisticated general query-based navigation mechanisms. We illustrate our examples using the Gram model and describe an implementation with the hypermedia system Multicard connected to the object-oriented database management system O2.”
Copyrights may apply
» 1992 «
Amann, Bernd and Scholl, Michel (1992): Gram: A Graph Data Model and Query Language. In: Lucarella, D., Nanard, Jocelyne, Nanard, Marc and Paolini, P. (eds.) Proceedings of ECHT 92 the Fourth ACM Conference on Hypertext November 30 - December 04, 1992, Milano, Italy. pp. 201-211. Available online
“We present a model for data organized as graphs. Regular expressions over the types of the node and edges are used to qualify connected sub-graphs. An algebraic language based on these regular expressions and supporting a restricted form of recursion is introduced. A natural application of this model and its query language is hypertext querying.”
Copyrights may apply
Amann, Bernd and Scholl, Michel (1992): Application of a Graph Model to Hypertext Querying. In: East-West International Conference on Human-Computer Interaction: Proceedings of the EWHCI92 1992. pp. 138-148.
“We present a model for data organized as graphs with typed nodes and edges. Regular expressions over the types of the node and edge labels are used to select walks in the hypertext graph. An outline of the application of this model and its query language to the implementation of hypertext documents is given by using an extended example of a travel agency application.”
Copyrights may apply
SHOW THIS LIST ON YOUR HOMEPAGE
What do YOU think?
Give us your opinion! Do you have any comments/additions
that you would like other visitors to see?
You say:
Mar 21st, 2010
Changes to this page (author)
18 Feb 2010: Enabled abstracts to be shown on Michel Scholl's author page.09 Jul 2009: Author was edited 09 Jul 2009: Author was edited
29 May 2009: Author was edited
25 Jul 2007: Author was edited
28 Apr 2003: Added the author to the bibliography
