T. Brinkhoff and H.-P. Kriegel. The impact of global clustering on spatial database systems. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), J. Bocca, M. Jarke, and C. Zaniolo, eds., pages 168--179, Santiago, Chile, September 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....can also be regarded as a clustering problem. These facility location (or clustering) problems arise in many areas, including operations research, shape analysis [247, 208, 142] data compression and vector quantization [197] information retrieval [81, 80] drug design [119] and data mining [28, 48, 251]. A useful extension of the facility location problem, which has been widely studied, is the capacitated facility location problem, in which we have an additional constraint that the size of each cluster should be at most c for some parameter c n=p. If p is considered as part of the input, most ....

T. Brinkhoff and H.-P. Kriegel, The impact of global clusterings on spatial database systems, September 1994.

....object which is compared with the distance associated with the element at the front of the queue. For more details about the algorithm, see [13, 15] 4 5 Spatial Join A key feature of SAND is the focus on the spatial join as a major mode for interacting with the data. A spatial join (e.g. [4, 3]) is a join (e.g. 5] where the join condition involves a spatial attribute. For example, consider a rivers relation (where the spatial attribute is the line segments) and a roads relation (where the spatial attribute is the line segments) In this case, a spatial join of rivers and roads where ....

T. Brinkhoff and H.-P. Kriegel. The impact of global clustering on spatial database systems. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), J. Bocca, M. Jarke, and C. Zaniolo, eds., pages 168--179, Santiago, Chile, September 1994.

....of secondary memory. That is, whenever a leaf f of R3 tree is created, two storage units are allocated in the secondary memory: one for f and another for the triangles referenced by f . This technique is a variation of the grouping techniques based on the R treeproposed by Brinkhoff and Kriegel [5]. In Figure 3, the line R separates the leaves of R3 tree and the pages which contain the descriptions of the triangles referenced by the leaves of R3 tree. Note that the descriptions of the triangles use more space than the entries in the leaves of R3 tree. R Figure 3: The R3 tree and the disk ....

T. Brinkhoff and H. Kriegel. The Impact of Global Clustering on Spatial Database Systems. In Proceedings of the 20th VLDB Conference, September

.... (or clustering) problems arise in many areas, including operations research, shape analysis [91, 140, 164] data compression and vector quantization [131] information retrieval [54, 55] drug design [77] Geometric Optimization September 7, 2000 Facility Location Problems 15 and data mining [16, 32, 166]. A useful extension of the facility location problem, which has been widely studied, is the capacitated facility location problem, in which we have an additional constraint that the size of each cluster should be at most c for some parameter c n=p. If p is considered as part of the input, most ....

T. Brinkho and H.-P. Kriegel, The impact of global clusterings on spatial database systems, Proceedings of the International Conference on Very Large Databases, Morgan Kauman, September 1994, pp. 168-179.

....pages. Another disadvantage of VSAM is that its implementation directly depends on the underlying hardware, whereas our approach exploits an upper software interface which facilitates the redesign of existing access methods. All other approaches to clustering pages of access methods [HSW88, O N92, BK94] assume a simplified disk model: the disk corresponds to a linearly ordered sequence of pages. Correspondingly to VSAM, multi page requests are only allowed to read a contiguous sequence of the pages from the linear disk. The rest of the paper is organized as follows. In section two, we ....

T. Brinkhoff and H. P. Kriegel. The impact of global clustering on spatial database systems. In Proc. of the Conf. on Very Large Databases (VLDB), 1994.

....to true, the object is added to the query result as well, otherwise we have a false drop. candidate set hits Query query result filter step refinement step Spatial Index load spatial extent extent test on spatial false drops Figure 2: Multi Step Spatial Query Processing Based on Brinkhoff et al. 1994) Another way of obtaining simple index entries is to represent the shape of each data object as the geometric union of simpler shapes (such a convex polygons with a bounded number of vertices) This approach is called decomposition. We have mentioned the term efficiency several times so far ....

.... Figure 5: Intersection Query Figure 6: Enclosure Query Figure 7: Containment Query Figure 8: Adjacency Query As for the spatial predicate , a brief survey of the literature (Orenstein 1986; Becker 1992; Rotem 1991; Gunther 1993; Brinkhoff, Kriegel, and Seeger 1993; Gaede and Riekert 1994; Brinkhoff 1994; Lo and Ravishankar 1994; Aref and Samet 1994; Papadias, Theodoridis, Sellis, and Egenhofer 1995) yields a wide variety of possibilities, including ffl intersects( Delta) ffl contains( Delta) ffl is enclosed by( Delta) ffl distance( Delta) Thetaq, with Theta 2 f= g and q 2 E 1 ffl ....

[Article contains additional citation context not shown here]

Brinkhoff, T. and H.-P. Kriegel (1994). The impact of global clustering on spatial database systems. In Proc. 20th Int. Conf. on Very Large Data Bases, pp. 168-- 179.

....mismatches leads to additional challenges. 2. 2 Related work Important considerations in the design and implementation of image database systems supporting queries by image content are image feature extraction[7, 10, 13, 15, 17] image content representation and organisation of stored information[42, 43], CHAPTER 2. PROBLEM FORMULATION AND CONTRIBUTIONS 10 searching and retrieving strategies[6, 25, 40, 41] and user interface design. Addressing such issues has become the object of intensive research activities in many areas of computer science over the past few years. Advances mainly in the areas ....

....global reorganisation of all objects in the database is not reasonable in a dynamic environment where insertion and deletion operations are intermixed with queries, global clustering is one of the most challenging problems for spatial database systems today. In the last few years, many approaches [42] (e.g. hashing, grid based, B tree, R tree, and R tree) have been tried for a dynamic organisation of spatial objects, which support global clustering. A performance evaluation of some methods can be found in [43] All these techniques combine global clustering with the use of a spatial access ....

T. Brinkhoff, and H. Kriegel, "The impact of global clustering on spatial database systems", Proc. of the 20th VLDB conference, pp. 168-179, 1994. BIBLIOGRAPHY 117

....can also be regarded as a clustering problem. These facility location (or clustering) problems arise in many areas, including operations research, shape analysis [96, 146, 173] data compression and vector quantization [137] information retrieval [58, 59] drug design [81] and data mining [16, 33, 176]. If p is considered as part of the input, most facility location problems are NP Hard, even in the plane or even when only an approximate solution is being sought (provided that is a sufficiently small constant) 80, 93, 126, 136, 149, 150] Although many of these problems can be solved in ....

T. Brinkhoff and H.-P. Kriegel, The impact of global clusterings on spatial database systems, Proc. of the International Conf. on Very Large Databases, 1994, pp. 168--179.

.... of page faults is reduced to up to 55 , and the running time for clustering and redistributing the data into disk pages is amortized if the application is run a small number of times on the database (between 2 and 12 times) Another approach to improving the disk layout of the data is taken in [6]. Here, clustering relies heavily on the spatial access method used in the database, which is usually an R tree. The objects are approximated by their minimum bounding rectangle (MBR) and a tree is constructed on these MBRs. The information of each node in the tree is stored in exactly one ....

T. Brinkhoff and H.-P. Kriegel, The impact of global clusterings on spatial database systems, Proceedings of the International Conference on Very Large Databases, Morgan Kauffman, September 1994. 17

....the predicate. If the predicate evaluates to true, the object is added to the query result as well, otherwise we have a false hit. Spatial Index candidate set load object geometry test on exact geometry query result Query false hits hits Figure 2: Multi Step Spatial Query Processing (see also (Brinkhoff et al. 1994)) As noted above, in contrast to relational databases there exists neither a standard spatial algebra nor a standard spatial query language. The set of operators strongly depends on the given application domain, although some operators (such as intersection) are generally more common than others. ....

....manner by viewing the tuples r 2 R and s 2 S as (spatial) objects and the relations R and S as sets of objects or class extents. As for the spatial predicate , a brief survey of the literature (Orenstein 1986; Becker 1992; Rotem 1991; Gunther 1993; Brinkhoff, Kriegel, and Seeger 1993; Brinkhoff 1994; Lo and Ravishankar 1994; Aref and Samet 1994) yields a wide variety of possibilities, including ffl intersects(r ; s) ffl contains(r ; s) ffl is enclosed by(r ; s) ffl distance(r ; s) Thetaq, with Theta 2 f= g and q 2 E 1 ffl northwest(r ; s) ffl adjacent(r ; s) A closer ....

[Article contains additional citation context not shown here]

Brinkhoff, T. and H.-P. Kriegel (1994). The impact of global clustering on spatial database systems. In Proc. 20th Int. Conf. on Very Large Data Bases, pp. 168-- 179.

....measure of similarity is Euclidean distance, although other derived geo referenced distances are possible. Thus, similarity measurement between observations is relatively well defined for geo referenced data. This allows clustering (or cluster analysis) to be applied for knowledge extraction [2, 7, 8, 17, 24]. Although clustering reveals proximity associations, the partitioning of observations into clusters remains a delicate issue. The idea behind the use of clustering of spatially referenced data is that it provides a means of generalization of the spatial component of the data associated with a ....

T. Brinkhoff and H.P. Kriegel. The impact of global clustering on spatial database systems. In J. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th Conference on Very Large Data Bases (VLDB), pages 168--179, San Francisco, CA, 1994. Santiago, Chile, Morgan Kauffman Publishers.

....of multidimensional range queries, Hutflesz et al. [HSW88] have proposed a multidimensional access method that exploits multi page requests. Cheng et al. [CHH 91] have proposed a new join method, called Hybrid join, which uses multi page requests for efficient data access. Brinkhoff and Kriegel [BK94] applied multi page requests to processing spatial joins. In contrast to these approaches, Seeger et al. [SLM93] studied the general problem of reading a set of disk pages without considering a special operation of the database system. However, their results were derived under the assumption of ....

T. Brinkhoff and H. P. Kriegel. The impact of global clustering on spatial database systems. In Proc. of the Conf. on Very Large Databases (VLDB), 1994.

....can also be regarded as a clustering problem. These facility location (or clustering) problems arise in many areas, including operations research, shape analysis [143, 209, 249] data compression and vector quantization [198] information retrieval [81, 82] drug design [120] and data mining [28, 49, 253]. A useful extension of the facility location problem, which has been widely studied, is the capacitated facility location problem, in which we have an additional constraint that the size of each cluster should be at most c for some parameter c n=p. If p is considered as part of the input, most ....

T. Brinkhoff and H.-P. Kriegel, The impact of global clusterings on spatial database systems, Proc. 20th Intl. Conf. on Very Large Databases, 1994.

....(LRU) policy for managing the cache. We note that, while the system buffer is page centered, the application cache is object centered and so has a much finer granularity. Clustering The organization of spatial descriptions on disk known as clustering has been considered in the literature (Brinkhoff and Kriegel 1994). Essentially, clustering attempts to ensure that objects which are close in native space will be close on disk. Clustering in this case inherently assumes that a linear ordering of objects is applied. The linear keys of the z ordering techniques is one suitable strategy. It is also plausible ....

Brinkhoff, T. and H.-P. Kriegel (1994). The impact of global clustering on spatial database systems. In Proc. 20th Int. Conf. on Very Large Data Bases, pp. 168--179.

....the predicate evaluates to true, the object is added to the query result, otherwise we have a false drop. candidate set hits Query query result filter step refinement step Spatial Index load spatial extent extent test on spatial false drops Figure 2: Multi Step Spatial Query Processing Following (Brinkhoff et al. 1994) Another way of obtaining simple index entries is to represent the shape of each data object as the geometric union of simpler shapes (such a convex polygons with a bounded number of vertices) This approach is called decomposition. We have mentioned the term efficiency several times so far ....

....) 2 R Theta S where (o:G; o 0 :G) evaluates to true. R 1 S = f(o; o 0 )jo 2 R o 0 2 S (o:G; o 0 :G)g As for the spatial predicate , a brief survey of the literature (Orenstein 1986; Becker 1992; Rotem 1991; Gunther 1993; Brinkhoff, Kriegel, and Seeger 1993; Gaede and Riekert 1994; Brinkhoff 1994; Lo and Ravishankar 1994; Aref and Samet 1994; Papadias, Theodoridis, Sellis, and Egenhofer 1995) yields a wide variety of possibilities, including ffl intersects( Delta) ffl contains( Delta) ffl is enclosed by( Delta) ffl distance( Delta) Thetaq, with Theta 2 f= g and q 2 E 1 ffl ....

[Article contains additional citation context not shown here]

Brinkhoff, T. and H.-P. Kriegel (1994). The impact of global clustering on spatial database systems. In Proc. 20th Int. Conf. on Very Large Data Bases, pp. 168-- 179.

....structure greatly accelerates the join process as there is a one to one mapping between internal nodes in the two maps. The application of global clustering (i.e. the association of spatially adjacent spatial objects with physically consecutive disk pages) to a modified R tree was studied in [Brin94b]. Modified R trees (R trees without forced feature reinsertion) with global clustering were found to be more Proc. of the 21st Intl. Conf. on Very Large Data Bases, Zurich, Sept. 1995, pp. 606 618 2 expensive in terms of cpu construction costs and data storage requirements than the ....

T. Brinkhoff and H. P. Kriegel. The impact of global clustering on spatial database systems. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 168-- 179, Santiago, Chile, September 1994.

....space the most obvious measure of similarity is Euclidean distance, although other derived distances are possible. Thus, similarity measurement between gre referenced database entities is relatively well defined. Clustering, or cluster analysis, has a direct interpretation for knowledge extraction [2, 6, 9, 13, 16]. A variety of clustering formulations exist. A suitable approach for data mining applications is to use a medoid based optimization formulation [11, 13, 12, 7] This is due to its robust behavior with respect to outliers and because numerous heuristics find near optimal partitions. The partition ....

T. Brinkhoff and H.P. Kriegel. The impact of global clustering on spatial database systems. In J. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th Conference on Very Large Data Bases (VLDB), pages 168--179, San Francisco, CA, 1994. Santiago, Chile, Morgan Kaufmann Publishers.

.... we investigated the other steps for a multi step processing of spatial joins: the MBR join was examined in [BKS 93a] the test of the exact geometry of the objects and some other aspects of approximations in [BKSS 94] and the transfer of the objects from secondary storage into main memory in [BK 94] So far, we assumed a conventional computer architecture. However, since the fast execution of spatial joins is extremely important, another task is to consider CPU and I O parallelism in future work. ....

Brinkhoff T., Kriegel H.-P.: `The Impact of Global Clustering on Spatial Database Systems ', Proc. 20th Int. Conf. on Very Large Data Bases, Santiago de Chile, Sept. 1994.

No context found.

T. Brinkhoff and H.-P. Kriegel. The impact of global clustering on spatial database systems. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), J. Bocca, M. Jarke, and C. Zaniolo, eds., pages 168--179, Santiago, Chile, September 1994.

No context found.

T. Brinkhoff and H. P. Kriegel. The impact of global clustering on spatial database systems. In J. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th International Conferenceon Very Large Data Bases, pages 168--179, Santiago, Chile, September 1994.

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