Spatial Skyline Queries: An Efficient Geometric Algorithm (2009)
Son, Wanbin, Lee, Mu-Woong, Ahn, Hee-Kap, Hwang, Seung-won
As more data-intensive applications emerge, advanced retrieval semantics, such as ranking or skylines, have attracted attention. Geographic information systems are such an application with massive...
This paper studies optimizing top-k queries in middlewares. While many assorted algorithms have been proposed, none is generally applicable to a wide range of possible scenarios. Existing algorithms...
A Uncertainty Perspective on Qualitative Preference (2009)
Hwang, Seung-won, Lee, Mu-Woong
Collaborative filtering has been successfully applied for predicting a person's preference on an item, by aggregating community preference on the item. Typically, collaborative filtering systems are...
Recommendation: A Less Explored Killer-App of Uncertainty? (2009)
Hwang, Seung-won, Roh, Jong-won
Due to the unprecedented amount of information available, it is becoming more and more important to provide personalized recommendations on data, based on past user feedbacks. However, available user...
08421 Working Group: Explanation (2009)
Aras, Hidir, Fuhr, Norbert, Hwang, Seung-won, De Keijzer, Ander, Klan, Friederike, Lenz, Hans-Joachim, ...
This working group addressed the issue of explaining the results of an uncertainty information system to a user. For that, we structured the problem along three major queries: why, what, and how.
자신 이 NBA Denver Nuggets 의 농 구 Coach라 고 가정해보자. 이 번 신 인 Draft에 도 정 (2008)
Advisor Prof, Seung-won Hwang, Coordinator Prof, Seungmoon Choi
려 볼 만 할 것이다. 이렇 듯 어 떤 수많 은 data 들 가운데 서 interesting points 를 찾아내
Abstract—This paper addresses the problem of evaluating ranked top-k queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries, we...
Optimizing top-k queries for middleware access: A unified cost-based approach (2008)
This article studies optimizing top-k queries in middlewares. While many assorted algorithms have been proposed, none is generally applicable to a wide range of possible scenarios. Existing...
Boolean + ranking: Querying a database by k-constrained optimization (2006)
Zhen Zhang, Seung-won Hwang, Min Wang, Christian A. Lang, Yuan-chi Chang
The wide spread of databases for managing structured data, compounded with the expanded reach of the Internet, has brought forward interesting data retrieval and analysis scenarios to RDBMS. In such...
Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Cost-Based Approach (2005)
We study the problem of supporting ranked queries in middleware environments, where queries are evaluated over multiple sources. In particular, we study Web middleware scenarios, querying over...
Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Cost-Based Approach (2005)
We study the problem of supporting ranked queries in middleware environments, where queries are evaluated over multiple sources. In particular, we study Web middleware scenarios, querying over...
Rankfp: A framework for supporting rank formulation and processing (2005)
Data retrieval – finding relevant data from large databases – has become a serious problem. Consider user Amy, who is looking for a house in Chicago. She searches realtor.com with a few...
Automatic categorization of query results (2004)
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won Hwang
Exploratory ad-hoc queries could return too many answers – a phenomenon commonly referred to as “information overload”. In this paper, we propose to automatically categorize the results of SQL...
Sihem Amer-yahia, Luis Gravano, Sergey Brin, Taher Haveliwala, Jayavel Shanmugasundaram, Maha Abdallah, ...
Minimal probing: Supporting expensive predicates for top-k queries (2002)
This paper addresses the problem of evaluating ranked top- ¢ queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries, we believe such...