Probabilistic ranked queries in uncertain databases

Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2008, Pages 511-522

  Lian, Xiang ^a   Chen, Lei ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION MANAGEMENT; MOBILE DEVICES; UNCERTAIN SYSTEMS;

PROBABILISTIC RANKED QUERIES; UNCERTAIN DATABASES;

QUERY PROCESSING;

EID: 43349083065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353343.1353406     Document Type: Conference Paper

References (43)

1. R. Akbarinia, E. Pacitti, and P. Valduriez. Best position algorithms for top-k queries. In VLDB, pages 495-506, 2007.
2. L. Antova, C. Koch, and D. Olteanu. Query language support for incomplete information in the MayBMS system. In VLDB, pages 1422-1425, 2007.
3. B. Arai, G. Das, D. Gunopulos, and N. Koudas. Anytime measures for top-k algorithms. In VLDB, pages 914-925, 2007.
4. C. Böhm, A. Pryakhin, and M. Schubert. The Gauss-tree: efficient object identification in databases of probabilistic feature vectors. In ICDE, page 9, 2006.
5. N. Bruno, S. Chaudhuri, and L. Gravano. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. TODS, 2002.
6. K. C.-C. Chang and S.-W. Hwang. Minimal, probing: supporting expensive predicates for top-k queries. In SIGMOD, pages 346-357, 2002.
7. Y.-C. Chang, L. D. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith. The Onion technique: indexing for linear optimization queries. In SIGMOD, pages 391-402, 2000.
8. L. Chen, M. T. Özsu, and V. Oria. Robust and fast similarity search for moving object trajectories. In SIGMOD, pages 491-502, 2005.
9. R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. In TKDE, volume 16, pages 1112-1127, 2004.
10. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, pages 551-562, 2003.
11. R. Cheng, S. Singh, and S. Prabhakar. U-DBM.S: A database system for managing constantly-evolving data. In VLDB, pages 1271-1274, 2005.
12. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. Vitter. Efficient indexing methods for probabilistic threshold queries over uncertain data. In VLDB, pages 876-887, 2004.
13. G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In VLDB, 2006.
14. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102-113, 2001.
15. A. Faradjian, J. Gehrke, and P. Bonnet. Gadt: A probability space ADT for representing and querying the physical world. In ICDE, pages 201-211, 2002.
16. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
17. V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD, 2001.
18. V. Hristidis and Y. Papakonstantinou. Algorithms and applications for answering ranked queries using ranked views. VLDBJ, 13(1):49-70, 2004.
19. M. Hua, J. Pei, A. W.-C. Fu, X. Lin, and H.-F. Leung. Efficiently answering top-k typicality queries on large databases. In VLDB, pages 890-901, 2007.
20. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDBJ, 13(3):207-221, 2004.
21. H.-P. Kriegel, P. Kunath, M. Pfeifle, and M. Renz. Probabilistic similarity join on uncertain data. In DASFAA, 2006.
22. H.-P. Kriegel, P. Kunath, and M. Renz. Probabilistic nearest-neighbor query on uncertain objects. In DASFAA, 2007.
23. C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song. RankSQL: Query algebra and optimization for relational top-k queries. In SIGMOD, pages 131-142, 2005.
24. C. Li, M. Wang, L. Lim, H. Wang, and K. C.-C. Chang. Supporting ranking and clustering as generalized order-by and group-by. In SIGMOD, pages 127-138, 2007.
25. V. Ljosa and A. K. Singh. APLA: indexing arbitrary probability distributions. In ICDE, pages 247-258, 2007.
26. Y. Luo, X. Lin, W Wang, and X. Zhou. Spark: Top-k keyword query in relational databases. In SIGMOD, pages 115-126, 2007.
27. A. Marian, N. Bruno, and L. Gravano. Evaluating top-k queries over web-accessible databases. TODS, 29(2):319-362, 2004.
28. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, 2007.
29. C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
30. R. Ross, V. S. Subrahmanian, and J. Grant. Aggregate operators in probabilistic databases. J. ACM, 52(1):54-101, 2005.
31. A. D. Sarma, O. B., A. Y. Halevy, and J. Widom. Working models for uncertain data. In ICDE, page 7, 2006.
32. M. A. Soliman, I. F. Ilyas, and K. C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
33. 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 VLDB, pages 922-933, 2005.
34. Y. Tao, V. Hristidis, D. Papadias, and Y. Papakonstantinou. Branch-and-bound processing of ranked queries. Inf. Syst., 32(3):424-445, 2007.
35. Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In VLDB, pages 744-755, 2004.
36. Y. Tao, D. Papadias, X. Lian, and X. Xiao. Multidimensional reverse kNN search. In VLDBJ, 2005.
37. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. In VLDB, pages 648-659, 2004.
38. Y. Theodoridis and T. Sellis. A model for the prediction of R-tree performance. In PODS, pages 161-171, 1996.
39. D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In VLDB, 2006.
40. D. Xin, J. Han, and K. C.-C. Chang. Progressive and selective merge: computing top-k with ad-hoc ranking functions. In SIGMOD, pages 103-114, 2007.
41. K. Yi, F. Li, D. Srivastava, and G. Kollios. Efficient, processing of top-k queries in uncertain databases. In ICDE, pages 385-394, 2000.
42. M. L. Yiu, X. Dai, N. Mamoulis, and M.. Vaitis. Topkc spatial preference queries. In ICDE, pages 1076-1085, 2007.
43. M. L. Yiu and N. Mamoulis. Efficient processing of top-k dominating queries on multi-dimensional data. In VLDB, pages 483-494, 2007.