(Enter summary)
Abstract: We present a new approach to designing data
structures for the important problem of externalmemory
range searching in two and three dimensions.
We construct data structures for answering
range queries in O((log log log B N) log B N +K=B)
I/O operations, where N is the number of points
in the data structure, B is the I/O block size, and
K is the number of points in the answer to the
query. We base our data structures on the novel
concept of B-approximate boundaries, which are
manifolds that... (Update)
Similar documents (at the sentence level):
78.2%: Efficient 3-D Range Searching in External Memory - Vengroff, Vitter (1995)
(Correct)
Active bibliography (related documents): More All
0.3: External-Memory Algorithms with Applications in Geographic.. - Arge (1997)
(Correct)
0.2: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995)
(Correct)
0.1: Extending Rectangle Join Algorithms for Rectilinear Polygons - Zhu, Su, Ibarra (2000)
(Correct)
Similar documents based on text: More All
0.1: Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993)
(Correct)
0.1: Indexing for Data Models with Classes and Constraints - Ramaswamy (1994)
(Correct)
0.1: Report of the Working Group on Storage I/O for Large-Scale .. - Gibson, Vitter, Wilkes (1996)
(Correct)
BibTeX entry: (Update)
@inproceedings{ vengroff96efficient,
author = "Darren Erik Vengroff and Jeffrey Scott Vitter",
title = "Efficient {3-D} range searching in external memory",
pages = "192--201",
year = "1996",
url = "citeseer.ist.psu.edu/126357.html" }
Citations (may not include all citations):
831
Computer Graphics: Principles and Practice (context) - Foley, van Dam et al. - 1990
229
Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
129
Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989 ACM DBLP
110
Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
103
Indexing for data models with constraints and classes
- Kanellakis, Ramaswamy et al. - 1993 ACM DBLP
53
Path caching: a technique for optimal external searching
- Ramaswamy, Subramanian - 1994 ACM DBLP
48
range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
21
Exploiting extensible DBMS in integrated geographic informat.. (context) - Haas, Cody - 1991 ACM DBLP
20
OODB indexing by class division
- Ramaswamy, Kanellakis - 1995
17
An intellegent information fusion system for handling the ar.. (context) - Cromp - 1993
6
Geographic information systems (context) - van Kreveld - 1995 ACM DBLP
Documents on the same site (http://www.cs.duke.edu/education/courses/cps296.1/spring99/lectures.html):
Minimizing the Input/Output Bottleneck - Nodine (1992)
(Correct)
On Showing Lower Bounds for External-Memory Computational.. - Arge, Miltersen
(Correct)
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