Top-k spatial joins of probabilistic objects

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 566-575

  Ljosa, Vebjorn ^a   Singh, Ambuj K ^b  

^a BROAD INSTITUTE OF MIT AND HARVARD   (United States)

^b Santa Barbara   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE ENHANCEMENT; MANAGEMENT INFORMATION SYSTEMS; PROBABILITY; SCHEDULING; SPEED; TECHNOLOGY;

A-PLANE; DATA ENGINEERING; DATA MANAGEMENT SYSTEMS; DATA SETS; GEO-SPATIAL DATABASES; INTERNATIONAL CONFERENCES; ORDERS-OF-MAGNITUDE; PLANE SWEEP; PROBABILISTIC DATA; PSJ QUERIES; SPATIAL DATASETS; SPATIAL JOINS; SPECIAL STRUCTURE; SPEED-UPS;

SCHEDULING ALGORITHMS;

EID: 52649176372     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497465     Document Type: Conference Paper

References (38)

1. D. J. Abel, V. Gaede, R. A. Power, and X. Zhou, "Caching strategies for spatial joins," GeoInformatica, vol. 3, no. 1, pp. 33-59, 1999.
2. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter, "Scalable sweeping-based spatial join," in Proceedings of the 24rd International Conference on Very Large Data Bases (VLDB), 1998, pp. 570-581.
3. T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient processing of spatial joins using R-trees," in Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993, pp. 237-246.
4. Y.-W. Huang, N. Jing, and E. A. Rundensteiner, "Spatial joins using R-trees: Breadth-first traversal with global optimizations," in Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), 1997, pp. 396-405.
5. J. M. Patel and D. J. DeWitt, "Partition based spatial merge join," in Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996, pp. 259-270.
6. S. Ravada, S. Shekhar, C. tien Lu, and S. Chawla, "Optimizing join index based spatial join processing: A graph partitioning approach," in Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, 1998, pp. 302-308.
7. M. Martone, S. Zhang, A. Gupta, X. Qian, H. He, D. Price, M. W. M, S. Santini, and M. Ellisman, "The Cell-Centered Database: A database for multiscale structural and protein localization data from light and electron microscopy," Neuroinformatics, vol. 1, no. 3, pp. 379-396, 2003.
8. A. K. Singh, B. Manjunath, and R. F. Murphy, "A distributed database for bio-molecular images," SIGMOD Record, vol. 33, no. 2, pp. 65-71, 2004.
9. J. R. Swedlow, I. Goldberg, E. Brauner, and P. K. Sorger, "Informatics and quantitative analysis in biological imaging," Science, vol. 300, pp. 100-102, 2003.
10. V. Ljosa and A. K. Singh, "Probabilistic segmentation and analysis of horizontal cells," in Proceedings of the Sixth IEEE International Conference on Data Mining (ICDM), Dec. 2006.
11. O. Camoglu, T. Can, and A. K. Singh, "Integrating multi-attribute similarity networks for robust representation of the protein space," Bioinformatics, vol. 22, no. 13, pp. 1585-1592, 2006.
12. R. Cheng, D. V. Kalashnikov, and S. Prabhakar, "Querying imprecise data in moving object environments," IEEE Transactions on Knowledge Engineering, vol. 16, no. 9, pp. 1112-1127, Sept. 2004.
13. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. S. Vitter, "Efficient indexing methods for probabilistic threshold queries over uncertain data," in Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), 2004.
14. V. Ljosa and A. K. Singh, "APLA: Indexing arbitrary probability distributions," in Proceedings of the 23nd International Conference on Data Engineering (ICDE), 2007.
15. Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. Kao, and S. Prabhakar, "Indexing multi-dimensional uncertain data with arbitrary probability density functions," in Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), 2005.
16. C. Ré, N. Dalvi, and D. Suciu, "Efficient top-k query evaluation on probabilistic data," in Proceedings of the 23nd International Conference on Data Engineering (ICDE), 2007, pp. 886-895.
17. S. Singh, C. Mayfield, S. Prabhakar, R. Shah, and S. Hambrusch, "Indexing uncertain categorical data," in Proceedings of the 23nd International Conference on Data Engineering (ICDE), 2007, pp. 616-625.
18. W. K. Ngai, B. Kao, C. K. Chui, R. Cheng, M. Chau, and K. Y. Yip, "Efficient clustering of uncertain data," in Proceedings of the Sixth IEEE International Conference on Data Mining (ICDM), 2006, pp. 436-445.
19. J. C. Nekola and P. S. White, "The distance decay of similarity in biogeography and ecology," Journal of Biogeography, vol. 26, pp. 867-878, 1999.
20. R. N. Shepard, "Toward a universal law of generalization for psychological science," Science, vol. 237, pp. 1317-1323, 1987.
21. G. Lewis, K. Linberg, and S. Fisher, "Neurite outgrowth from bipolar and horizontal cells after experimental retinal detachment," Investigative Ophthalmology & Visual Science, vol. 39, no. 2, pp. 424-434, Feb. 1998.
22. S. K. Fisher and G. P. Lewis, "Müller cell and neuronal remodeling in retinal detachment and reattachment and their potential consequences for visual recovery: a review and reconsideration of recent data," Vision Research, vol. 43, pp. 887-897, 2003.
23. G. P. Lewis, K. A. Linberg, and S. K. Fisher, "Neurite outgrowth from bipolar and horizontal cells after experimental retinal detachment," Investigative Ophthalmology & Visual Science, vol. 39, no. 2, pp. 424-434, Feb. 1998.
24. J. L. Bentley and T. Ottmann, "Algorithms for reporting and counting geometric intersections," IEEE Transactions on Computing, vol. C-28, pp. 643-647, 1979.
25. D. Eppstein, M. T. Goodrich, and J. Z. Sun, "The skip quadtree: A simple dynamic data structure for multidimensional data," in Proceedings of the Twenty-First Annual Symposium on Computational Geometry (SCG 2005), 2005, pp. 296-305.
26. E. Castillo, A. S. Hadi, N. Balakrishnan, and J. M. Sarabia, Extreme Value and Related Models with Applications in Engineering and Science. Wiley, 2005.
27. D. A. White and R. Jain, "Similarity indexing: Algorithms and performance," Proceedings of SPIE, vol. 2670, pp. 62-73, Mar. 1996.
28. C. Hoare, "Algorithm 65: Find," Communications of the ACM, vol. 4, no. 7, pp. 321-322, 1961.
29. H.-P. Kriegel, S. Brecheisen, P. Kröger, M. Pfeifle, and M, Schubert, "Using sets of feature vectors for similarity search on voxelized CAD objects," in Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003.
30. H. Yu and W. Niu, "Efficient similarity search on vector sets," Department of Computer Science, University of California, Santa Barbara, Tech. Rep. 2004-13, 2004.
31. R. C. Gonzales and R. E. Woods, Digital Image Processing. Addison-Wesley, 1993.
32. T. Kahveci, C. A. Lang, and A. K. Singh, "Joining massive high-dimensional datasets," in Proceedings of the 19th International Conference on Data Engineering (ICDE), 2003, pp, 265-276.
33. C. Faloutsos, B. Seeger, A. Traina, and J. Caetano Traina, "Spatial join selectivity using power laws," in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 177-188.
34. R. Fagin, "Combining fuzzy information from multiple systems," Journal of Computer and System Sciences, vol. 58, no, 1, pp. 83-99, Feb. 1999.
35. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2001, pp. 102-113.
36. P. Agrawal and J. Widom, "Confidence-aware joins in large uncertain databases," Stanford University, Tech. Rep. 2007-14, 2007.
37. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Top-k query processing in uncertain databases," in Proceedings of the 23nd International Conference on Data Engineering (ICDE), 2007, pp. 896-905.
38. H.-P, Kriegel, P. Kunath, M. Pfeifle, and M. Renz, "Probabilistic similarity join on uncertain data," in Proceedings of the 11th International Conference on Database Systems for Advanced Applications, 2006, pp. 295-309.