Probabilistic inverse ranking queries over uncertain data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 35-50

  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 UNCERTAINTY; DIMENSIONAL SPACES; HIGH DIMENSIONAL SPACES; HIGH-DIMENSIONAL; PROBABILITY THRESHOLD; PRUNING METHODS; QUERY OBJECT; QUERY TYPES; RANKING QUERIES; REAL APPLICATIONS; REDUCTION TECHNIQUES; SEARCH SPACES; SYNTHETIC DATASETS; UNCERTAIN DATA; UNCERTAIN DATABASE; UNCERTAIN QUERY;

DATA HANDLING; QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 67650169214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_4     Document Type: Conference Paper

References (30)

1. Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730. Springer, Heidelberg (1993)
2. Benjelloun, O., Das Sarma, A., Halevy, A.Y.,Widom, J.: ULDBs: Databases with uncertainty and lineage. In: VLDB (2006)
3. B̈ohm, C., Pryakhin, A., Schubert, M.: The Gauss-tree: efficient object identification in databases of probabilistic feature vectors. In: ICDE (2006)
4. Chang, Y.-C., Bergman, L.D., Castelli, V., Li, C.-S., Lo, M.-L., Smith, J.R.: The Onion technique: indexing for linear optimization queries. In: SIGMOD (2000)
5. Cheng, R., Kalashnikov, D., Prabhakar, S.: Querying imprecise data in moving object environments. In: TKDE (2004)
6. Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Evaluating probabilistic queries over imprecise data. In: SIGMOD (2003)
7. Cheng, R., Singh, S., Prabhakar, S.: U-DBMS: A database system for managing constantlyevolving data. In: VLDB (2005)
8. Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: VLDB (2006)
9. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)
10. Faradjian, A., Gehrke, J., Bonnet, P.: GADT: A probability space ADT for representing and querying the physical world. In: ICDE (2002)
11. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD (1984)
12. Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: A system for the efficient execution of multi-parametric ranked queries. In: SIGMOD (2001)
13. Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: A probabilistic threshold approach. In: SIGMOD (2008)
14. Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDBJ (2004)
15. Ravi Kanth, K.V., Agrawal, D., Singh, A.: Dimensionality reduction for similarity searching in dynamic databases. In: SIGMOD (1998)
16. Kriegel, H.-P., Kunath, P., Pfeifle, M., Renz, M.: Probabilistic similarity join on uncertain data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 295-309. Springer, Heidelberg (2006) (Pubitemid 43978648)
17. Kriegel, H.-P., Kunath, P., Renz, M.: Probabilistic nearest-neighbor query on uncertain objects. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 337-348. Springer, Heidelberg (2007)
18. Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with amulti-resolution tree structure. In: SIGMOD (2001)
19. Li, C.: Enabling data retrieval: By ranking and beyond. Ph.D. Dissertation, University of Illinois at Urbana-Champaign (2007)
20. Li, C., Chang, K.C.-C., Ilyas, I.F., Song, S.: RankSQL: Query algebra and optimization for relational top-k queries. In: SIGMOD (2005)
21. Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: SIGMOD (2008)
22. Lin, X., Xu, J., Zhang, Q., Lu, H., Yu, J.X., Zhou, X., Yuan, Y.: Approximate processing of massive continuous quantile queries over high-speed data streams. In: TKDE (2006)
23. Mokbel, M.F., Chow, C.-Y., Aref, W.G.: The new casper: query processing for location services without compromising privacy. In: VLDB (2006)
24. Papadimitriou, S., Li, F., Kollios, G., Yu, P.S.: Time series compressibility and privacy. In: VLDB (2007)
25. Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: VLDB (2007)
26. Prabhakar, S., Mayfield, C., Cheng, R., Singh, S., Shah, R., Neville, J., Hambrusch, S.: Database support for probabilistic attributes and tuples. In: ICDE (2008)
27. Re, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: ICDE (2007)
28. Soliman, M.A., Ilyas, I.F., Chang, K.C.: Top-k query processing in uncertain databases. In: ICDE (2007)
29. Tao, Y., Hristidis, V., Papadias, D., Papakonstantinou, Y.: Branch-and-bound processing of ranked queries. Inf. Syst. (2007)
30. Theodoridis, Y., Sellis, T.: A model for the prediction of R-tree performance. In: PODS (1996)