Data Mining with optimized two-dimensional association rules
ACM Transactions on Database Systems (TODS)
Proceedings of the 17th International Conference on Data Engineering
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05 Proceedings of the 31st international conference on Very large data bases
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Top-k query processing for combinatorial objects using Euclidean distance
Proceedings of the 15th Symposium on International Database Engineering & Applications
| Hi-index | 0.00 |
Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper. Let s be the number of objects in each set and n be the number of objects in the database. There are nCs sets in the database. We consider an efficient algorithm for computing convex skyline of the nCs sets, which we call “convex skyline sets”. Recently, we have to aware individual’s privacy. Sometimes, we have to hide individual values and are only allowed to disclose aggregated values of objects. In such situation, we cannot use conventional skyline queries. The proposed function can be a promising alternative in decision making in a privacy aware environment. In addition, if we consider sets of objects, we can extend the idea of the skyline query to spatio-temporal databases. For example, we can retrieve sets that are not dominated by another set in respect of time-interval or spatial-area. In this paper, we propose temporal and spatial skyline sets query.