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

Sko Sakai

dblp:82/1515 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1986
—ORCID · none

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

Databases, data management, data science and information retrieval · 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
Database theory · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Database theory
deductive database
0.011986
Deductive Database System based on Unit Resolution · ICDE 1986
Automated reasoning and model checking › resolution-based reasoning
unit resolution
0.011986
Deductive Database System based on Unit Resolution · ICDE 1986

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

relational operations · 0.0least fixed point · 0.0
YearPublicationVenuePosition
1986 Deductive Database System based on Unit Resolution
abstract
This paper presents a methodology for constructing a deductive database system consisting of an intensional processor and a relational database management system. A setting evaluation approach is introduced. The intensional processor derives a setting from the in-tensional database and a given goal and sends the setting and the relationship between setting elements to the management system. The management system performs a unit resolution with setting using relational operations for the extensional databases. An extended least fixed point operation is introduced to terminate all types of recursive queries.
Haruo Yokota, Sko Sakai, Hidenori Itoh
ICDE2