Probabilistic ranking queries on Gaussians

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2006, Pages 169-178

  Böhm, Christian ^a   Pryakhin, Alexey ^a   Schubert, Matthias ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATABASE SYSTEMS; DISTRIBUTION FUNCTIONS; FUNCTION EVALUATION; GAUSSIAN DISTRIBUTION; MANAGEMENT INFORMATION SYSTEMS; NORMAL DISTRIBUTION; PARALLEL PROCESSING SYSTEMS; PROBABILITY; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; STANDARDS; STATISTICAL METHODS; STATISTICS; TREES (MATHEMATICS);

DATA OBJECTS; DATABASE MANAGEMENT; DISCRETE TIME INTERVALS; EXPERIMENTAL EVALUATIONS; GAUSSIAN; GAUSSIANS; INDEX STRUCTURES; INTERNATIONAL CONFERENCES; MEAN VALUE (MV); MODERN APPLICATIONS; MOVING OBJECTS; PROBABILISTIC RANKING; PROBABILITY DENSITIES; RANKING QUERIES; SPEED UPS; STANDARD DEVIATION (STD); TIME STAMP (TS); TYPICAL APPLICATION; UNCERTAIN DATA;

PROBABILITY DISTRIBUTIONS;

EID: 37849013892     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2006.40     Document Type: Conference Paper

References (9)

1. S. Berchtold, D. A. Keim, and H.-P. Kriegel. "The X-Tree: An Index Structure for High-Dimensional Data". In Proc. 22nd Int. Conf. on Very Large Data Bases (VLDB'96), Bombay, India, pages 28-39, 1996.
2. C. Böhm, S. Berchthold, and D. Keim. "Searching in High-dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases". ACM Computing Surveys, 3(33), 2001.
3. C. Böhm, A. Pryakhin, and M. Schubert. "The GausTree: Efficient Object Identification of Probabilistic Feature Vectors". In Proc. 22nd Int. Conf. on Data Engineering (ICDE'06)),Atlanta,GA,US, 2006.
4. R. Cheng, D. Kalashnikov, and S. Prabhakar. "Evaluating Probabilistic Queries over Imprecise Data". In Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'03), San Diego, CA, USA, pages 551-562, 2003.
5. 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 (VLDB'04), Toronto, Cananda, pages 876-887, 2004.
6. X. Dai, M. L. Yiu, N. Mamoulis, Y Tao, and M. Vaitis. "Probabilistic Spatial Queries on Existentially Uncertain Data". In Proc. 9th Int. Symposium on Spatial and Temporal Databases (SSTD2005), Angra dos Reis, Brazil, pages 400-417, 2005.
7. A. Guttman. "R-trees: A Dynamic Index Structure for Spatial Searching". In Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD '84), Boston, MA, USA, pages 47-57, 1984.
8. G. Hjaltason and H. Samet. "Ranking in Spatial Databases". In Proc. 4th Int. Symposium on Large Spatial Databases, SSD'95, Portland, USA, pages 83-95, 1995.
9. Y. Tao, R. Cheng, X. Xiao, W. Ngai, B. Kao, and S. Prabhakar. "Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions". In Proc. 31st Int. Conf. on Very Large Data Bases (VLDB'05), Trondheim, Norway, pages 922-933, 2005.