| L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J.S. Vitter: "A Unified Approach for Indexed and Non-Indexed Spatial Joins", Proceedings 8th EDBT Conference, pp.413-429, Konstanz, Germany, 2000. |
....in the other relation. When an R tree is used as an index, a temporal join can be considered as a special case of a spatial join. 4] presents a depth first while [10] proposes a breath first synchronized R tree join algorithm. 8] proposed join algorithms based on Generalization Trees. [2] developed a plane sweeping algorithm that unifies the index based and non index based approaches. The plane sweeping phase of the algorithm needs to read records from the joining relations in nondecreasing order regarding one dimension (and then the stream processing of [15] can be applied) For ....
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J. Vitter, "A Unified Approach For Indexed and Non-Indexed Spatial Joins", Proc. of EDBT, 2000.
....found in [5] R tree. The R tree and its variants are widely used indexing data structures for spatial data. The TPIE implementation uses the insertion heuristics proposed by Beckmann et al. 10] their variant is called the R tree) and various bulk loading procedures. More details are given in [6, 7]. Logarithmic method. The logarithmic method [16] is a generic dynamization method. Given a static index with certain properties, it produces a dynamic structure consisting of a set of smaller static indexes of geometrically increasing sizes. We implemented the external memory versions of this ....
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J. S. Vitter. A unified approach for indexed and non-indexed spatial joins. In Proc. Conference on Extending Database Technology, pages 413--429, 1999.
....TPIE. This part of TPIE also contains fundamental data structures such as queues and stacks, algorithms for sorting and matrix operations, as well as a few more specialized geometric algorithms. It has been used in I O efficient implementations of several scientific computation [150] spatial join [24, 25, 23], and terrain flow [27, 19] algorithms. Since most external data structures cannot efficiently be implemented in a stream based framework, the second part of the TPIE project adds kernel support for a block oriented programming style. Like in LEDA SM, the external memory is viewed as a collection ....
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J. S. Vitter. A unified approach for indexed and non-indexed spatial joins. In Proc. Conference on Extending Database Technology, 1999.
....in such a graph will most likely result in unpredictable access patterns and random I O operations. Disk technologies and operating systems, however, support sequential I O operations much more efficiently than random I O operations. Experimental results published in the database literature [5, 17] reveal that external memory algorithms can benefit even from relatively small clusters of sequentially stored data. We will showhow to obtain an algorithm for solving the external memory planar point location problem that fulfills this criterion. Previous Results. The problem of internal memory ....
L. Arge, O. Procopiuc, S. Ramaswamy,T.Suel,J.Vahrenhold, and J. Vitter. A unified approach for indexed and non-indexed spatial join. Proc. 7th Intl. Conf. Extending Databases Technology, LNCS 1777, 413--429. 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J.S. Vitter: "A Unified Approach for Indexed and Non-Indexed Spatial Joins", Proceedings 8th EDBT Conference, pp.413-429, Konstanz, Germany, 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J.S. Vitter. A Unified Approach for Indexed and Non-Indexed Spatial Joins. In 7th International Conference on Extending Database Technology, pages 413--429, Konstanz, Germany, March 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J.S. Vitter, "A Unified Approach for Indexed and Non-Indexed Spatial Joins," Proc. EDBT Conf., pp. 413-429, Mar. 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J. Vitter, "A Unified Approach For Indexed and Non-Indexed Spatial Joins", Proc. of EDBT, 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J. Vitter, "A Unified Approach For Indexed and Non-Indexed Spatial Joins", Proc. of EDBT, pp. 413-429, 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J. Vitter, "A Unified Approach For Indexed and Non-Indexed Spatial Joins", Proc. of EDBT, pp. 413-429, 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J. Vitter, "A Unified Approach For Indexed and Non-Indexed Spatial Joins", Proc. of EDBT, pp. 413-429, 2000.
No context found.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J. Vitter, "A Unified Approach For Indexed and Non-Indexed Spatial Joins", Proc. of EDBT, pp. 413-429, 2000.
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