Schiwietz M., Kriegel H.-P..: `Query Processing of Spatial Objects: Complexity versus Redundancy', Proc. 3rd Int. Symp. on Large Spatial Databases, Singapore, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Object Decomposition For Spatial Query Processing - Lee, Lee (Correct)
....has no redundancy, it is not necessary to store redundant components. AS of a grid like representation depends on p and d. That is, ASs in C2 and C3 are O(p d) 27] and O( p d 2 ) 13] respectively. AS of C4 needs about the same amount of storage as the number of vertices of the original object[28], i.e. O(n v ) AS of C5 is proportional to the total number of nodes 2 0 i d = in a two dimensional binary tree, i.e. O( 2 d ) Table 3 summarizes the results of this analysis. Table 3. Results of complexity analysis Class NC QA SO RP AS C1 O(1) O(1) O(1) O( nv ) O(0) C2 O(pd) O( ....
....g, we explicitly measured the processing time for various g values by implementing basic spatial queries. In order to determine whether the traditional MBR approach is the I O bound or the CPU bound, we derived the execution time of various spatial queries from empirical tests presented in [25,28] (see Fig. 13) Since the tests used real cartographic maps presenting the counties of the European Community and some municipalities of Baden WQrttemberg, the results seem to be more realistic than a uniformly distributed data set. Fig. 13(a) depicts the following: the horizontal axis represents ....
[Article contains additional citation context not shown here]
M. Schiwietz, H. P. Kriegel, "Query Processing of Spatial Objects: Complexity versus Redundancy," Proc. of 3rd Symp. on Large Spatial Databases, Lecture Notes in Computer Science 692, Springer-Verlag, 1993, pp. 377-396.
Potentials for Improving Query Processing in Spatial.. - Kriegel, Schneider.. (1993) (2 citations) Self-citation (Kriegel) (Correct)
....we measured performance improvements of a factor of 50. These results document impressingly that it is worth to integrate the approach of decomposition into spatial query processing. Further research on the trade off between the complexity of the components and their number is reported in [SK 93] 6 Spatial Join Processing In a database system, we can distinguish between two different types of queries. The one type of queries, called single scan queries, requires at most one access to an object and therefore, the execution time is at most linear in the number of objects stored in the ....
Schiwietz M., Kriegel H.-P..: `Query Processing of Spatial Objects: Complexity versus Redundancy', Proc. 3rd Int. Symp. on Large Spatial Databases, Singapore, 1993.
Comp630c survey paper Spatial objects representation and query - Sun Yong Li (Correct)
No context found.
Hans-Peter Kriegel Michael Schiwietz. Query processing of spatial objects: Complexity versus redundancy. In Advances in Spatial Databases. Third International Symposium, SSD'93 Proceedings, pages 377--96, 1993.
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