Abstract
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 n C s sets in the database. We consider an efficient algorithm for computing convex skyline of the n C s 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Borzsonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of ICDE, pp. 421–430 (2001)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: Proceedings of VLDB Conference, pp. 275–286 (2002)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of ACM SIGMOD Conference, pp. 467–478 (2003)
Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient Progressive Skyline Computation. In: Proceedings of VLDB Conference, pp. 301–310 (2001)
Li, C., Ooi, B.C., Tung, A.-K.H., Wang, S.: DADA: A Data Cube for Dominant Relationship Analysis. In: Proceedings of ACM SIGMOD Conference, pp. 659–670 (2006)
Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In: Proceedings of VLDB Conference, pp. 253–264 (2005)
Morimoto, Y., Fukuda, T., Matsuzawa, H., Yoda, K., Tokuyama, T.: Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases. In: Proceedings of VLDB Conference, pp. 380–391 (1998)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining with optimized two-dimensional association rules. ACM Trans. on Database Systems 26(2), 179–213 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morimoto, Y., Siddique, M.A. (2010). Skyline Sets Query and Its Extension to Spatio-temporal Databases. In: Kikuchi, S., Sachdeva, S., Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2010. Lecture Notes in Computer Science, vol 5999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12038-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-12038-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12037-4
Online ISBN: 978-3-642-12038-1
eBook Packages: Computer ScienceComputer Science (R0)