Xiang Lian
Lei Chen
ABSTRACT
Reverse skyline queries over uncertain databases have many important applications such as sensor data monitoring and business planning. Due to the existence of uncertainty in many real-world data, answering reverse skyline queries accurately and efficiently over uncertain data has become increasingly important. In this paper, we model the probabilistic reverse skyline query on uncertain data, in both monochromatic and bichromatic cases, and propose effective pruning methods to reduce the search space of query processing. Moreover, efficient query procedures have been presented seamlessly integrating the proposed pruning methods. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approach with various experimental settings.
- C. Böhm, A. Pryakhin, and M. Schubert. The Gauss-tree: efficient object identification in databases of probabilistic feature vectors. In Proc. 22nd Int. Conf. on Data Engineering, page 9, 2006. Google Scholar
Digital Library
- S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In Proc. 17th Int. Conf. on Data Engineering, pages 421--430, 2001. Google ScholarDigital Library
- J. Chen and R. Cheng. Efficient evaluation of imprecise location-dependent queries. In Proc. 23rd Int. Conf. on Data Engineering, pages 586--595, 2007.Google ScholarCross Ref
- L. Chen, M. T. Özsu, and V. Oria. Robust and fast similarity search for moving object trajectories. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 491--502, 2005. Google ScholarDigital Library
- R. Cheng and J. Chen. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In Proc. 24th Int. Conf. on Data Engineering, 2008. Google ScholarDigital Library
- R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. In IEEE Trans. Knowledge and Data Eng., volume 16, pages 1112--1127, 2004. Google ScholarDigital Library
- R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 551--562, 2003. Google ScholarDigital Library
- R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. Vitter. Efficient indexing methods for probabilistic threshold queries over uncertain data. In Proc. 30th Int. Conf. on Very Large Data Bases, pages 876--887, 2004. Google ScholarDigital Library
- E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In Proc. 33rd Int. Conf. on Very Large Data Bases, pages 291--302, 2007. Google ScholarDigital Library
- K. Deng, X. Zhou, and H. T. Shen. Multi-source skyline query processing in road networks. In Proc. 23rd Int. Conf. on Data Engineering, pages 796--805, 2007.Google ScholarCross Ref
- A. Faradjian, J. Gehrke, and P. Bonnet. Gadt: A probability space ADT for representing and querying the physical world. In Proc. 18th Int. Conf. on Data Engineering, pages 201--211, 2002. Google ScholarDigital Library
- A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47--57, 1984. Google ScholarDigital Library
- J. M. Kang, M. F. Mokbel, S. Shekhar, T. Xia, and D. Zhang. Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In Proc. 23rd Int. Conf. on Data Engineering, pages 806--815, 2007.Google ScholarCross Ref
- C. Koch, D. Olteanu, L. Antova, and T. Jansen. Fast and simple relational processing of uncertain data. In Proc. 24th Int. Conf. on Data Engineering, 2008. Google ScholarDigital Library
- G. Kollios, K. Yi, F. Li, and D. Srivastava. Efficient processing of top-k queries in uncertain databases. In Proc. 24th Int. Conf. on Data Engineering, 2008. Google ScholarDigital Library
- H.-P. Kriegel, P. Kunath, M. Pfeifle, and M. Renz. Probabilistic similarity join on uncertain data. In Proc. 11th Int. Conf. on Database Systems for Advanced Applications, 2006. Google ScholarDigital Library
- H.-P. Kriegel, P. Kunath, and M. Renz. Probabilistic nearest-neighbor query on uncertain objects. In Proc. 12th Int. Conf. on Database Systems for Advanced Applications, 2007. Google ScholarDigital Library
- V. Ljosa and A. K. Singh. APLA: indexing arbitrary probability distributions. In Proc. 23rd Int. Conf. on Data Engineering, pages 247--258, 2007.Google ScholarCross Ref
- V. Ljosa and A. K. Singh. Top-k spatial joins of probabilistic objects. In Proc. 24th Int. Conf. on Data Engineering, 2008. Google ScholarDigital Library
- D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm for skyline queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 467--478, 2003. Google ScholarDigital Library
- J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In Proc. 33rd Int. Conf. on Very Large Data Bases, 2007. Google ScholarDigital Library
- S. Prabhakar, C. Mayfield, R. Cheng, S. Singh, R. Shah, J. Neville, and S. Hambrusch. Database support for pdf attributes. In Proc. 24th Int. Conf. on Data Engineering, 2008.Google Scholar
- C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In Proc. 23rd Int. Conf. on Data Engineering, 2007.Google ScholarCross Ref
- A. D. Sarma, O. B., A. Y. Halevy, and J. Widom. Working models for uncertain data. In Proc. 22nd Int. Conf. on Data Engineering, page 7, 2006. Google ScholarDigital Library
- S. Singh, C. Mayfield, R. Shah, S. Prabhakar, S. Hambrusch, J. Neville, and R. Cheng. Database support for pdf attributes. In Proc. 24th Int. Conf. on Data Engineering, 2008.Google Scholar
- M. A. Soliman, I. F. Ilyas, and K. C. Chang. Top-k query processing in uncertain databases. In Proc. 23rd Int. Conf. on Data Engineering, 2007.Google ScholarCross Ref
- I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi. Discovery of influence sets in frequently updated databases. In Proc. 27th Int. Conf. on Very Large Data Bases, pages 99--108, 2001. Google ScholarDigital Library
- Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. K., and S. Prabhakar. Indexing multi-dimensional uncertain data with arbitrary probability density functions. In Proc. 31st Int. Conf. on Very Large Data Bases, pages 922--933, 2005. Google ScholarDigital Library
- Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. 30th Int. Conf. on Very Large Data Bases, pages 744--755, 2004. Google ScholarDigital Library
- Y. Tao, D. Papadias, X. Lian, and X. Xiao. Multidimensional reverse kNN search. In The VLDB Journal, 2005. Google ScholarDigital Library
- Y. Theodoridis and T. Sellis. A model for the prediction of R-tree performance. In Proc. 15th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pages 161--171, 1996. Google ScholarDigital Library
- P. S. Yu and C. Aggarwal. On high dimensional indexing of uncertain data. In Proc. 24th Int. Conf. on Data Engineering, 2008. Google ScholarDigital Library
Index Terms
- Monochromatic and bichromatic reverse skyline search over uncertain databases
Recommendations
Reverse skyline search in uncertain databases
Reverse skyline queries over uncertain databases have many important applications such as sensor data monitoring and business planning. Due to the wide existence of uncertainty in many real-world data, answering reverse skyline queries accurately and ...
Efficient processing of probabilistic group subspace skyline queries in uncertain databases
Due to the pervasive data uncertainty in many real applications, efficient and effective query answering on uncertain data has recently gained much attention from the database community. In this paper, we propose a novel and important query in the ...
Computing Exact Skyline Probabilities for Uncertain Databases
With the rapid increase in the amount of uncertain data available, probabilistic skyline computation on uncertain databases has become an important research topic. Previous work on probabilistic skyline computation, however, only identifies those ...
Comments