Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo G. Franciosa, Jeffrey Scott Vitter  Home/Search
Context Related
| uiuc.edu/~jeffe/pubs/pdf/lincon.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~jeffe/pubs/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how to preprocess a set S of points in R^d into an external memory.... (Update)
Context of citations to this paper: More
.... to GADT data can be achieved by translating GADT queries into queries by linear constraints (QBLC) Goldstein et al. GRSY97] and Agarwal et al. AAE98] have recently shown that QBLC can be processed efficiently using standard indexing structures such as the R tree. be a GADT...
Cited by: More
Indexing Constraint Databases by Using a Dual Representation - Bertino Catania.. (1999) (Correct)
Indexing Mobile Objects Using Dual Transformations - Kollios, Papadopoulos.. (Correct)
Indexing Problems in Spatiotemporal Databases - Kollios (2000) (Correct)
Similar documents (at the sentence level):
59.5%: Efficient Searching with Linear Constraints - Agarwal, Arge, Erickson.. (1998) (Correct)
20.7%: Efficient Searching with Linear Constraints (Extended .. - Agarwal, Arge.. (Correct)
Active bibliography (related documents): More All
0.7: Geometric Range Searching and Its Relatives - Agarwal, Erickson (1999) (Correct)
0.6: External Memory Data Structures - Arge (2000) (Correct)
0.5: External Memory Computational Geometry State of the Art - Ziegelmann (1999) (Correct)
Similar documents based on text: More All
0.4: Cache-Oblivious Data Structures for Orthogonal Range.. - Agarwal, Arge.. (Correct)
0.4: Indexing Moving Points - Agarwal, Arge, Erickson (2000) (Correct)
0.4: CRB-Tree: An Efficient Indexing Scheme for - Range Aggregate Queries (Correct)
Related documents from co-citation: More All
15: Optimal dynamic interval management in external memory - Arge, Vitter - 1996
13: Data structures for mobile data - Basch, Guibas et al.
13: Geometric range searching and its relatives - Agarwal, Erickson - 1999
BibTeX entry: (Update)
P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. Vitter. Efficient searching with linear constraints. Manuscript, 1997. http://citeseer.ist.psu.edu/article/agarwal97efficient.html More
@inproceedings{ agarwal98efficient,
author = "Pankaj K. Agarwal and Lars Arge and Jeff Erickson and Paolo G. Franciosa and Jeffry Scott Vitter",
title = "Efficient Searching with Linear Constraints",
pages = "169--178",
year = "1998",
url = "citeseer.ist.psu.edu/article/agarwal97efficient.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
233 tree: A dynamic index for multidimensional objects - Sellis, Roussopoulos et al. - 1987
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
133 Geometric range searching and its relatives - Agarwal, Erickson - 1998
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson, K-D-B - 1984
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1996
91 Epsilon-nets and simplex range queries (context) - Haussler, Welzl - 1987
88 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
83 tree using fractals (context) - Kamel, Faloutsos et al. - 1994
69 Filtering search: a new approach to query-answering (context) - Chazelle - 1986
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996
60 Multi-dimensional Searching and Computational Geometry (context) - Mehlhorn - 1984
60 The power of geometric duality (context) - Chazelle, Guibas et al. - 1985
53 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
50 External-memory algorithms for processing line segments in G.. - Arge, Vengro et al. - 1995
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy et al. - 1995
42 Improved bounds on planar k-sets and related problems (context) - Dey - 1998
42 tree: An ecient and robust access method for points and rect.. (context) - Beckmann, Kriegel et al. - 1990
37 Constructing belts in two-dimensional arrangements with appl.. (context) - Edelsbrunner, Welzl - 1986
30 On levels in arrangements of lines (context) - Agarwal, Aronov et al. - 1998
30 A qualitative comparison study of data structures for large .. - Hoel, Samet - 1992
27 Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 1997
22 range searching in external memory (context) - Vengro, Vitter et al. - 1996
22 Halfspace range search: An algorithmic application of k-sets (context) - Chazelle, Preparata - 1986
21 Polygon retrieval (context) - Willard - 1982
21 the decidability of semi-linearity for semi-algebraic sets a.. (context) - Dumortier, Gyssens et al. - 1997
20 Maintenance of congurations in the plane (context) - Overmars, van Leeuwen - 1981
19 Processing queries by linear constraints - Goldstein, Ramakrishnan et al. - 1997
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1989
18 Ecient partition trees (context) - Matou - 1992
16 Intersection queries in curved objects (context) - Agarwal, van Kreveld et al. - 1993
15 New upper bounds for neighbor searching (context) - Chazelle, Cole et al. - 1986
14 Randomized external-memory algorithms for some geometric pro.. - Crauser, ferragina et al. - 1998
14 Geometric range searching - Matou - 1994
13 Improving the performance of multi-dimensional access struct.. (context) - Henrich - 1996
13 An introduction to spatial database systems (context) - uting - 1994
13 Reporting points in halfspaces (context) - Matou - 1992
8 Foundations of Computer Science (context) - Chan, sampling et al. - 1998
8 sets and fast halfplane search on paged memory (context) - Franciosa, Talamo et al. - 1994
7 tree: An index structure for higher dimensional data (context) - Berchtold, Keim et al. - 1996
6 Time optimal halfplane search on external memory (context) - Franciosa, Talamo - 1997
5 symmetric multikey le structure (context) - Nievergelt, Hinterberger et al. - 1984
3 Optimal planar range searching in external memory (context) - Arge, Vitter - 1998
3 tree: a multi-attribute index supporting concurrency - Evangelidis, Lomet et al. - 1997
2 Ecient searching with linear constraints - Agarwal, Arge et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://compgeom.cs.uiuc.edu/~jeffe/pubs/pubs.html): More
Sowing Games - Erickson (1996) (Correct)
New Lower Bounds for Halfspace Emptiness - Erickson (1996) (Correct)
New Toads and Frogs Results - Erickson (1996) (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