An extensible index for spatial databases

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

Volumn , Issue , 2001, Pages 49-58

  Aref, W G ^a   Ilyas, I F ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER AIDED MANUFACTURING; CONCURRENCY CONTROL; DATA MINING; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; INDEXING (OF INFORMATION); RECURSIVE FUNCTIONS; REQUIREMENTS ENGINEERING; TREES (MATHEMATICS);

EXTENSIBLE INDEX STRUCTURE; SPACE PARTITIONING UNBALANCED TREES; SPATIAL DATABASE;

RELATIONAL DATABASE SYSTEMS;

EID: 53949108108     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. The handwritten trie: Indexing electronic ink
2. A framework for supporting the class of space-partitioning trees
3. The universal B-tree for multidimensional indexing: General concepts
4. The R* -tree: An efficient robust access method for points and rectangles
5. Multidimensional binary search trees used for associative searching
6. Parallel processing of spatial joins using R-trees
7. Dynamic granular locking approach to phantom protection in R-trees
8. Efficient concurrency control in multidimensional access methods
9. Oracle spatial (data sheet)
10. File searching using variable length keys
11. Client-server paradise
12. Clustering techniques for minimizing external path length
13. Spatial database programming using sand
14. The notions of concurrency and predicate locks in a data base system
15. Analysis of n-dimensional quadtrees using the hausdorff fractal dimension
16. Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles
17. Quad trees: A data structure for retrieval on composite key
18. Trie memory
19. Multidimensional access methods
20. An effective way to represent quadtrees
21. Notes on data base operating systems
22. An introduction to spatial database systems
23. R-trees: A dynamic index structure for spatial searching
24. Generalized search trees for database system
25. The RD-tree: An index structure for sets
26. The quad-CIF tree: A data structure for hierarchical on-line algorithms
27. Pattern and search statistics
28. High-concurrency locking in R-trees
29. Concurrency and recovery in generalized search trees
30. Efficient locking for concurrent operations on B-Trees
31. PATRICIA - Practical algorithm to retrieve coded in alphanumeric
32. A consistent hierarchical representation for vector data
33. The grid file: An adaptable symmetric multi-key file structure
34. Multidimensional tries used for associative searching
35. PROBE spatial data modeling and query processing in an image database application
36. Algorithms for querying by spatial structure
37. Storing a collection of polygons using quadtrees
38. The buddy-tree: An efficient and robust access method for spatial data base systems
39. The R+ - Tree: A dynamic index for multi-dimensional objects
40. Designing and mining multi-terabyte astronomy archives: The sloan digital sky survey