J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, pages 119-133, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... [22] and class hierarchies in object oriented databases [22] In spatial databases such as geographic information systems (GIS) range searching obviously plays a pivotal role, and a large number of external data structures (indexing schemes) for answering such queries have been developed (see [20, 31, 39, 45] and references therein) The need for storing and processing continuously moving data arises in a wide range of applications, including digital battlefields, air traffic control, and mobile communication systems [5, 11] Most existing database systems assume that the data is constant unless it ....

J. S. Vitter, Online data structures in external memory, Proc. 26th Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 119--133, 1999.

....to find Theta(B) points in the slab corresponding to v i satisfying the query. The idea of charging some of the query cost to the output size is often called filtering [51] and the idea of using a static structure on O(B 2 ) elements in each node has been called the bootstrapping paradigm [151, 152]. Finally, the ideas of weight balancing and global rebuilding were used to obtain worst case efficient update bounds. All these ideas have been used in the development of other efficient external data structures. 5 General planar range searching After discussing 3 sided planar range searching ....

J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, pages 119--133, 1999.

....memory computation time, is often the bottleneck in a computation when working with datasets larger than the available main memory. Recently, external geometric data structures have received considerable attention because massive geometric datasets arise naturally in many applications (see [19, 5] and references therein) The need for storing and processing continuously moving data arises in a wide range of applications, including air traffic control, digital battlefields, and mobile communication systems. Most of the existing database systems, which assume that the data is constant unless ....

J. S. Vitter, Online data structures in external memory, Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 1999, pp. 119--133.

....memory computation time, is often the bottleneck in a computation when working with datasets larger than the available main memory. Recently, external geometric data structures have received considerable attention because massive geometric datasets arise naturally in many applications (see [19, 5] and references therein) The need for storing and processing continuously moving data arises in a wide range of applications, including air tra#c control, digital battlefields, and mobile communication systems. Most of the existing database systems, which assume that the data is constant unless ....

J. S. Vitter, Online data structures in external memory, Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 1999, pp. 119--133.

.... and class hierarchies in object oriented databases [18] In spatial databases such as geographic information systems (GIS) range searching obviously plays a pivotal role, and a large number of external data structures (indexing schemes) for answering such queries have been developed (see [17, 33, 6] and references therein) The need for storing and processing continuously moving data arises in a wide range of applications, including air traffic control, digital battlefields, and mobile communication systems [10, 1] Most of the existing database systems, which assume that the data is ....

J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, pages 119--133, 1999.

.... [17] and class hierarchies in object oriented databases [17] In spatial databases such as geographic information systems (GIS) range searching obviously plays a pivotal role, and a large number of external data structures (indexing schemes) for answering such queries have been developed (see [15, 22, 35] and references therein) The need for storing and processing continuously moving data arises in a wide range of applications, including digital battlefields, air traffic control, and mobile communication systems [10, 4] Most of the existing database systems, which assume that the data is ....

J. S. Vitter, Online data structures in external memory, Proc. 26th Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 119--133, 1999.

....string processing [25, 26, 11, 20] Also I O performance can often be improved if many disks can efficiently be used in parallel and the use of parallel disks has received a lot of theoretical attention. Recent surveys of theoretical results in the area of I O efficient algorithms can be found in [10, 9, 42, 43] TPIE, a transparent parallel I O environment, is designed to bridge the gap between the theory and practice of parallel I O systems. It is designed to doo the following: ffl Abstract away the details of how I O is performed so that programmers need only deal with a simple high level interface. ....

J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, 1999.

....[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 ....

J. S. Vitter. Online data structures in external memory.InProc. 26th Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, pages 119--133, 1999.

....[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 ....

J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, 1999. 12

....2 B) O(log B N T=B) O(log B N) amortized Our Result [11] 8] O(N=B) O(log B N T=B) O(log B N) Figure 1: Comparison of our data structure for stabbing queries with other data structures. 2 and higher dimensional range searching problem, as well as for several other related problems. See [6, 7, 40] for surveys. 1.2 Overview of our results The main contribution of this paper is an optimal external memory data structure for the stabbing query problem. As mentioned, our data structure gives an optimal solution to the interval management problem, and thus it settles an open problem ....

J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, pages 119-133, 1999.

....structures (or indexes) have been developed, reflecting the many different requirements put on such structures; small (often linear) size, efficient query of update bounds, capabilities of answering a wide variety of queries (mainly range and proximity queries) and simplicity. See recent surveys [19, 3, 43]. The proposed data structures can roughly be divided into two classes, namely practically used (and often heuristics based) structures, for which worst case query performance guarantees can only be given (if at all) in the static case, and theoretically optimal dynamic structures, which have yet ....

J. S. Vitter. Online data structures in external memory. In Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, pages 119--133, 1999. 15

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