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

Christian Saaler

dblp:275/5181 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—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
Information retrieval · 77% Recommender systems · 23%

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

TopicWeightPapersLastEvidence papers
Information retrieval › query understanding
query clustering
0.412020
On the Usefulness of SQL-Query-Similarity Measures to Find User Interests · IEEE Trans. Knowl. Data Eng. 2020
Information retrieval
query log analysis
0.412020
On the Usefulness of SQL-Query-Similarity Measures to Find User Interests · IEEE Trans. Knowl. Data Eng. 2020
Information retrieval › query understanding › query analysis
query similarity
0.412020
On the Usefulness of SQL-Query-Similarity Measures to Find User Interests · IEEE Trans. Knowl. Data Eng. 2020
Recommender systems › user interest modeling
user interest mining
0.412020
On the Usefulness of SQL-Query-Similarity Measures to Find User Interests · IEEE Trans. Knowl. Data Eng. 2020
Information retrieval
query logs
0.112020
On the Usefulness of SQL-Query-Similarity Measures to Find User Interests · IEEE Trans. Knowl. Data Eng. 2020

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

similarity measure · 0.4clustering · 0.4
YearPublicationVenuePosition
2020 On the Usefulness of SQL-Query-Similarity Measures to Find User Interests
abstract
In the sciences and elsewhere, the use of relational databases has become ubiquitous. An important challenge is finding hot spots of user interests. In principle, one can discover user interests by clustering the queries in the query log. Such a clustering requires a notion of query similarity. This, in turn, raises the question of what features of SQL queries are meaningful. We have studied the query representations proposed in the literature and corresponding similarity functions and have identified shortcomings of all of them. To overcome these limitations, we propose new similarity functions for SQL queries. They rely on the so-called access area of a query and, more specifically, on the overlap and the closeness of the access areas. We have carried out experiments systematically to compare the various similarity functions described in this article. The first series of experiments measures the quality of clustering and compares it to a ground truth. In the second series, we focus on the query log from the well-known SkyServer database. Here, a domain expert has interpreted various clusters by hand. We conclude that clusters obtained with our new measures of similarity seem to be good indicators of user interests.
Natalia Arzamasova, Klemens Böhm, Bertrand Goldman, Christian Saaler, Martin Schäler
IEEE Trans. Knowl. Data Eng.4