Continuous k-Dominant Skyline Computation by Using Divide and Conquer Strategy
-
- Siddique Md. Anisuzzaman
- Graduate School of Engineering, Hiroshima University
-
- Morimoto Yasuhiko
- Graduate School of Engineering, Hiroshima University
Search this article
Abstract
Skyline objects in a database are objects that are not dominated by any other object in the database. Skyline queries retrieve a set of skyline objects so that the user can choose promising objects from them and make further inquiries. Therefore, such skyline queries are important for several database applications. However, a skyline query often retrieves too many objects to analyze intensively especially for high-dimensional dataset. Recently, k-dominant skyline queries have been introduced, which can reduce the number of retrieved objects by relaxing the definition of the dominance. On the other hand, the maintenance of k-dominant skyline objects under continuous updates is much more difficult compared to conventional skyline objects. This paper addresses the problem of efficient maintenance of k-dominant skyline objects of frequently updated database. We propose an algorithm based on divide and conquer strategy for maintaining k-dominant skyline objects. Intensive experiments using real and synthetic datasets demonstrated that our method is efficient and scalable.
Journal
-
- IPSJ Online Transactions
-
IPSJ Online Transactions 3 97-109, 2010
Information Processing Society of Japan
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390282680271670400
-
- NII Article ID
- 130000299711
-
- NII Book ID
- AN00116647
-
- ISSN
- 18827772
- 18826660
- 03875806
-
- NDL BIB ID
- 024298934
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed