Skip to main content
Log in

StreamPref: a query language for temporal conditional preferences on data streams

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

Over recent years, several studies regarding preference queries over data streams have been developed in database and artificial intelligence research fields. Preference queries are useful in many decision making application areas, such as e-commerce, financial analysis, and content personalization. In this article, we explore new aspects of temporal conditional preference queries (tcp-queries) for the StreamPref query language. Tcp-queries allow the user to express how past instants of a data stream can influence the preference of a user at a present instant. In order to increase the utility of the StreamPref query language, we propose herein new operators that allow dealing with subsequences and filtering of sequences by length. To validate our proposal we present a detailed complexity analysis and an extensive set of experiments with synthetic and real datasets, which corroborate the efficiency of the algorithms and the utility of the new operators.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. Our prototype is available on http://streampref.github.io/.

  2. http://streampref.github.io/streamprefgen/

References

  • Arasu, A., Babu, S., Widom, J. (2006). The CQL continuous query language: semantic foundations and query execution. The VLDB Journal, 15(2), 121–142.

    Article  Google Scholar 

  • Arasu, A., Babcock, B., Babu, S., Cieslewicz, J., Datar, M., Ito, K., Motwani, R., Srivastava, U., Widom, J. (2016). STREAM: the Stanford data stream management system (pp. 317–336). Berlin: Springer.

    Google Scholar 

  • Börzsönyi, S., Kossmann, D., Stocker, K. (2001). The skyline operator. In ICDE (pp. 421–430). Heidelberg.

  • Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D. (1999). Reasoning with conditional ceteris paribus preference statements. In Conference on Uncertainty in Artificial Intelligence (UAI) (pp. 71–80). Stockholm.

  • Brafman, R.I., & Domshlak, C. (2002). Introducing variable importance tradeoffs into cp-nets. In Conference on Uncertainty in Artificial Intelligence (UAI) (pp. 69–76). Edmonton.

  • Brafman, R.I., Domshlak, C., Shimony, S.E. (2006). On graphical modeling of preference and importance. JAIR, 25, 389–424.

    Article  MathSciNet  Google Scholar 

  • Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z. (2006). Finding k-dominant skylines in high dimensional space. In ACM SIGMOD international conference on management of data (pp. 503–514). Chicago.

  • Chomicki, J. (2003). Preference formulas in relational queries. ACM TODS, 28 (4), 427–466.

    Article  MathSciNet  Google Scholar 

  • de Amo, S., & Bueno, M.L.P. (2011). Continuous processing of conditional preference queries. In SBBD. Florianópolis.

  • de Amo, S., & Giacometti, A. (2007). Temporal conditional preferences over sequences of objects. In ICTAI (pp. 246–253). Patras.

  • de Amo, S., & Ribeiro, M.R. (2009). CPref-SQL: a query language supporting conditional preferences. In ACM SAC (pp. 1573–1577). Honolulu.

  • Kießling, W. (2002). Foundations of preferences in database systems. In International conference on very large data bases (VLDB) (pp. 311–322). Hong Kong.

  • Kießling, W., & Köstler, G. (2002). Preference SQL: design, implementation, experiences. In VLDB (pp. 990–1001). Hong Kong.

  • Kontaki, M., Papadopoulos, A.N., Manolopoulos, Y. (2008). Continuous top-k dominating queries in subspaces. In Panhellenic conference on informatics (PCI) (pp. 31–35). Samos: IEEE.

  • Kontaki, M., Papadopoulos, A.N., Manolopoulos, Y. (2012). Continuous top-k dominating queries. IEEE Transactions on Knowledge and Data Engineering (TKDE), 24(5), 840–853.

    Article  Google Scholar 

  • Lee, Y.W., Lee, K.Y., Kim, M.H. (2013). Efficient processing of multiple continuous skyline queries over a data stream. Information Sciences, 221, 316–337.

    Article  Google Scholar 

  • Lin, X., Yuan, Y., Wang, W., Lu, H. (2005). Stabbing the sky: efficient skyline computation over sliding windows. In ICDE (pp. 502–513). Tokyo.

  • Pereira, F.S.F, & de Amo, S. (2010). Evaluation of conditional preference queries. JIDM, 1(3), 503–518.

    Google Scholar 

  • Petit, L., Labbé, C., Roncancio, C. (2010). An algebric window model for data stream management. In ACM MobiDE (pp. 17–24). Indianapolis.

  • Petit, L, de Amo, S., Roncancio, C., Labbé, C. (2012). Top-k context-aware queries on streams. In DEXA (pp. 397–411). Vienna.

  • Ribeiro, M.R., Pereira, F.S.F., Dias, V.V.S. (2016). Efficient algorithms for processing preference queries. In ACM SAC (pp. 972–979). Pisa.

  • Ribeiro, M.R., Barioni, M.C.N, de Amo, S., Roncancio, C., Labbé, C. (2017a). Reasoning with temporal preferences over data streams. In FLAIRS. Marco Island.

  • Ribeiro, M.R., Barioni, M.C.N, de Amo, S., Roncancio, C., Labbé, C. (2017b). Soccer2014ds: a dataset containing player events from the 2014 world cup. In Brazilian symposium on databases, dataset showcase workshop (pp. 278–285). Uberlandia.

  • Ribeiro, M.R., Barioni, M.C.N, de Amo, S., Roncancio, C., Labbé, C. (2017c). Temporal conditional preference queries on streams. In International conference on database and expert systems applications (DEXA). Lyon.

  • Santoso, B.J., & Chiu, G.M. (2014). Close dominance graph: an efficient framework for answering continuous top-dominating queries. IEEE Transactions on Knowledge and Data Engineering (TKDE), 26(8), 1853–1865.

    Article  Google Scholar 

  • Tao, Y., & Papadias, D. (2006). Maintaining sliding window skylines on data streams. IEEE TKDE, 18(3), 377–391.

    Google Scholar 

  • Wilson, N. (2004). Extending cp-nets with stronger conditional preference statements. In AAAI national conference (pp. 735–741). San Jose.

  • Wilson, N. (2011). Computational techniques for a simple theory of conditional preferences. Artificial Intelligence Journal, 175(7–8), 1053–1091.

    Article  MathSciNet  Google Scholar 

  • Yiu, M.L., & Mamoulis, N. (2007). Efficient processing of top-k dominating queries on multi-dimensional data. In International conference on very large data bases (VLDB) (pp. 483–494). Vienna.

  • Yiu, M.L., & Mamoulis, N. (2009). Multi-dimensional top-k dominating queries. The VLDB Journal, 18(3), 695–718.

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the Research Agencies CNPq, CAPES and FAPEMIG for supporting this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcos Roberto Ribeiro.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

figure h
figure i
figure j
figure k

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ribeiro, M.R., Barioni, M.C.N., de Amo, S. et al. StreamPref: a query language for temporal conditional preferences on data streams. J Intell Inf Syst 53, 329–360 (2019). https://doi.org/10.1007/s10844-019-00560-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-019-00560-1

Keywords

Navigation