TY - GEN
T1 - Supporting personalized top-k skyline queries using partial compressed skycube
AU - Lee, Jongwuk
AU - You, Gae Won
AU - Sohn, Ik Chan
AU - Hwang, Seung Won
AU - Ko, Kwangil
AU - Lee, Zino
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - As near-infinite amount of data are becoming accessible on the Web, it is getting more and more important to support intelligent query mechanisms, to help each user to identify the ideal results of manageable size. As such mechanism, skyline queries have gained a lot of attention lately for its intuitive query formulation. This intuitiveness, however, has a side-effect of generating too many results, especially for high-dimensional data, to satisfy a wide range of user's needs. Our goal is to support personalized skyline queries as identifying "truly interesting" objects based on user-specific preference and retrieval size k. While this problem has been studied previously, the proposed solution identifies top-k results by navigating a "skycube", which incurs exponential storage overhead to data dimensionality and excessive one-time computational overhead for skycube construction. In contrast, we develop novel techniques to significantly reduce both storage and computation overhead. Our extensive evaluation results validate this framework on both real-life and synthetic data.
AB - As near-infinite amount of data are becoming accessible on the Web, it is getting more and more important to support intelligent query mechanisms, to help each user to identify the ideal results of manageable size. As such mechanism, skyline queries have gained a lot of attention lately for its intuitive query formulation. This intuitiveness, however, has a side-effect of generating too many results, especially for high-dimensional data, to satisfy a wide range of user's needs. Our goal is to support personalized skyline queries as identifying "truly interesting" objects based on user-specific preference and retrieval size k. While this problem has been studied previously, the proposed solution identifies top-k results by navigating a "skycube", which incurs exponential storage overhead to data dimensionality and excessive one-time computational overhead for skycube construction. In contrast, we develop novel techniques to significantly reduce both storage and computation overhead. Our extensive evaluation results validate this framework on both real-life and synthetic data.
UR - http://www.scopus.com/inward/record.url?scp=77951135674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951135674&partnerID=8YFLogxK
U2 - 10.1145/1316902.1316914
DO - 10.1145/1316902.1316914
M3 - Conference contribution
AN - SCOPUS:77951135674
SN - 9781595938299
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 65
EP - 72
BT - Proceedings of the 9th Annual ACM International Workshop on Web Information and Data Management, WIDM '07, Co-located with the 16th ACM Conference on Information and Knowledge Management, CIKM '07
T2 - 9th Annual ACM International Workshop on Web Information and Data Management, WIDM '07, Co-located with the 16th ACM Conference on Information and Knowledge Management, CIKM '07
Y2 - 6 November 2007 through 9 November 2007
ER -