Improving the R*-tree with outlier handling techniques

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2005, Pages 125-134

  Xia, Tian ^a   Zhang, Donghui ^a  

^a Northeastern University   (United States)

Author keywords

Outlier; R* tree

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION TECHNOLOGY; QUERY LANGUAGES;

-TREE; HANDLING TECHNIQUES; ORACLE; OUTLIER; R;

TREES (MATHEMATICS);

EID: 33644590842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1097064.1097083     Document Type: Conference Paper

References (20)

1. N. An, K. Kanth, and S. Ravada. Improving Performance with Bulk-Inserts in Oracle R-Trees. In VLDB, 2003.
2. L. Arge, M. Berg, H. J. Haverkort, and K. Yi. The Priority R-tree: A Practically Efficient and Worst-case Optimal R-tree. In ACM SIGMOD, pages 347-358, 2004.
3. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In ACM SIGMOD, pages 322-331, 1990.
4. C. Böhm, S. Berchtold, and D. A. Keim. Searching in High-dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys, 33(3):322-373, 2001.
5. T. Brinkhoff, H. Kriegel, and B. Seeger. Efficient Processing of Spatial Joins using R-trees. In ACM SIGMOD, pages 237-246, 1993.
6. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest Pair Queries in Spatial Databases. In ACM SIGMOD, pages 189-200, 2000.
7. V. Gaede and O. Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2):170-231, 1998.
8. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In ACM SIGMOD, pages 47-57, 1984.
9. G. R. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. ACM Transactions on Database Systems (TODS), 24(2):265-318, 1999.
10. Y. Huang, N. Jing, and E. Rundensteiner. Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. In VLDB, pages 396-405, 1997.
11. IBM. IBM Informix Spatial DataBlade Module. http://www-3.ibm.com/ software/data/informix/pubs/specsheets/SWSEC27152000D.pdf.
12. K. V. R. Kanth, A. El Abbadi, D. Agrawal, and A. K. Singh. Indexing Non-Uniform Spatial Data. In Proc. of Int. Database Engineering & Applications Symposium (IDEAS), 1997.
13. K. V. R. Kanth, S. Ravada, and D. Abugov. Quadtree and R-tree Indexes in Oracle Spatial: A Comparison using GIS Data. In A CM SIGMOD, pages 546-557, 2002.
14. Oracle. Oracle8 Spatial Cartridge. http://technet.oracle.com/prod-ucts/ oracle8/info/sdods/xsdo7ds.htm.
15. D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient OLAP Operations in Spatial Data Warehouses. In Proc. of Symposium on Spatial and Temporal Databases (SSTD), pages 443-459, 2001.
16. D. Papadias, Y. Tao, G. Fu, and B. Seeger. An Optimal and Progressive Algorithm for Skyline Queries. In ACM SIGMOD, pages 467-478, 2003.
17. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. In ACM SIGMOD, pages 71-79, 1995.
18. Y. Theodoridis. The R-tree-portal. http://www.rtreeportal.org, 2003.
19. J. S. Vitter. External Memory Algorithms and Data Structures. ACM Computing Surveys, 33(2):209-271, 2001.
20. D. Zhang and T. Xia. A Novel Improvement to the R*-tree Spatial Index using Gain/Loss Metrics. In ACM Int. Symposium on Advances in Geographic Information Systems (GIS), pages 204-213, 2004.