Efficient techniques for range search queries on earth science data

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

Volumn 2002-January, Issue , 2002, Pages 142-151

  Shi, Qingmin ^a   JaJa, J F ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Computational modeling; Content based retrieval; Data mining; Data structures; Educational institutions; Geoscience; Information retrieval; Large scale systems; Organizing; Tree data structures

Indexed keywords

CONTENT BASED RETRIEVAL; DATA MINING; DATA STRUCTURES; DECISION TREES; EARTH SCIENCES; FORESTRY; INFORMATION RETRIEVAL; LARGE SCALE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; TREES (MATHEMATICS);

COMPUTATIONAL MODEL; EDUCATIONAL INSTITUTIONS; GEOSCIENCES; ORGANIZING; TREE DATA STRUCTURES;

SEARCH ENGINES;

EID: 84943273625     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDM.2002.1029714     Document Type: Conference Paper

References (25)

1. Landsat thematic mapper data. http://edc.usgs.gov/glis/hyper/guide/landsat-tm.
2. Goddard DAAC NOAA/NASA Pathfinder AVHRR Land (PAL). http://daac.gsfc.nasa.gov/REFERENCE-DOCS/dataset-references/pal-summary.html, 1999.
3. Content-based search and data mining. http://www.esipfed.net/clusters/content-based/sci-scen.html, 2000.
4. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, Sept. 1988.
5. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. In Proceedings of the 4th International Workshop on Algorithms and Data Structures (WADS'95), pages 334-345, Kingston, Ontario, Canada, Aug. 1995.
6. L. Arge, K. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. In Proceedings of the 1st Workshop on Algorithm Engineering and Experimentation, pages 328-348, Baltimore, MD, Jan. 1999.
7. L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 346-357, Philadelphia, PA, May 1999.
8. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R∗-tree: An efficient and robust access method for points and rectangles. In H. Garcia-Molina and H. V. Jagadish, editors, Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pages 322-331, Atlantic City, NJ, May 1990.
9. S. Berchtold, C. Böhm, and H.-P. Kriegel. Improving the query performance of high-dimensional index structures by bulk-load operations. In Proc. 6th Int. Conf. Extending Database Technology, EDBT, pages 216-230, Mar. 1998.
10. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree : An index structure for high-dimensional data. In VLDB'96, Proceedings of 22nd International Conferenceon Very Large Data Bases, pages 28-39, Mumbai (Bombay), India, Sept. 1996.
11. J. V. den Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece, pages 406-415, 1997.
12. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 226-231, Portland, OR, Aug. 1996.
13. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170-231, 1998.
14. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 47-57, Boston, MA, June 1984.
15. I. Kamel and C. Faloutsos. On packing R-trees. In In Proceedings of the Second International Conference on Information and Knowledge Management, pages 490-499, 1993.
16. I. Kamel and C. Faloutsos. Hilbert R-tree: An improved R-tree using fractals. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 500-509, Santiago, Chile, 1994.
17. P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Indexing for data models with constraints and classes. Journal of Computer and System Science, 52(3):589-612, 1996.
18. S. T. Leutenegger, J. M. Edgington, and M. A. Lopez. STR: A simple and efficient algorithm for R-tree packing. In Proceedings of the 13th International Conference on Data Engineering (ICDE'97), pages 497-507, Apr. 1997.
19. N. Roussopoulos and D. Leifker. Direct spatial search on pictorial databases using packed R-trees. In Proceedings of ACM-SIGMOD 1985 International Conference on Management of Data, pages 17-31, Austin, TX, Dec. 1985.
20. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th Interntational Conferenceon Very Large Data Bases, pages 507-518, Brighton, England, Sept. 1987.
21. S. Subramanian and S. Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 378-387, 1995.
22. J. S. Vitter. External memory algorithms. In Proceedings of the Seventeenth ACM Symposium on Principles of Database Systems, pages 119-128, New York, NY, USA, June 1998.
23. W. Wang, J. Yang, and R. Muntz. STING: a statistical information grid approach to spatial data mining. In Proceedings of the Twenty-Third International Conference on Very Large Data Bases, pages 186-195, Athens, Greece, Aug. 1997.
24. D. A. White and R. Jain. Algorithms and strategies for similarity retrieval. Technical Report VCL-96-101, Visual Computing Laboratory, University of California, San Diego, CA, 1996.
25. R. Yang, K.-S. Yang, M. Kafatos, and X. Wang. Value range queries on earth science data via histogram clustering. In First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining, pages 62-76, Lyon, France, Sept. 2001.