Lars Arge  Home/Search
Context Related
| duke.edu/~large/Paper...intervalFull.ps 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: duke.edu/~large/index (more) Homepages: L.Arge |
Rate this article:      (best)Comment on this article |
Abstract: We present a space- and I/O-optimal external-memory data structure for answering stabbing queries on a set of dynamically maintained intervals. Our data structure settles an open problem in databases and I/O algorithms by providing the first optimal external-memory solution to the dynamic interval management problem, which is a special case of 2-dimensional range searching and a central problem for object-oriented and temporal databases and for constraint logic programming. Our data structure... (Update)
Cited by: More
Efficient Indexing Methods for Probabilistic.. - Cheng, Xia.. (2004) (Correct)
Indexing Constraint Databases by Using a Dual Representation - Bertino Catania.. (1999) (Correct)
The Paradigm of Relational Indexing: A Survey - Kriegel, Pfeifle, Pötke, Seidl (2003) (Correct)
Similar documents (at the sentence level):
78.6%: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
31.9%: Optimal Dynamic Interval Management in External Memory - Arge, Vitter (1996) (Correct)
5.6%: Optimal External Memory Interval Management - Arge, Vitter (2002) (Correct)
Active bibliography (related documents): More All
0.5: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
0.4: External Memory Data Structures - Arge (2000) (Correct)
0.4: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
Similar documents based on text: More All
0.9: On Two-Dimensional Indexability and Optimal Range Search.. - Arge, al. (1999) (Correct)
0.5: Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (Correct)
0.1: On Showing Lower Bounds for External-Memory Computational.. - Arge, Miltersen (Correct)
Related documents from co-citation: More All
31: Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993
30: Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
28: External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
BibTeX entry: (Update)
L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proc. IEEE Symp. on Foundations of Comp. Sci., 560--569, 1996. http://citeseer.ist.psu.edu/arge96optimal.html More
@inproceedings{ arge96optimal,
author = "Lars Arge and Jeffrey Scott Vitter",
title = "Optimal Dynamic Interval Management in External Memory (extended abstract)",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "560-569",
year = "1996",
url = "citeseer.ist.psu.edu/arge96optimal.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
315 Constraint query languages - Kanellakis, Kuper et al. - 1990
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994 ACM DBLP
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 indizes (context) - Bayer, McCreight - 1972
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
134 Spatial query processing in an object-oriented database syst.. (context) - Orenstein - 1986 ACM DBLP
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1984
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
110 Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
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
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
88 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990 ACM DBLP
88 Data Structures and Algorithms 3: Multi-dimensional Searchin.. (context) - Mehlhorn - 1984
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982 ACM DBLP
63 Dynamic algorithms in computational geometry - Chiang, Tamassia - 1992 ACM
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
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
42 Efficient External-Memory Data Structures and Applications - Arge - 1996
40 Computer Graphics: Principles and Practice (context) - Foley, van Dam et al. - 1990
38 Adding range restriction capability to dynamic data structur.. (context) - Willard, Lueker - 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
33 Binary search tree of bounded balance (context) - Nievergelt, Reingold - 1973
22 range searching in external memory (context) - Vengroff, Vitter et al. - 1996
21 Exploiting extensible dbms in integrated geographic informat.. (context) - Haas, Cody - 1991 ACM DBLP
20 Priority search trees in secondary memory (context) - Icking, Klein et al. - 1987
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1989
17 An intellegent information fusion system for handling the ar.. (context) - Cromp - 1993
17 the average number of rebalancing operations in weightbalanc.. (context) - Blum, Mehlhorn - 1980
14 XP-trees---External priority search trees (context) - Blankenagel, Guting - 1990
13 External segment trees (context) - Blankenagel, Guting - 1994 DBLP
9 Guest Editor's Introduction in IEEE Computer (context) - Patt, candidate et al. - 1994
4 OOBD indexing by class division (context) - Ramaswamy, Kanellakis - 1995
3 Geographic information systems (context) - van Kreveld - 1995 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~large/index.html): More
The Buffer Tree: A New Technique for Optimal I/O-Algorithms.. - Arge (Correct)
I/O-Efficient Dynamic Planar Point Location (Extended Abstract) - Arge, Vahrenhold (1999) (Correct)
I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al. (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