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

Jürgen Frohn

dblp:29/997 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-author

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
2 papers
Data models and query languages · 50% Database theory · 38% Database system architecture and tuning · 12%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning
0.011997
FLORID: A Prototype for F-Logic · ICDE 1997
Database theory › deductive database
deductive object-oriented database
0.011997
FLORID: A Prototype for F-Logic · ICDE 1997
Data models and query languages › XML query languages
path expressions
0.011994
Access to Objects by Path Expressions and Rules · VLDB 1994
Data models and query languages › logic programming
rule-based query language
0.011994
Access to Objects by Path Expressions and Rules · VLDB 1994
YearPublicationVenuePosition
1997 FLORID: A Prototype for F-Logic
abstract
Summary form only given. FLORID-F-LOgic Reasoning In Databases-is a deductive object oriented database system incorporating F-logic (M. Kifer et al., 1995) as a data definition and query language and combining the advantages of deductive databases with the rich modelling capabilities of object oriented concepts. F-logic provides complex objects, uniform handling of data and metadata, rule defined class hierarchy and signatures, nonmonotonic multiple inheritance, equating of objects by rules and variables ranging over methods and classes. Moreover, FLORID extends F-logic by path expressions (J. Frohn et al., 1994) to facilitate object navigation. Because of its powerful properties, F-logic cannot be mapped onto a relational data model by transforming classes into relations. Hence, it was a major design goal to use an object oriented data representation in FLORID. All information about one object is stored in an object frame which has a unique OID. Several (external) object names may refer to the same OID, thus defining an equivalence relation between objects. Frames consist of slots for method applications or class membership, enabling schema modifications during the evaluation by deriving new signatures, subclass relationships or class memberships. The collection of all frames forms an object world.
Jürgen Frohn, Rainer Himmeröder, Paul-Thomas Kandzia, Georg Lausen, Christian Schlepphorst
ICDE1
1994 Access to Objects by Path Expressions and Rules
Jürgen Frohn, Georg Lausen, Heinz Uphoff
VLDB1