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

Tomas Saulys

dblp:77/3889 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1992
—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
Data models and query languages · 30% Knowledge graphs · 30% Data mining · 30%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs
concept hierarchy
0.011992
Conceptual Learning in Database Design · ACM Trans. Inf. Syst. 1992
Data mining › clustering
conceptual clustering
0.011992
Conceptual Learning in Database Design · ACM Trans. Inf. Syst. 1992
Data models and query languages › schema management
schema transformation
0.011992
Conceptual Learning in Database Design · ACM Trans. Inf. Syst. 1992

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

UNIMEM · 0.0COBWEB · 0.0
YearPublicationVenuePosition
1992 Conceptual Learning in Database Design
abstract
This paper examines the idea of incorporating machine learning algorithms into a database system for monitoring its stream of incoming queries and generating hierarchies with the most important concepts expressed in those queries. The goal is for these hierarchies to provide valuable input to the database administrator for dynamically modifying the physical and external schemas of a database for improved system performance and user productivity. The criteria for choosing the appropriate learning algorithms are analyzed, and based on them, two such algorithms, UNIMEM and COBWEB, are selected as the most suitable ones for the task. Standard UNIMEM and COBWEB implementations have been modified to support queries as input. Based on the results of experiments with these modified implementations, the whole approach appears to be quite promising, expecially if the concept hierarchy from which the learning algorithms start their processing is initialized with some of the most obvious concepts captured in the database.
Yannis E. Ioannidis, Tomas Saulys, Andrew J. Whitsitt
ACM Trans. Inf. Syst.2