| A. Gutman. R-trees: A dynamic index structure for spatial searching. In Proc. of SIGMOD, 1997. |
....1.3 Related Work As for time travel queries, LHAM supports exact match queries as well as range queries on key, time, and the combination of key and time. Temporal index structures with this scope include the TSB tree [LS89, LS90] the MVBT [Bec96] the Two Level Time Index [EWK93] the R tree [Gut84], and the Segment Rtree [Ko193] a variant of the R tree specifically suited for temporal databases. Temporal index structures like the Snapshot Index [TK95] the Time Index [EWK93, EKW91] and the TP Index [SOL94] aim only at supporting specific query types effciently. Comparing them with other ....
A. Gutman, R-trees: A Dynamic Index Structure for Spatial Searching, Proc. SIGMOD Conf., 1984
....one dimensional intervals, extended object handling, point query, range query, spatial data, parameter space 1 Introduction The management of extended objects has been discussed a lot in the research community and several multidimensional access methods (MAM) have been proposed. R Trees [8] and quad trees [16] are a quasi standard in spatial database applications. These data structures have been developed to deal with extended objects with a dimensionality greater than one and they are not specialized for one dimensional objects resp. intervals. On the other hand there are ....
Gutman, A. (1984); R-Trees: A dynamic index structure for spatial searching. Proc. of ACM SIGMOD Conf. (pp. 47-57)
....optimizing retrieval [11] Work in the database literature has focused primarily on efficient data structures for retrieving matches from disk. It is a well accepted fact in the database literature that the traditional indexing methods fail to be useful if the dimensionality of the data is high [25, 20, 22, 5, 3, 1, 31, 23, 27]. Since a full data scan to check all distances is ruled out for large databases, another solution is necessary when the data is high dimensional. There is increasing interest in avoiding this curse of dimensionality by performing approximate nearest neighbor queries [21] In data mining ....
....organized in a tree structure to support efficient querying. The type of bounding object and the method of constructing and maintaining the trees vary widely. Minimum bounding rectangles are used in many approaches, for example K D B Trees, R Trees, R Trees, X trees, 4 and Vornoi based indexing [25, 20, 22,5,3]. Pyramid Tree indexing uses more general bounding polyhedrons [3, 1] SS Trees use bounding hyperspheres [31] SR Trees use both bounding hyperspheres and bounding boxes [23] Seidl and Krieger have found optimal methods for calculating the optimal multi step calculation of nearest neighbors when ....
A. Gutman. R-trees: A dynamic index structure for spatial searching. In Proceedings of ACM SIGMOD International Conference on Management of Data, Atlantic City, New Jersey, pages 322--331, 1997.
No context found.
A. Gutman. R-trees: A dynamic index structure for spatial searching. In Proc. of SIGMOD, 1997.
No context found.
A. Gutman. R-trees: A dynamic index structure for spatial searching. In Proc. of SIGMOD, 1997.
No context found.
Gutman A (1984) R-Trees: A Dynamic Index Structure For Spatial Searching. Proceedings of the ACM SIGMOD Conference, pp 44-57
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC