Managing semistructured data with FLORID: A deductive object-oriented perspective

Ludäscher, Bertram; Himmeröder, Rainer; Lausen, Georg; May, Wolfgang; Schlepphorst, Christian

doi:10.1016/s0306-4379(98)00030-1

Cited by 99 publications

(43 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…TRIPLE's syntax is close to F-Logic [58]. F-Logic is convenient for querying semi-structured data, e.g., XML and RDF, as it facilitates describing schema-less or irregular data [64]. Other approaches to querying XML and/or RDF based on F-Logic are XPathLog [75] and the ontology management platform Ontobroker 13 .…”

Section: The Relational Query Languages Sparql Rql Triple and Xcerptmentioning

confidence: 99%

RDF Querying: Language Constructs and Evaluation Methods Compared

Furche¹,

Linse²,

Bry³

et al. 2006

Reasoning Web

View full text Add to dashboard Cite

Abstract. This article is firstly an introduction into query languages for the Semantic Web, secondly an in-depth comparison of the languages introduced. Only RDF query languages are considered because, as of the writing of this paper, query languages for other Semantic Web data modeling formalisms, especially OWL, are still an open research issue, and only a very small number of, furthermore incomplete, proposals for querying Semantic Web data modeled after other formalisms than RDF exist. The limitation to a few RDF query languages is motivated both by the objective of an in-depth comparison of the languages addressed and by space limitations. During the three years before the writing of this article, more than three dozen proposals for RDF query languages have been published! Not only such a large number, but also the often immature nature of the proposals makes the focus on few, but representative languages a necessary condition for a non-trivial comparison.For this article, the following RDF query languages have been, admittedly subjectively, selected: Firstly, the "relational" or "pattern-based" query languages SPARQL, RQL, TRIPLE, and Xcerpt; secondly the reactive rule query language Algae; thirdly and last the "navigational access" query language Versa. Although subjective, this choice is arguably a good coverage of the diverse language paradigms considered for querying RDF data. It is the authors' hope and expectation, that this comparison will motivate and trigger further similar studies, thus completing the present article and overcoming its limitation.

show abstract

Section: The Relational Query Languages Sparql Rql Triple and Xcerptmentioning

confidence: 99%

RDF Querying: Language Constructs and Evaluation Methods Compared

Furche¹,

Linse²,

Bry³

et al. 2006

Reasoning Web

View full text Add to dashboard Cite

show abstract

“…The basic operations of the KNOW-ME tool are graph queries expressed as generalized path expressions (GPE); see [3] for the details of the semantics: an edge with some label L or any is a GPE if M and N are GPEs then M.N, M|N, M*, M + , M ? , M k , M -1 are GPEs if ϕ is a relation symbol then if(ϕ) is a GPE.…”

Section: The Demonstration Systemmentioning

confidence: 99%

Navigating Virtual Information Sources with Know-ME

Qian

Ludäscher

Martone

et al. 2002

Advances in Database Technology — EDBT 2002

Self Cite

View full text Add to dashboard Cite

“…These correspondence rules are encoded in the deductive object-oriented database language, F-Logic [10]. This approach is well-suited to this task having been used for schema transformations [3] and information integration using semistructured data [7], as well as knowledge representation and reasoning with ontologies [5].…”

Section: Mediationmentioning

confidence: 99%