Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yves R. Jean-Mary

dblp:14/4478 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data models and query languages · 87% Query processing and optimization · 13%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages
query algebra
0.112009
semQA: SPARQL with Idempotent Disjunction · IEEE Trans. Knowl. Data Eng. 2009
Data models and query languages › RDF query language
SPARQL
0.112009
semQA: SPARQL with Idempotent Disjunction · IEEE Trans. Knowl. Data Eng. 2009
Query processing and optimization
query optimization
0.012009
semQA: SPARQL with Idempotent Disjunction · IEEE Trans. Knowl. Data Eng. 2009
Computational complexity
query complexity
0.012009
semQA: SPARQL with Idempotent Disjunction · IEEE Trans. Knowl. Data Eng. 2009

Methods — techniques the papers use, named apart from their topics

idempotent disjunction · 0.2algebraic transformations · 0.1algebraic transformation · 0.1
YearPublicationVenuePosition
2009 semQA: SPARQL with Idempotent Disjunction
abstract
The SPARQL LeftJoin abstract operator is not distributive over Union; this limits the algebraic manipulation of graph patterns, which in turn restricts the ability to create query plans for distributed processing or query optimization. In this paper, we present semQA, an algebraic extension for the SPARQL query language for RDF, which overcomes this issue by transforming graph patterns through the use of an idempotent disjunction operator Or as a substitute for Union. This permits the application of a set of equivalences that transform a query into distinct forms. We further present an algorithm to derive the solution set of the original query from the solution set of a query where Union has been substituted by Or. We also analyze the combined complexity of SPARQL, proving it to be NP-complete. It is also shown that the SPARQL query language is not, in the general case, fixed-parameter tractable. Experimental results are presented to validate the query evaluation methodology presented in this paper against the SPARQL standard to corroborate the complexity analysis and to illustrate the gains in processing cost reduction that can be obtained through the application of semQA.
E. Patrick Shironoshita, Yves R. Jean-Mary, Ray M. Bradley, Mansur R. Kabuka
IEEE Trans. Knowl. Data Eng.2
2009 Ontology matching with semantic verification
Yves R. Jean-Mary, E. Patrick Shironoshita, Mansur R. Kabuka
J. Web Semant.1
2008 Model Formulation: semCDI: A Query Formulation for Semantic Data Integration in caBIG
abstract
OBJECTIVES: To develop mechanisms to formulate queries over the semantic representation of cancer-related data services available through the cancer Biomedical Informatics Grid (caBIG). DESIGN: The semCDI query formulation uses a view of caBIG semantic concepts, metadata, and data as an ontology, and defines a methodology to specify queries using the SPARQL query language, extended with Horn rules. semCDI enables the joining of data that represent different concepts through associations modeled as object properties, and the merging of data representing the same concept in different sources through Common Data Elements (CDE) modeled as datatype properties, using Horn rules to specify additional semantics indicating conditions for merging data. Validation In order to validate this formulation, a prototype has been constructed, and two queries have been executed against currently available caBIG data services. DISCUSSION: The semCDI query formulation uses the rich semantic metadata available in caBIG to build queries and integrate data from multiple sources. Its promise will be further enhanced as more data services are registered in caBIG, and as more linkages can be achieved between the knowledge contained within caBIG's NCI Thesaurus and the data contained in the Data Services. CONCLUSION: semCDI provides a formulation for the creation of queries on the semantic representation of caBIG. This constitutes the foundation to build a semantic data integration system for more efficient and effective querying and exploratory searching of cancer-related data.
E. Patrick Shironoshita, Yves R. Jean-Mary, Ray M. Bradley, Mansur R. Kabuka
J. Am. Medical Informatics Assoc.2