L. Arge. External-memory algorithms with applications in geographic information systems. CS Department, Duke Univeristy, technical report, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....structures were designed for a theoretical RAM model with unlimited memory. It has been observed by many researchers that most of these algorithms perform very badly when used in an external memory setting. This led to the design of algorithms and data structures for external memory [CGG 95, Arg96b, UY91] Various theoretical results have been obtained in the last years starting with classical sorting and searching problems [AV88] Very recently a few researchers also considered practical implementations. One of the first external memory libraries was TPIE [VV95] TPIE consists of several ....

L. Arge. External-memory algorithms with applications in geographic information systems. CS Department, Duke Univeristy, technical report, 1996.

....queue is needed. We propose using an implementation of an external memory priority queue that is based on the buffer tree [3] The basic idea is to perform operations (insertions and deletions) off line in such a way that the amortized complexity of each operation is O( 1 B logM B N B ) [4]. As a result the running time of the algorithm in external memory becomes O( N B logM B N B ) I O s. Note that the above proof works similarly for the case where objects do not move but change only one of their extent dimensions linearly. 4 Performance Evaluation In section 4.1 we ....

L. Arge. External-Memory Algorithms with Applications in Geographic Information Systems. In Algorithmic Foundations of Geographic Information Systems, LNCS 1340, 1997.

....queue is needed. We propose using an implementation of an external memory priority queue that is based on the bu er tree [3] The basic idea is to perform operations (insertions and deletions) o line in 19 such a way that the amortized complexity of each operation is O( 1 B logM B N B ) [4]. As a result the running time of the algorithm in external memory becomes O( N B logM B N B ) I O s. Note that the above proof works similarly for the case where objects do not move but change only one of their extent dimensions linearly. 4 Performance Evaluation In section 4.1 we ....

L. Arge. External-Memory Algorithms with Applications in Geographic Information Systems. In Algorithmic Foundations of Geographic Information Systems, LNCS 1340, 1997.

....they showed that sorting N items in external memory requires Theta( N B log M=B N B )I Os. Subsequently, I O efficient algorithms have been developed for several problem domains, including computational geometry, graph theory, and string processing. Refer to recent surveys for references [3, 4, 32]. The practical merits of the developed algorithms have been explored byanumber of authors [11, 31, 6, 5] 1 For simplicitywe concentrate on the two first measures in this paper. It can be shown that the asymptotic internal memory computation time of our new R tree algorithms is the same as for ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, LNCS 1340, 1997.

....[2] considered sorting and related problems in the I O model and proved that sorting requires O( N=B) log M=B (N=B) O( N=B) log B N ) I Os. Subsequently, I O efficient algorithms and data structures have been developed for numerous problems see recent surveys for a sample of these results [3,4, 28]. Most previous results on point location in external memory have been either static or batched dynamic: Goodrich et al. 18] designed a static data structure using O(N=B) space to store a monotone subdivision so that a query can be answered in optimal O(log B N ) I Os. They also developed a ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. LNCS 1340, Springer Verlag, 1997.

....queue is needed. We propose using an implementation of an external memory priority queue that is based on the buffer tree [3] The basic idea is to perform operations (insertions and deletions) off line in 17 such a way that the amortized complexity of each operation is O( 1 B logM B N B ) [4]. As a result the running time of the algorithm in external memory becomes O( N B logM B N B ) I O s. Note that the above proof works similarly for the case where objects do not move but change only one of their extent attributes linearly. As mentioned earlier it works as an approximation ....

L. Arge. External-Memory Algorithms with Applications in Geographic Information Systems. In Algorithmic Foundations of Geographic Information Systems, LNCS 1340, 1997.

....be thought of as a more restrictive (and more realistic) version of Aggarwal and Vitter s model, their lower bounds apply as well to PDM. Modified versions of PDM that integrate various aspects of parallel computation are developed in [53, 96, 121] Surveys of I O models and algorithms appear in [15, 119]. The same type of bottleneck that occurs between internal memory and external disk storage can also occur at other levels of the memory hierarchy, such as between registers and data cache, between data cache and level 2 cache, between level 2 cache and DRAM, and between disk storage and tertiary ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS, volume 1340 of Lecture Notes in Computer Science. Springer-Verlag, 1997. EXTERNAL MEMORY ALGORITHMS AND DATA STRUCTURES 35

.... ffl Maximal independent sets O(sort(E) 1 Gamma ffl for any fixed ffl 1 Introduction Because classical algorithms frequently do not scale to handle data that exceed main memory limits, recent attention has turned to designing algorithms that process data in external storage (disk and tape) [1, 6, 28]. While some external algorithms (e.g. for sorting [2] closely resemble their RAM analogues, others seem to require different approaches. Graph algorithms for RAMs, in particular, seem poorly suited for direct extension to external memory, because of the lack of locality in graph data. Current ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of Geographic Information Systems, volume 1340 of Lecture Notes in Computer Science. Springer-Verlag, 1997.

....in from multiple processors. 1. 1 Summary of this Paper We present a new algorithm for the filter step called Scalable Sweeping Based Spatial Join (SSSJ) The algorithm uses several techniques for I O efficient computing recently proposed in computational geometry [APR 98, GTVV93, Arg95, AVV98, Arg97] plus the well known internal memory plane sweeping technique (see, e.g. PS85] It achieves theoretically optimal worst case bounds on both internal computation time and I O transfers, while also being efficient on the more wellbehaved data sets common in practice. We present experimental ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340, 1997.

....from multiple processors. 1. 1 Summary of this Paper We present a new algorithm for the filter step called Scalable Sweeping Based Spatial Join (SSSJ) The algorithm uses several techniques for I O efficient computing recently proposed in computational geometry [APR 98, GTVV93, Arg95, AVV98, Arg97] plus the well known internal memory plane sweeping technique (see, e.g. PS85] It achieves theoretically optimal worst case bounds on both internal computation time and I O transfers, while also being efficient on the more wellbehaved data sets common in practice. We present experimental ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340, 1997.

....[2] considered sorting and related problems in the I O model and proved that sorting requires O( N=B) log M=B (N=B) O( N=B) log B N) I Os. Subsequently, I O efficient algorithms and data structures have been developed for numerous problems see recent surveys for a sample of these results [3, 4, 28]. Most previous results on point location in external memory have been either static or batched dynamic: Goodrich et al. 18] designed a static data structure using O(N=B) space to store a monotone subdivision so that a query can be answered in optimal O(log B N) I Os. They also developed a ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340, 1997.

.... algorithms in many problem domains, including sorting and permuting [1, 38] computational geometry [2, 7, 22] string algorithms [6, 19] and graph algorithms [3, 11, 21, 27, 34] There has recently been growing interest in developing I O efficient geometric algorithms with applications in GIS [5, 7, 22]; see also the recent survey by Arge [4] There has also been a lot of work in the database community on I O algorithms for GIS applications [14, 26, 10, 24, 30, 32, 29] For the contour line extraction problem, van Kreveld (see also the recent work of van Kreveld et al. 37] gives an ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, 1997. Lecture Notes in Computer Science (subseries: tutorials).

....is applied to a contour before it is displayed. 1. 3 Previous results In the last few years, considerable attention has been given to the development of I O efficient algorithms in many problem domains, including sorting, graph algorithms, string algorithms, computational geometry, and GIS; see [1, 2, 3, 4, 5, 8, 19, 21, 27] and the references therein. Although the contour line extraction problem has been well studied for terrains stored as raster images (for example, see the Marching Cubes algorithm [18] not much work has been done when terrains are stored as TINs. van Kreveld [23] gives an internal memory ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, 1997.

.... 5, 53, 31, 2, 11, 34, 44, 47, 12, 50, 17, 1] string processing [28, 29, 9] and graph theoretic computation [6, 24, 38, 35] Some encouraging experimental results regarding the practical merits of the developed algorithms have also been obtained [23, 51, 11, 33] Recent surveys can be found in [7, 8]. 1.3 Our Results In this paper, we combine and modify in novel ways several of the previously known techniques for designing efficient algorithms for external memory. In particular we use the distribution sweeping and batch filtering paradigms of [32] and the buffer tree data structure of [5] ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340, 1997.

....and Vitter [1] considered sorting and related problems in the I O model and proved that sorting requires Theta( N B log M=B N B ) I Os. Subsequently, I Oefficient algorithms and data structures have been developed for numerous problems see recent surveys for a sample of these results [2, 3, 26]. All previous results on point location in external memory have been either static or batched dynamic: Goodrich et al. 16] designed a static data structure using O(N=B) space to store a monotone subdivision of size N so that a query can be answered in optimal O(log B N) I Os. They also developed ....

L. Arge. External-memory algorithms with applications in geographic information systems. In Algorithmic Foundations of GIS (M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, eds.). Lecture Notes in Computer Science, 1340, Springer-Verlag, 1997.

....computation time of our new R tree algorithms is the same as for the traditional algorithms. I Os. Subsequently, I O efficient algorithms have been developed for several problem domains, including computational geometry, graph theory, and string processing. Refer to recent surveys for references [3, 4, 32]. The practical merits of the developed algorithms have been explored by a number of authors [11, 31, 6, 5] Much of this work uses the Transparent Parallel I O programming Environment (TPIE) 29, 30, 31] TPIE is a set of C functions and templated classes that allow for simple, efficient, and ....

L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340, 1997.

No context found.

L. Arge. External-memory algorithms with applications in geographic information systems. CS Department, Duke Univeristy, technical report, 1996.

No context found.

L. Arge. External-Memory Algorithms with Applications in Geographic Information Systems. In Algorithmic Foundations of Geographic Information Systems, LNCS 1340, 1997.

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