Abstract
Preference queries have received considerable attention in the recent past, due to their use in selecting the most preferred objects, especially when the selection criteria are contradictory. Nowadays, a significant number of applications require the manipulation of time evolving data and therefore the study of continuous query processing has recently attracted the interest of the data management community. The goal of continuous query processing is to continuously evaluate long-running queries by using incremental algorithms and thus to avoid query evaluation from scratch, if possible. In this paper, we examine the characteristics of important preference queries, such as skyline, top-k and top-k dominating and we review algorithms proposed for the evaluation of continuous preference queries under the sliding window streaming model.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aggarwal, C.C.: Data Streams: Models and Algorithms. Springer, Heidelberg (2007)
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and Issues in Data Stream Systems. In: Proc. of PODS, pp. 1–16 (2002)
Bruno, N., Chaudhuri, S., Gravano, L.: Top-k Selection Queries over Relational Databases: Mapping Strategies and Performance Evaluation. ACM TODS 27(2), 153–187 (2002)
Balke, W.-T., Guntzer, U., Zheng, J.X.: Efficient Distributed Skylining for Web Information Systems. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004)
Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Proc. of ICDE, pp. 421–430 (2001)
Babcock, B., Olston, C.: Distributed Top-k Monitoring. In: Proc. of SIGMOD, pp. 28–39 (2003)
Chang, Y.-C., Bergman, L.D., Castelli, V., Li, C.-S., Lo, M.-L., Smith, J.R.: The Onion Technique: Indexing for Linear Optimization Queries. In: Proc. of SIGMOD, pp. 391–402 (2000)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with Presorting. In: Proc. of ICDE, pp. 717–719 (2003)
Chaudhuri, S., Gravano, L., Marian, A.: Optimizing Top-k Selection Queries over Multimedia Repositories. IEEE TKDE 16(8), 992–1009 (2004)
Chang, K.C.-C., Won Hwang, S.: Minimal Probing: Supporting Expensive Predicates for Top-k Queries. In: Proc. of SIGMOD, pp. 346–357 (2002)
Chan, C.Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: Finding k-Dominant Skylines in High Dimensional Space. In: Proc. of SIGMOD, pp. 503–514 (2006)
Chaudhry, N., Shaw, K., Abdelguerfi, M.: Stream Data Management. Springer, Heidelberg (2006)
Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering Top-k Queries Using Views. In: Proc. of VLDB, pp. 451–462 (2006)
Gehrke, J., Korn, F., Srivastava, D.: On Computing Correlated Aggregates over Continual Data Stream. ACM SIGMOD Record 30(2), 13–24 (2001)
Huang, Z., Jensen, C.S., Lu, H., Ooi, B.C.: Skyline Queries against Mobile Lightweight Devices in MANETs. In: Proc. of ICDE, p. 66 (2006)
Hristidis, V., Papakonstantinou, Y.: Algorithms and Applications for Answering Ranked Queries Using Ranked Views. VLDB Journal 13(1), 49–70 (2004)
Hua, M., Pei, J.: Continuously Monitoring Top-k Uncertain Data Streams: a Probabilistic Threshold Method. Distrib. Parallel Databases 26, 29–65 (2009)
Ilyas, I.F., Beskales, G., Soliman, M.A.: A Survey of Top-k Query Processing Techniques in Relational Database Systems. ACM Comput. Surv. 40(4) (2008)
Jin, C., Yi, K., Chen, L., Yu, J.X., Lin, X.: Sliding Window Top-k Queries on Uncertain Streams. In: Proc. of PVLDB, pp. 301–312 (2008)
Kung, H.T.: On Finding the Maxima of a Set of Vectors. Journal of the ACM 22(4), 469–476 (1975)
Kontaki, M., Papadopoulos, A.N., Manolopoulos, Y.: Continuous k-Dominant Skyline Computation on Multidimensional Data Streams. In: Proc. of SAC, pp. 16–20 (2008)
Kontaki, M., Papadopoulos, A.N., Manolopoulos, Y.: Continuous Top-k Dominating Queries in Subspaces. In: Proc. of PCI (2008)
Kontaki, M., Papadopoulos, A.N., Manolopoulos, Y.: Continuous Top-k Dominating Queries. Technical Report, Aristotle University of Thessaloniki (2009)
Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: an Online Algorithm for Skyline Queries. In: Proc. of VLDB, pp. 275–286 (2002)
Koudas, N., Srivastava, D.: Data Stream Query Processing: a Tutorial. In: Proc. of VLDB, p. 1149 (2003)
Lian, X., Chen, L.: Top-k Dominating Queries in Uncertain Databases. In: Proc. of EDBT, pp. 660–671 (2009)
Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: DADA: a Data Cube for Dominant Relationship Analysis. In: Proc. of SIGMOD, pp. 659–670 (2006)
Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. In: Proc. of ICDE, pp. 502–513 (2005)
Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting Stars: the k Most Representative Skyline Operator. In: Proc. of ICDE, pp. 86–95 (2007)
Lu, Y., Zhao, J., Chen, L., Cui, B., Yang, D.: Effective Skyline Cardinality Estimation on Data Streams. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 241–254. Springer, Heidelberg (2008)
Marian, A., Bruno, N., Gravano, L.: Evaluating Top-k Queries over Web-Accessible Databases. ACM TODS 29(2), 319–362 (2004)
Mouratidis, K., Bakiras, S., Papadias, D.: Continuous Monitoring of Top-k Queries over Sliding Windows. In: Proc. of SIGMOD, pp. 635–646 (2006)
Morse, M.D., Patel, J.M., Grosky, W.I.: Efficient Continuous Skyline Computation. In: Proc. of ICDE, p. 108 (2006)
Osborne, M.J., Rubenstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic Skylines on Uncertain Data. In: Proc. of VLDB, pp. 15–26 (2007)
Papadopoulos, A.N., Lyritsis, A., Nanopoulos, A., Manolopoulos, Y.: Domination mining and querying. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 145–156. Springer, Heidelberg (2007)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An Optimal and Progressive Algorithm for Skyline Queries. In: Proc. of SIGMOD, pp. 467–478 (2003)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive Skyline Computation in Database Systems. ACM TODS 30(1), 41–82 (2005)
Sharifzadeh, M., Shahabi, C.: The Spatial Skyline Queries. In: Proc. of VLDB, pp. 751–762 (2006)
Skoutas, D., Sacharidis, D., Simitsis, A., Kantere, V., Sellis, T.: Top-k Dominant Web Services Under Multi-Criteria Matching. In: Proc. of EDBT, pp. 898–909 (2009)
Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient Progressive Skyline Computation. In: Proc. of VLDB, pp. 301–310 (2001)
Tao, Y., Papadias, D.: Maintaining Sliding Window Skylines on Data Streams. IEEE TKDE 18(3), 377–391 (2006)
Wang, S., Ooi, B.C., Tung, A.K.H., Xu, L.: Efficient Skyline Query Processing on Peer-to-Peer Networks. In: Proc. of ICDE, pp. 1126–1135 (2007)
Xia, T., Zhang, D.: Refreshing the Sky: The Compressed Skycube with Efficient Support for Frequent Updates. In: Proc. of SIGMOD, pp. 491–502 (2006)
Yiu, M.L., Mamoulis, N.: Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data. In: Proc. of VLDB, pp. 483–494 (2007)
Yiu, M.L., Mamoulis, N.: Multidimensional Top-k Dominating Queries. VLDB Journal 18(3), 695–718 (2009)
Zhang, Z., Cheng, R., Papadias, D., Tung, A.K.H.: Minimizing the Communication Cost for Continuous Skyline Maintenance. In: Proc. of SIGMOD, pp. 495–508 (2009)
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
Kontaki, M., Papadopoulos, A.N., Manolopoulos, Y. (2010). Continuous Processing of Preference Queries in Data Streams. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)