Titlebook: Advances in Spatial Databases; 2nd Symposium, SSD ‘ Oliver Günther,Hans-J?rg Schek Conference proceedings 1991 Springer-Verlag Berlin Heide

Pigeon

同來核對

Chang Liu,Wei Ke,Fei Qin,Qixiang Yemilarities between spatial and temporal reasoning which can be exploited to build an integrated reasoning framework. The latter is important because planning and reasoning usually requires consideration of both the temporal and spatial aspects of the situation under study. Topological constraints ar

osteoclasts

https://doi.org/10.1007/978-3-030-01216-8ch performance. GP methods fit well with the rest of a database system, and indeed profit from their inclusion, e.g, search performance is improved by caching index nodes. Enhancements to GP methods have increased their utility. GP methods solve the multi-attribute point search problem and, more spe

impale

Semi-supervised Deep Learning with Memoryolumes of data oblige us to store it in secondary memory which greatly slows down the access time. Thus the indexing technique, which determines the way of secondary memory access, is an essential point in hypermap systems. There are several researches on spatial indexing techniques, but due to the

Diuretic

gain631

https://doi.org/10.1007/978-3-030-01246-5 segment databases such as those found in transportation networks and polygonal maps. Three classes of queries are identified. Those that deal with the line segments themselves, those that involve both the line segments and the space from which they are drawn (e.g., proximity queries), and those tha

名字的誤用

ACRID

Chu Wang,Babak Samari,Kaleem Siddiqiailed discussion and a comprehensive experimental performance comparison of these methods. Each of the segment access methods is implemented on top of an ordinary point access method using the techniques clipping, overlapping regions and transformation. As the basic point access method we have chose

Metamorphosis

epinephrine