Indexing uncertain data

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 137-146

  Agarwal, Pankaj K ^a   Cheng, Siu Wing ^b   Tao, Yufei ^c   Yi, Ke ^b  

^a DUKE UNIVERSITY   (United States)

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

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Indexing; Range query; Uncertain data

Indexed keywords

DATA MANAGEMENT; EXTERNAL MEMORY MODELS; GAUSSIANS; INDEXING; INDEXING SCHEME; LINEAR SPACES; MEASUREMENT DATA; PIECE-WISE; PROBABILITY DENSITY FUNCTION (PDF); PROBABILITY THRESHOLD; QUERY TIME; RANGE QUERY; UNCERTAIN DATA; UNCERTAIN DATAS;

DATABASE SYSTEMS; INDEXING (OF INFORMATION); PROBABILITY DISTRIBUTIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

PROBABILITY DENSITY FUNCTION;

EID: 70350686714     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559795.1559816     Document Type: Conference Paper

References (25)

1. P. Afshani and T. M. Chan, Optimal halfspace range reporting in three dimensions, Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 180-186.
2. P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. Vitter, Efficient searching with linear constraints, Journal of Computer and System Sciences, 61 (2000), 194-216.
3. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in: Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, and R. Pollack, eds.), American Mathematical Society, Providence, RI, 1999, pp. 1-56.
4. P. K. Agarwal and J. Matoušek, Dynamic half-space range reporting and its applications, Algorithmica, 13 (1995), 325-345.
5. P. K. Agarwal and M. Sharir, Davenport-Schinzel sequences and their geometric applications, in: Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, eds.), Elsevier Science Publishers, Amsterdam, 2000, pp. 1-47.
6. A. Aggarwal and J. S. Vitter, The input/output complexity of sorting and related problems, Communica-tions of the ACM, 31 (1988), 1116-1127.
7. P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. Nabar, T. Sugihara, and J. Widom, Trio: A system for data, uncertainty, and lineage, Proc. International Conference on Very Large Databases, 2006, pp. 1151-1154.
8. B. Aronov, S. Har-Peled, and M. Sharir, On approximate halfspace range counting and relative epsilonapproximations, Proc. 23rd Annual Symposium on Computational Geometry, 2007, pp. 327-336.
9. J. L. Bentley and J. B. Saxe, Decomposable searching problems I: Static-to-dynamic transformation, Journal of Algorithms, 1 (1980), 301-358.
10. T. M. Chan, Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions, SIAM Journal on Computing, 30 (2000), 561-575.
11. B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica, 1 (1986), 133-162.
12. B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality, BIT, 25 (1985), 76-90.
13. B. Chazelle and B. Rosenberg, Simplex range reporting on a pointer machine, Computational Geometry: The-ory and Applications, 5 (1996), 237-247.
14. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. S. Vitter, Efficient indexing methods for probabilistic threshold queries over uncertain data, Proc. International Conference on Very Large Databases, 2004, pp. 876-887.
15. K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Computational Geometry, 4 (1989), 387-421.
16. N. Dalvi and D. Suciu, Efficient query evaluation on probabilistic databases, Proc. International Conference on Very Large Databases, 2004, pp. 864-875.
17. H. Davenport and A. Schinzel, A combinatorial problem connected with differential equations, American Jour-nal of Mathematics, 87 (1965), 684-689.
18. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica, 6 (1986), 151-177.
19. V. Ljosa and A. K. Singh, APLA: Indexing arbitrary probability distributions, Proc. IEEE Interna-tional Conference on Data Engineering, 2007, pp. 946-955.
20. G. Nivasch, Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations, Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 1-10.
21. H. Samet, Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, 2006.
22. S. Singh, C. Mayfield, S. Prabhakar, R. Shah, and S. Hambrusch, Indexing uncertain categorical data, Proc. IEEE International Conference on Data Engi-neering, 2007, pp. 616-625.
23. Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. Kao, and S. Prabhakar, Indexing multi-dimensional uncertain data with arbitrary probability density functions, Proc. International Conference on Very Large Databases, 2005, pp. 922-933.
24. Y. Tao, X. Xiao, and R. Cheng, Range search on multidimensional uncertain data, ACM Transactions on Database Systems, 32 (2007), 15.
25. M. L. Yiu, N. Mamoulis, X. Dai, Y. Tao, and M. Vaitis, Efficient evaluation of probabilistic advanced spatial queries on existentially uncertain data, IEEE Transac-tions on Knowledge and Data Engineering, 21 (2009), 108-122.