Sunyou Lee

dblp:148/4473 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, 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
Query processing and optimization · 50% Indexing and storage engines · 50%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
top-k indexing
0.212014
Toward Scalable Indexing for Top-k Queries · IEEE Trans. Knowl. Data Eng. 2014
Query processing and optimization
top-k query processing
0.212014
Toward Scalable Indexing for Top-k Queries · IEEE Trans. Knowl. Data Eng. 2014

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

skyline · 0.2dual-resolution layer · 0.2convex skyline · 0.2
YearPublicationVenuePosition
2014 Map Translation Using Geo-tagged Social Media
abstract
This paper discusses the problem of map translation, of servicing spatial entities in multiple languages.Existing work on entity translation harvests translation evidence from text resources, not considering spatial locality in translation.In contrast, we mine geo-tagged sources for multilingual tags to improve recall, and consider spatial properties of tags for translation to improve precision.Our approach empirically improves accuracy from 0.562 to 0.746 using Taiwanese spatial entities.
Sunyou Lee, Taesung Lee, Seung-won Hwang
EACL1
2014 Toward Scalable Indexing for Top-k Queries
abstract
A top-k query retrieves the best k tuples by assigning scores for each tuple in a target relation with respect to a user-specific scoring function. This paper studies the problem of constructing an indexing structure for supporting top-k queries over varying scoring functions and retrieval sizes. The existing research efforts can be categorized into three approaches: list-, layer-, and view-based approaches. In this paper, we mainly focus on the layer-based approach that pre-materializes tuples into consecutive multiple layers. We first propose a dual-resolution layer that consists of coarse-level and fine-level layers. Specifically, we build coarse-level layers using skylines, and divide each coarse-level layer into fine-level sublayers using convex skylines. To make our proposed dual-resolution layer scalable, we then address the following optimization directions: 1) index construction; 2) disk-based storage scheme; 3) the design of the virtual layer; and 4) index maintenance for tuple updates. Our evaluation results show that our proposed method is more scalable than the state-of-the-art methods.
Jongwuk Lee, Hyunsouk Cho, Sunyou Lee, Seung-won Hwang
IEEE Trans. Knowl. Data Eng.3