• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Efficient Searching with Linear Constraints (Extended Abstract)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.dis.uniroma1.it]
  • [www.cs.duke.edu]
  • [compgeom.cs.uiuc.edu]
  • [www.cs.duke.edu]
  • [http.cs.berkeley.edu]
  • [www.cs.duke.edu]
  • [compgeom.cs.uiuc.edu]
  • [http.cs.berkeley.edu]
  • [compgeom.cs.uiuc.edu]
  • [http.cs.berkeley.edu]
  • [compgeom.cs.uiuc.edu]
  • [www.uiuc.edu]
  • [http.cs.berkeley.edu]
  • [compgeom.cs.uiuc.edu]
  • [www.cs.duke.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Pankaj K. Agarwal , Lars Arge , Jeff Erickson , Paolo G. Franciosa , Jeffrey Scott Vitter
Citations:56 - 16 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Agarwal_efficientsearching,
    author = {Pankaj K. Agarwal and Lars Arge and Jeff Erickson and Paolo G. Franciosa and Jeffrey Scott Vitter},
    title = {Efficient Searching with Linear Constraints (Extended Abstract)},
    year = {}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

) Pankaj K. Agarwal Lars Arge y Jeff Erickson z Paolo G. Franciosa x Jeffrey Scott Vitter -- Abstract We show how to preprocess a set S of points in R d to get an external memory data structure that efficiently supports linear-constraint queries. Each query is in the form of a linear constraint a \Delta x b; the data structure must report all the points of S that satisfy the query. Our goal is to minimize the number of disk blocks required to store the data structure and the number of disk accesses (I/Os) required to answer a query. For d = 2, we present the first near-linear size data structures that can answer linear-constraint queries using an optimal number of I/Os. We also present a linear-size data structure that can answer queries efficiently in the worst case. We combine these two approaches to obtain tradeoffs between space and query time. Finally, we show that some of our techniques extend to higher dimensions d. Center for Geometric Computing, Computer...

Citations

1969 R-trees: a dynamic index structure for spatial searching - Guttman - 1984
1567 Randomized Algorithms - Motwani, Raghavan - 1995
1084 The Design and Analysis of Spatial Data Structures - Samet - 1990
855 The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles - Beckmann, Kriegel, et al. - 1990
643 Algorithms in combinatorial geometry - Edelsbrunner - 1987
501 The Ubiquitous B-Tree - Comer - 1979
362 The grid file: An adaptable, symmetric multikey file structure - Nievergelt, Hinterberger, et al. - 1984
357 Applications of random sampling in computational geometry - Shor - 1989
343 The k-d-b-tree: a search structure for large multidimensional dynamic indexes - Robinson - 1981
287 The R + -tree: a dynamic index for multi-dimensional objects - Sellis, Roussopoulos, et al. - 1987
240 Epsilon-nets and simplex range queries - Haussler, Welzl - 1987
229 Organization and Maintenance of Large Ordered Indexes - Bayer, McCreight - 1972
222 Erickson Geometric range searching and its relatives - Agarwal, J - 1998
177 A cost model for nearest neighbor search in high-dimensional data space - Berchtold, Böhm, et al. - 1997
170 The Hilbert R-tree: An improved R-tree using fractals - Kamel, Faloustos - 1992
167 The hb-tree: a multiattribute indexing method with good guaranteed performance - Lomet, Salzberg - 1990
160 An Introduction to Spatial Database Systems - Güting - 1994
141 Leeuwen. Maintenance of configurations in the plane - Overmars, van - 1981
117 External-memory computational geometry - Goodrich, Tsay, et al. - 1993
110 Indexing for data models with constraints and classes (extended abstract - KANELLAKIS, RAMASWAMY, et al. - 1993
98 Filtering search: a new approach to query-answering - Chazelle - 1986
89 Improved bounds for planar k-sets and related problems - Dey - 1998
82 The power of geometric duality - Chazelle, Guibas, et al. - 1983
78 Optimal dynamic interval management in external memory - Arge, Vitter - 1996
74 External-memory algorithms for processing line segments in geographic information systems - Arge, Vengroff, et al.
73 The P-range Tree: A New Data Structure for Range Searching - Subramanian, Ramaswamy - 1995
71 Efficient partition trees - Matoušek - 1992
70 On two-dimensional indexability and optimal range search indexing - Arge, Samoladas, et al. - 1999
65 Reporting points in halfspaces - MATOUSEK - 1991
50 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
46 Geometric range searching - Matoušek - 1994
45 A qualitative comparison study of data structures for large line segment databases - Hoel, Samet - 1992
42 Polygon retrieval - Willard - 1982
42 Multi dimensional searching and computational geometry, volume 3 of Data structures and algorithms - Mehlhorn - 1984
42 Algorithms and data structures for external memory - Vitter - 2006
41 Constructing levels in arrangements and higher order Voronoi diagrams - Agarwal, Berg, et al.
40 On levels in arrangements of lines, segments, planes, and triangles - Agarwal, Aronov, et al. - 1998
40 Spatial data structures: Concepts and design choices - Nievergelt, Widmayer - 2000
38 Point sets with many k-sets - Tóth
38 The R*-tree: An e cient and robust access method for points and rectangles - Beckmann, Kriegel, et al. - 1990
35 Constructing belts in two-dimensional arrangements with applications - Edelsbrunner, Welzl - 1986
32 Halfspace range search: an algorithmic application of k-sets - Chazelle, Preparata - 1985
30 Processing queries by linear constraints - Goldstein, Ramakrishnan, et al. - 1997
29 Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions - Chan
28 Efficient 3-D range searching in external memory - Vengroff, Vitter - 1996
25 Randomized externalmemory algorithms for some geometric problems - Crauser, Ferragina, et al. - 2001
22 The grid ®le: An adaptable symmetric multikey ®le structure - Nievergelt, Hinterberger, et al. - 1984
21 Intersection queries for curved objects - AGARWAL, KREVALD, et al. - 1991
17 Efficient partition trees, Discrete Comput - Matoušek - 1992
16 New upper bounds for neighbor searching - Chazelle - 1986
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University