Titlebook: Advances in Spatial Databases; 5th International Sy Michel Scholl,Agnès Voisard Conference proceedings 1997 Springer-Verlag Berlin Heidelbe

anagen

laceration

把…比做

https://doi.org/10.1007/978-3-030-11012-3 on this parameter. We then analyze the .-tree analytically, giving theoretical bounds on the degree of imbalance of the tree. We also analyze the .-tree experimentally. While the .-tree is extremely effective for static databases, we outline the extension to dynamic databases as well.

Musket

0302-9743 . The papers are organized in topical sections on spatial similarities, geo-algorithms, spatial constraint databases, spatial query processing, systems, spatial data models and spatial access methods.978-3-540-63238-2978-3-540-69240-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

密切關(guān)系

Conference proceedings 199797..The 18 revised full papers presented were carefully selected from a total of 55 submissions. Also included are two keynote contributions. The papers are organized in topical sections on spatial similarities, geo-algorithms, spatial constraint databases, spatial query processing, systems, spatial

Esalate

精致

Stefan Milz,Tobias Rüdiger,Sebastian Süssd in most implementations of .-tree, it is more superior in terms of the time required to split a node, the distribution of data after splitting, as well as the area of overlapping. Most important of all, it has a better query performance. The claim is substantiated by an analysis of the algorithm and a set of empirical results.

在駕駛

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149836.jpg

expository

安裝