S. Subramanian, et al.  Home/Search
Context Related
| belllabs.com/user/sridh...soda95.ps.gz 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 Problem Downloading? From: belllabs.com/user/sridhar/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Sairam Subramanian Sridhar Ramaswamy y Abstract External 2-dimensional range searching is a fundamental problem with many applications in relational, object-oriented, spatial, and temporal databases. For example, interval intersection can be reduced to 2-sided, 2-dimensional searching and indexing class hierarchies of objects to 3-sided, 2-dimensional searching. In this paper we introduce a new data structure called the p-range tree for performing 2dimensional range searching in... (Update)
Context of citations to this paper: More
...the input intervals that intersect a query interval. 2) Delete or insert intervals from the interval collection. Previous approaches [1,12,14,17] are fairly complex and rely mostly on reducing the interval intersection problem to special cases of two dimensional range...
...before the next query is processed. This problem has been extensively studied both in main memory [5,7,8,17] and secondary storage [4,14,16,19,25]. In particular, 4] recently resolved the open problem of whether it is possible to build a dynamic, worst case optimal data...
Cited by: More
I/O-Efficient Join Algorithms for Temporal, Spatial, and.. - Ramaswamy, Suel (1996) (Correct)
Efficient Indexing for Constraint and Temporal Databases - Ramaswamy (1997) (Correct)
Active bibliography (related documents): More All
0.6: Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
0.6: Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (Correct)
0.5: Scanline Algorithms on a Grid - Karlsson, Overmars (1986) (Correct)
Similar documents based on text: More All
1.0: On Two-Dimensional Indexability and Optimal Range Search.. - Arge, al. (1999) (Correct)
0.8: Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (Correct)
0.8: Maintaining range trees in secondary memory Part I.. - Overmars, Smid, de.. (1987) (Correct)
Related documents from co-citation: More All
2: Constraint Query Languages - Kanellakis, Kuper et al. - 1990
2: Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993
2: Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
BibTeX entry: (Update)
S. Subramanian & S. Ramaswamy, "The P-range tree: A new data structure for range searching in secondary memory," Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (1995). http://citeseer.ist.psu.edu/256012.html More
@inproceedings{ subramanian95prange,
author = "Subramanian and Ramaswamy",
title = "The {P}-range Tree: {A} New Data Structure for Range Searching in Secondary Memory",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1995",
url = "citeseer.ist.psu.edu/256012.html" }
Citations (may not include all citations):666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
315 Constraint Query Languages - Kanellakis, Kuper et al. - 1990 ACM DBLP
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
197 A Relational Model for Large Shared Data Banks (context) - Codd - 1970
136 Fast Algorithms for Finding Nearest Common Ancestors (context) - Harel, Tarjan - 1984 ACM DBLP
134 Spatial Query Processing in an Object-Oriented Database Syst.. (context) - Orenstein - 1986 ACM DBLP
111 Readings in Object-Oriented Database Systems (context) - Zdonik, Maier - 1990 ACM
109 Multidimensional divide and conquer (context) - Bentley - 1980
106 Priority Search Trees (context) - McCreight - 1985 DBLP
103 Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy et al. - 1993 ACM DBLP
95 On Finding Lowest Common Ancestors: Simplification and Paral.. (context) - Schieber, Vishkin - 1988
88 The hB-Tree: A Multiattribute Indexing Method with Good Guar.. (context) - Lomet, Salzberg - 1990
85 Object-Oriented Concepts (context) - Kim, Lochovsky - 1989
84 The Grid File: An Adaptable, Symmetric Multikey File Structu.. (context) - Nievergelt, Hinterberger et al. - 1984 ACM DBLP
69 Filtering Search: A New Approach to Query-Answering (context) - Chazelle - 1986 DBLP
68 The Ubiquitous B-tree (context) - Comer - 1979 DBLP
63 Dynamic Algorithms in Computational Geometry - Chiang, Tamassia - 1992 ACM
63 The R + -Tree: A Dynamic Index for Multi-Dimensional Objects - Sellis, Roussopoulos et al. - 1987
59 A Functional Approach to Data Structures and its use in Mult.. (context) - Chazelle - 1988 DBLP
53 Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian - 1994
47 The K-D-B Tree: A Search Structure for Large Multidimensiona.. (context) - Robinson - 1984
38 Adding Range Restriction Capability to Dynamic Data Structur.. (context) - Willard, Leuker - 1985 ACM DBLP
37 Algorithms for Klee's Rectangle Problems (context) - Bentley - 1977
35 The Design of the Cell Tree: An Object-Oriented Index Struct.. (context) - Gunther - 1989 DBLP
31 Organization of Large Ordered Indexes (context) - Bayer, McCreight - 1972
20 Priority Search Trees in Secondary Memory (context) - Icking, Klein et al. - 1988 ACM
15 Efficient Data Structures for Range Searching on a Grid - Overmars - 1987 ACM DBLP
14 Dynamic Graph Algorithms and Data Structures (context) - Poutr'e
13 A new Approach to Rectangle Intersections, Part (context) - Edelsbrunner - 1983
13 A new Approach to Rectangle Intersections, Part II (context) - Edelsbrunner - 1983
4 Lower Bounds for Orthogonal Range Searching: I. The Reportin.. (context) - Chazelle - 1990 ACM DBLP
3 A Class of Algorithms that Require Nonlinear Time to Maintai.. (context) - Tarjan - 1979
2 Normalized Divide and Conquer (context) - Karlsson, Overmars - 1986
Documents on the same site (http://www.bell-labs.com/user/sridhar/): More
OODB Indexing by Class-Division - Ramaswamy, Kanellakis (1995) (Correct)
Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (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