A new indexing scheme supporting multi-attribute database applications: MAX

Journal of Systems Architecture

Volumn 42, Issue 2, 1996, Pages 144-162

  Kim, Byungwook ^a   Moon, Songchun ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Database; GIS; Multi attribute; Spatial; Spatial data

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; PERFORMANCE; QUERY LANGUAGES; Z TRANSFORMS; ALGORITHMS; DATA HANDLING; INDEXING (OF INFORMATION); RECORDS MANAGEMENT; TREES (MATHEMATICS);

MULTI ATTRIBUTE INDEXING; SPATIAL DATA; CLUSTERING; HYPERPLANE; MULTI ATTRIBUTE DATA;

INDEXING (OF INFORMATION); DATABASE SYSTEMS;

EID: 0030222521     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/1383-7621(96)80001-M     Document Type: Article

References (17)

1. N. Beckmann, H.-P. Kriegel, R. Schneider and B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in: Proc. ACM SIGMOD Conf. (1990) 322-331.
2. J.L. Bentley, Multidimensional binary search trees in database applications, IEEE Trans. Software Engineering (4) (1979) 333-340.
3. D. Comer, The ubiquitous B-Tree, ACM Comput. Surveys 11 (2) (1979) 121-137.
4. M. Freeston, A general solution of the n-dimensional B-tree problem, ACM SIGMOD Conf. (1995) 80-91.
5. O. Günther, The design of the Cell Tree: An object-oriented index structure for geometric databases, in: Proc. IEEE Data Engineering Conf. (1989) 598-605.
6. A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proc. ACM SIGMOD Conf. (1984) 47-57.
7. I. Kamel and C. Faloutsos, Parallel R-trees, in: Proc. ACM SIGMOD Conf. (1992) 195-204.
8. I. Kamel and C. Faloutsos, Hilbert R-tree: An improved R-tree using fractals, in: Proc. VLDB Conf. (1994) 500-509.
9. B. Kim and S. Moon, A flexible indexing structure supporting multi-attribute database applications: MAIN, J. Microprocessing and Microprogramming 39 (1993) 177-180.
10. C.P. Kolovson and M. Stonebraker, Segment indexes: Dynamic indexing techniques for multi-dimensional interval data, Proc. ACM SIGMOD Conf. (1991) 138-147.
11. K.-I. Lin, H.V. Jagadish and C. Faloutsos, The TV-tree: An index structure for high-dimensional data, VLDB J. 3 (4) (1995) 517-542.
12. J. Nievergelt, H. Hinterberger and K.C. Sevcik, The Grid File: An adaptable, symmetric multikey file structure, ACM Trans. Database Systems, 9 (1) (1984) 38-71.
13. J.A. Orenstein, Multidimensional tries used for associative searching, Inform. Process. Lett. 14 (4) (1982) 150-157.
14. J.A. Orenstein, Spatial query processing in an object-oriented database system, Proc. ACM SIGMOD Conf. (1986) 326-336.
15. J.T. Robinson, The K-D-B Tree: A search structure for large multidimensional dynamic indexes, in: Proc. ACM SIGMOD Conf. (1981) 10-18.
16. B. Seeger and H.-P. Kriegel, The Buddy-Tree: An efficient and robust access method for spatial data base systems, in: Proc. VLDB Conf. (1990) 590-601.
17. +-tree: A dynamic index for multi-dimensional objects, in: Proc. VLDB Conf. (1987) 507-518.