skip to main content
10.1145/3429523.3429533acmotherconferencesArticle/Chapter ViewAbstractPublication PagescciotConference Proceedingsconference-collections
research-article

Balanced Dominating Top-k Queries over Uncertain Data

Authors Info & Claims
Published:09 November 2020Publication History

ABSTRACT

Uncertainty of data is inherent in many important applications. Effectively extracting valuable information to enable better decisions is important but not a trivial task over uncertain data. We have witnessed a great deal of significant researches for this purpose, such as top-k queries, skyline queries and dominated top-k queries. As for uncertainty, the common challenge that those researches face is to answer the ranking methods in consideration of user's function score and probability. In this paper, we propose a novel ranking method to select reliable and worthy results. In our method the coordinated and balanced degree of score and probability is also an evaluation target. After constructing of balance degree, we design the balanced dominating top-k query semantic and effective algorithms to identify the top-k answers. Comprehensive experiments with both real and synthetic data sets demonstrate the effectiveness and efficiency of our proposed approach.

References

  1. Chen M., Mao S., Liu Y.2014. Big Data: A survey. Mobile Networks and Applications. 19(2):171--209. DOI= https://doi.org/10.1016/j.jksuci.2017.06.001Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Philip C. C. L., Zhang C. Y.2014. Data-intensive applications, challenges, techniques and technologies: a survey on big data. Information Sciences. 275(11):314--347. DOI= https://doi.org/10.1016/j.ins.2014.01.015Google ScholarGoogle ScholarCross RefCross Ref
  3. Aggarwal C.C., Yu P.S.2008. A survey of uncertain data algorithms and applications. IEEE Transactions on Knowledge and Data Engineering, 21(5):609--623. DOI= https://doi.org/10.1109/TKDE.2008.190Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Pei J., Lin X.2007. Probabilistic skylines on uncertain Data. International Conference on Very Large Data Bases. VLDB Endowment: 15--26.Google ScholarGoogle Scholar
  5. Zhan L., Zhang Y., Zhang W., et al.2014. Identifying Top-k dominating objects over uncertain data. International Conference on Database Systems for Advanced Applications. Springer, Cham:388--405. DOI= https://doi.org/10.1007/978-3-319-05810-8_26Google ScholarGoogle Scholar
  6. Zhibang Y., Kenli L., Xu Z., Jing M., Yunjun G. 2018. Top-k probabilistic skyline queries on uncertain data. Neurocomputing. 317:1--14. DOI= https://doi.org/10.1016/j.neucom.2018.03.052Google ScholarGoogle ScholarCross RefCross Ref
  7. Miao X., Gao Y., Zheng B., et al.2016. Top-k dominating queries on Incomplete Data. IEEE Transactions on Knowledge and Data Engineering, 28(1):252--266. DOI= https://doi.org/10.1109/TKDE.2015.2460742Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Han X., Li J., Gao H.2017. Efficient Top-k dominating computation on massive data. IEEE Transactions on Knowledge and Data Engineering, 29(6):1199--1211. DOI= https://doi.org/10.1109/TKDE.2017.2665619Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ren W., Lian X., Ghazinour K.2017. Skyline queries over incomplete data streams. The VLDB Journal, 2019:1--25. DOI=https://doi.org/10.1007/s00778-019-00577-6Google ScholarGoogle Scholar
  10. Soliman M. A., Ilyas I. F., Chang C. C.2007. Top-k query processing in uncertain databases. IEEE International Conference on Data Engineering. 896--905. DOI= https://doi.org/10.1109/ICDE.2007.367935Google ScholarGoogle ScholarCross RefCross Ref
  11. Hua M., et al.2008. Ranking queries on uncertain data: A probabilistic threshold approach. International Conference on Management of Data, ACM: 673--686. https://doi.org/10.1145/1376616.1376685Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Li J., Barna S., Amol D.2011. A unified approach to ranking in probabilistic databases. The VLDB Journal. 20(2): 249--275. https://doi.org/10.14778/1687627.1687685Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Jestes J., Cormode G., Li F., Yi K.2011. Semantics of ranking queries for probabilistic data. IEEE Transactions on Knowledge and Data Engineering, 23(12): 1903--1917. https://doi.org/10.1109/TKDE.2010.192Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Trieu M. N. L., Jinli C., Zhen H.2013. Top-k best probability queries and semantics ranking properties on probabilistic databases. Data & Knowledge Engineering, 88: 248--266. https://doi.org/10.1016/j.datak.2013.04.005Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nguyen H. T. H., Jinli C.2015. Trustworthy answers for top-k queries on uncertain Big Data in decision making. Information Sciences, 318:73--90. https://doi.org/10.1016/j.ins.2014.08.065Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Abiteboul S., Kanellakis P., Grahne G.1991. On the representation and querying of sets of possible worlds. Theoretical Computer Science, 78(51): 159--187. https://doi.org/10.1016/0304-3975(51)90007-2Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Kossmann D., Stocker K.2001.The skyline operator. International Conference on Data Engineering. IEEE Computer Society:421--430.Google ScholarGoogle Scholar

Index Terms

  1. Balanced Dominating Top-k Queries over Uncertain Data

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        CCIOT '20: Proceedings of the 2020 5th International Conference on Cloud Computing and Internet of Things
        September 2020
        93 pages
        ISBN:9781450375276
        DOI:10.1145/3429523

        Copyright © 2020 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 9 November 2020

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader