Skip to main content
SpringerLink
Log in
Book cover

International Conference on Web Information Systems and Applications

WISA 2021: Web Information Systems and Applications pp 49–61Cite as

A Coreset Based Approach for Continuous k-regret Minimization Set Queries over Sliding Windows

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12999))

Abstract

Extracting a few tuples to represent the whole database is an important problem in real-world applications. In the literature, there are three representative tools: top-k, skyline and k-regret queries. Among these, the k-regret query has received much attention in recent decades for it does not require any preferences from users and the output size is controllable. However, almost all existing algorithms aim at the static databases while data streams are becoming more and more popular in many applications. In this paper, we propose continuous k-regret minimization set queries on data streams where tuples are valid in a sliding window. Further, we develop an algorithm to maintain a tiny coreset over sliding windows such that traditional static algorithms for k-regret queries can be applied on the coreset by sacrificing a little accuracy but improving the efficiency. We conduct experiments to show the effectiveness and efficiency of our proposed algorithm compared with existing ones.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    We use tuples and points interchangeably in the paper.

  2. 2.

    https://www.basketball-reference.com.

  3. 3.

    https://archive.ics.uci.edu/ml/datasets/corel+image+features.

  4. 4.

    https://www.cs.umd.edu/~mount/ANN.

References

  1. Agarwal, P.K., Har-Peled, S., Har-Peled, S., Yu, H., Yu, H.: Robust shape fitting via peeling and grating coresets. Discret. Comput. Geom. 39(1–3), 38–58 (2008)

    Article  MathSciNet  Google Scholar 

  2. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. JACM 51(4), 606–635 (2004)

    Article  MathSciNet  Google Scholar 

  3. Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: SEA, pp. 7:1–7:23 (2017)

    Google Scholar 

  4. Asudeh, A., Nazi, A., Zhang, N., Das, G.: Efficient computation of regret-ratio minimizing set: a compact maxima representative. In: SIGMOD, pp. 821–834 (2017)

    Google Scholar 

  5. Börzsöny, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421–430 (2001)

    Google Scholar 

  6. Cao, W., et al.: K-regret minimizing set: efficient algorithms and hardness. In: ICDT, pp. 11:1–19 (2017)

    Google Scholar 

  7. Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Computing k-regret minimizing sets. VLDB 7(5), 389–400 (2014)

    Google Scholar 

  8. Fan, Y., Shi, Y., Kang, K., Xing, Q.: An inflection point based clustering method for sequence data. In: Ni, W., Wang, X., Song, W., Li, Y. (eds.) WISA 2019. LNCS, vol. 11817, pp. 201–212. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30952-7_22

    Chapter  Google Scholar 

  9. Faulkner, T.K., Brackenbury, W., Lall, A.: K-regret queries with nonlinear utilities. VLDB 8(13), 2098–2109 (2015)

    Google Scholar 

  10. Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. (CSUR) 40(4), 11:1–58 (2008)

    Google Scholar 

  11. Kumar, N., Sintos, S.: Faster approximation algorithm for the k-regret minimizing set and related problems. In: ALENEX, pp. 62–74 (2018)

    Google Scholar 

  12. Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: SIGMOD, pp. 635–646 (2006)

    Google Scholar 

  13. Nanongkai, D., Lall, A., Das Sarma, A., Makino, K.: Interactive regret minimization. In: SIGMOD, pp. 109–120 (2012)

    Google Scholar 

  14. Nanongkai, D., Sarma, A.D., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. VLDB 3(1), 1114–1124 (2010)

    Google Scholar 

  15. Peng, P., Wong, R.C.: Geometry approach for k-regret query. In: ICDE, pp. 772–783 (2014)

    Google Scholar 

  16. Qi, J., Zuo, F., Samet, H., Yao, J.: K-regret queries using multiplicative utility functions. TODS 43(2), 1–41 (2018)

    Article  MathSciNet  Google Scholar 

  17. Soma, T., Yoshida, Y.: Regret ratio minimization in multi-objective submodular function maximization. AAAI, 905–911 (2017)

    Google Scholar 

  18. Tao, Y., Papadias, D.: Maintaining sliding window skylines on data streams. TKDE 18(2), 377–391 (2006)

    Google Scholar 

  19. Wang, Y., Li, Y., Wong, R.C., Tan, K.L.: A fully dynamic algorithm for k-regret minimizing sets. arXiv (2020)

    Google Scholar 

  20. Xie, M., Wong, R.C.W., Li, J., Long, C., Lall, A.: Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In: SIGMOD, pp. 959–974 (2018)

    Google Scholar 

  21. Zeighami, S., Wong, R.C.W.: Minimizing average regret ratio in database. In: SIGMOD, pp. 2265–2266 (2016)

    Google Scholar 

Download references

Acknowledgment

This work is partially supported by the National Natural Science Foundation of China under grant U1733112 and the Fundamental Research Funds for the Central Universities under grant NS2020068.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China

    Wei Ma, Jiping Zheng & Zhiyang Hao

  2. Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, China

    Jiping Zheng

Authors
  1. Wei Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiping Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhiyang Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiping Zheng .

Editor information

Editors and Affiliations

  1. Tsinghua University, Beijing, China

    Chunxiao Xing

  2. Institute of Computer Science, University of Göttingen, Goettingen, Germany

    Xiaoming Fu

  3. Tsinghua University, Beijing, China

    Yong Zhang

  4. Chinese Academy of Sciences, Beijing, China

    Guigang Zhang

  5. Renmin University of China, Beijing, China

    Chaolemen Borjigin

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ma, W., Zheng, J., Hao, Z. (2021). A Coreset Based Approach for Continuous k-regret Minimization Set Queries over Sliding Windows. In: Xing, C., Fu, X., Zhang, Y., Zhang, G., Borjigin, C. (eds) Web Information Systems and Applications. WISA 2021. Lecture Notes in Computer Science(), vol 12999. Springer, Cham. https://doi.org/10.1007/978-3-030-87571-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-87571-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-87570-1

  • Online ISBN: 978-3-030-87571-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation