A spatial index structure using dynamic recursive space partitioning

2011 International Conference on Innovations in Information Technology, IIT 2011

Volumn , Issue , 2011, Pages 255-260

  Al Badarneh, Amer ^a   Al Alaj, Abdullah ^a  

^a JORDAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Jordan)

Author keywords

R tree; space partitioning; spatial indexing; spatial queries

Indexed keywords

DATA SPACE; INDEX NODES; QUERY EXECUTION; R-TREE; SPACE PARTITIONING; SPATIAL INDEX STRUCTURE; SPATIAL INDEXING; SPATIAL QUERIES;

DECISION TREES; INNOVATION; PARTITIONS (BUILDING); TREES (MATHEMATICS);

INFORMATION TECHNOLOGY;

EID: 79960016320     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INNOVATIONS.2011.5893828     Document Type: Conference Paper

References (17)

1. Guttman A. R-Trees: A dynamic index structure for spatial searching, Proceedings of the ACM SIGMOD International Conference on Management of Data; June 1984; 47-57; Boston, MA.
2. Sellis T, Roussopoulos N, Faloutsos C. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects, Proceedings of the 13th Conference on Very Large Databases (VLDB); 507-518; 1987; England.
3. Bechmann N, Kriegel H, Schneider R, Seeger B. The R*-tree: An efficient and robust access method for points and rectangles, Proceedings of the ACM SIGMOD International Conference on Management of Data; May 1990; 322-332; Atlantic City, NJ.
4. Brinkhoff T, Kriegel H, Schneider R, Seeger B. Multi-Step Processing of Spatial Joins, Proceedings ACM SIGMOD Conference; 1994; 197-208; Minneapolis, MN.
5. Gottschalk S, Lin M, Manocha D. Obb-tree: A hierarchical structure for rapid interference detection. Proceedings of ACM SIGGRAPH; August 1996; 171-180.
6. White D, Jain R. Similarity indexing with the SS-tree. Proceedings of the 12th IEEE International Conference on Data Engineering; February 1996; 516-523.
7. Philip M, Collision Detection for Interactive Graphics Applications. IEEE Transactions on Visualization and Computer Graphics; September 1995; 1(3): 218-230.
8. Katayama N, Satoh S, The SR-tree: an index structure for high dimensional nearest neighbor queries. Proceedings of the International Conference on Management of Data; 1997; 360-389.
9. Jagadish H. Spatial Search with Polyhedra. Proceedings of the 6th IEEE ICDE Conference; 1990; 311-319; Orlando, FL.
10. Ibrahim A, Fotouhi F, Al-Badarneth A. Efficient Processing of Spatial Selection and Join Operations using SB+-Tree. IDEAS; 1997; 279-288.
11. Finkel R, Bentley J. Quad Trees: A Data Structure for Retrieval on Composite Keys. in Acta Informatica; 1974; 4; 1-9.
12. Bentley J. Multidimensional Binary Search Trees Used for Associative Searching. in Communications of the ACM; 1975; 18; 509-517.
13. Yianilos P. Data structures and algorithms for nearest neighbor search in general metric spaces. Proceedings of the 4th Annual ACMSIAM Symposium on Discrete Algorithms; 1993; 311-321.
14. Berchtold S, Keim D, Kriegel H. The X-tree: An Index Structure for High-Dimensional Data. Proceedings of the 22th Conference on Very Large Databases (VLDB); 1996; 28-39.
15. Comer D. The Ubiquitous B-Tree. ACM Computing Surveys; June 1979; 11(2); 121-137.
16. Kamel I, Faloutsos C. Hilbert R-tree: An Improved R-tree Using Fractals. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), September 1994.
17. TIGER/Line files, U.S. Bureau of Census, Washington DC [online] [ accessed May 2009]. Available from URL http://www.census.gov/geo/www/tiger