Vasilis Samoladas  Home/Search
Context Related
| utexas.edu/ftp/pub/techre...tr0158.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: utexas.edu/ftp/pub/techreports... (more) Homepages: V.Samoladas |
Rate this article:      (best)Comment on this article |
Abstract: In the last decade, the relational data model has been extended in numerous ways, including geographic information systems, abstract data types and object models, constraint and temporal databases, and on-line analytical processing. We study the indexing requirements of these data models. In many cases, these requirements are fullled by effcient techniques for multidimensional range search. Previous techniques for multidimensional range search, such as the R-tree and its variants, are based on... (Update)
Cited by: More
Lower Bounds for External Memory Dictionaries - Brodal, Fagerberg (Correct)
Active bibliography (related documents): More All
1.0: On Two-Dimensional Indexability and Optimal Range Search.. - Arge, al. (1999) (Correct)
0.9: External Memory Data Structures - Arge (2000) (Correct)
0.9: Geometric Range Searching and Its Relatives - Agarwal, Erickson (1999) (Correct)
Similar documents based on text: More All
0.7: A Lower Bound Theorem for Indexing Schemes and its.. - Samoladas, Miranker (1998) (Correct)
0.7: Alamo: An Architecture for Integrating Heterogeneous Data.. - Miranker, Samoladas (1997) (Correct)
0.5: 4D Light-Field Modeling and Rendering - Gurrea (2001) (Correct)
BibTeX entry: (Update)
V. Samoladas. On Indexing Large Databases for Advanced Data Models. PhD thesis, The University of Texas at Austin, 2001. Dept. of Computer Science. http://citeseer.ist.psu.edu/samoladas01indexing.html More
@misc{ samoladas01indexing,
author = "V. Samoladas",
title = "On Indexing Large Databases for Advanced Data Models",
text = "V. Samoladas. On Indexing Large Databases for Advanced Data Models. PhD
thesis, The University of Texas at Austin, 2001. Dept. of Computer Science.",
year = "2001",
url = "citeseer.ist.psu.edu/samoladas01indexing.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
346 Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
283 A relational model of data for large shared data banks (context) - Codd - 1970
262 Multidimensional access methods - Gaede, Gunther - 1998
233 tree: A dynamic index for multi-dimensional 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 - 1970
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
155 The quadtree and related hierarchical data structures (context) - Samet - 1984
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
133 Geometric range searching and its relatives - Agarwal, Erickson - 1997
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1984
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
117 Generalized search trees for database systems - Hellerstein, Naughton et al. - 1995
116 Planar point location using persistent search trees (context) - Sarnak, Tarjan - 1986
109 Multidimensional divide and conquer (context) - Bentley - 1980
107 Quad trees: a data structure for retrieval on composite keys (context) - Finkel, Bentley - 1974
106 Priority search trees (context) - McCreight - 1985
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993
101 Beyond uniformity and independence: Analysis of R- trees usi.. - Faloutsos, Kamel - 1994
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
90 Direct spatial search on pictorial databases using packed R-.. (context) - Roussopoulos, Leifker - 1985
88 An asymptotically optimal multiversion B-tree - Becker, Gschwind et al. - 1996
88 Data Structures and Algorithms 3: Multidimensional Searching.. (context) - Mehlhorn - 1984
87 Comparison of access methods for time-evolving data (context) - Salzberg, Tsotras - 1999
83 tree using fractals (context) - Kamel, Faloutsos et al. - 1994
81 A class of data structures for associative searching (context) - Orenstein, Merrett - 1984
80 On indexing mobile objects - Kollios, Gunopoulos et al. - 1999
73 Extendible hashing -- a fast access method for dynamic files (context) - Fagin, Nievergelt et al. - 1979
70 The bang file: a new kind of grid file (context) - Freeston - 1987
69 Filtering search: a new approach to query answering (context) - Chazelle - 1986
67 A data structuring technique (context) - Chazelle, Guibas - 1986
64 Indexing moving points - Agarwal, Arge et al. - 2000
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996
60 The power of geometric duality (context) - Chazelle, Guibas et al. - 1985
59 A functional approach to data structures and its use in mult.. (context) - Chazelle - 1988
59 cient and robust access method for points and rectangles (context) - Beckmann, Kriegel et al. - 1990
58 Reporting points in halfspaces (context) - Matousek - 1992
56 Designing access methods for bitemporal databases (context) - Kumar, Tsotras et al. - 1998
55 The lsd tree: spatial access to multidimensional point and n.. (context) - Henrich, Six et al. - 1989
53 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
44 Towards an analysis of range query performance in spatial da.. - Pagel, Six et al. - 1993
41 Blocking for external graph searching - Nodine, Goodrich et al. - 1996
40 Geometric range searching - Matousek - 1994
39 A data structure for orthogonal range queries (context) - Lueker - 1978
38 Adding range restriction capability to dynamic data structur.. (context) - Willard, Lueker - 1985
37 External memory algorithms and data structures - Vitter - 1999
37 the analysis of indexing schemes - Hellerstein, Koutsoupias et al. - 1997
36 Lower bounds for orthogonal range searching (context) - Chazelle - 1990
36 Lower bounds for orthogonal range searching (context) - Chazelle - 1990
34 Segment indexes: Dynamic indexing techniques for multi-dimen.. (context) - Kolovson, Stonebraker - 1991
34 Spatial search with polyhedra (context) - Jagadish - 1990
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
30 A new upper bound for error-correcting codes (context) - Johnson - 1962
30 On two-dimensional indexability and optimal range search ind.. - Arge, Samoladas et al. - 1999
28 Lower bounds on the complexity of some optimal data structur.. (context) - Fredman - 1981
28 Cambridge University Press (context) - van Lint, Wilson et al. - 1996
25 nets and simplex range queries (context) - Haussler, Welzl - 1987
25 Fractional cascading: II (context) - Chazelle, Guibas - 1986
22 range searching in external memory (context) - Vengro, Vitter et al. - 1996
22 DOT: A spatial access method using fractals - Faloutsos, Rong - 1991
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
16 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
16 Overlapping linear quadtrees: A spatio-temporal access metho.. (context) - Tzouramanis, Vassilakopoulos et al. - 1998
16 Optimal redundancy in spatial database systems - Gaede - 1995
14 An application of number theory to the organization of raste.. (context) - Chor, Leiserson et al. - 1986
14 XP-trees---External priority search trees (context) - Blankenagel, Guting - 1990
14 Clustering techniques for minimizing external path length - Diwan, Rane et al. - 1996
13 Optimal dynamic range searching in non-replicating index str.. - Kanth, Singh - 1989
12 Implementation of the grid file: design concepts and experie.. (context) - Hinrichs - 1985
11 IEEE Transactions on Knowledge and Data Engineering (context) - Varman, Verman et al. - 1997
11 Advanced Database Indexing (context) - Manolopoulos, Theodoridis et al. - 1999
10 How to avoid building datablades that know the value of ever.. - Aoki - 1999
10 Linear space data structures for two types of range search (context) - Chazelle, Edelsbrunner - 1987
8 Tight bounds for 2dimensional indexing schemes - Koutsoupias, Taylor - 1998
8 An extremal problem in graph theory (context) - Turan - 1941
8 Predicate-oriented database search algorithms (context) - Willard - 1978
7 Geometric Discrepancy: an illustrated guide (context) - Matousek - 1999
7 ciently in object-relational databases (context) - Kriegel, Potke et al. - 2000
7 SIAM Journal of Computing (context) - Willard - 1982
7 The inherent complexity of dynamic data structures which acc.. (context) - Fredman - 1980
6 Optimal solutions for a class of point retrieval problems (context) - Chazelle, Edelsbrunner - 1985
6 Reactive data structures for geographic information systems (context) - Oosterom - 1990
6 Amdb: A visual access method development tool - Shah, Kornacker et al. - 1999
6 New data structures for orthogonal range searching - Alstrup, Brodal et al. - 2000
5 Quintary trees: a file structure for multidimensional databa.. (context) - Lee, Wong - 1980
4 cient cost models for spatial queries using r-trees (context) - Theodoridis, Stefanakis et al. - 2000
4 line range searching (context) - Chazelle, for - 1995
3 Fully persistent B+trees (context) - Lanka, Mays - 1991
3 Making data structures persistant (context) - Driscoll, Sarnak et al. - 1989
3 How to find a battleship (context) - Fiat, Shamir - 1989
3 cient searching with linear constraints (context) - Agarwal, Arge et al. - 1998
2 range searching in external memory (context) - Vengro, rey et al. - 1996
2 A lower bound bound theorem for indexing schemes and its app.. (context) - Samoladas, Miranker - 1998
1 Indexing schemes for random points - Koutsoupias, Taylor - 1999
1 Algorithms for three-dimensional dominance searching in line.. (context) - Makris, Tsakalidis - 1998
1 Space-time trade-o#s for orthogonal range queries (context) - Vaidya - 1989
1 Ellis Horwood Ltd (context) - Vajda, Lucas et al. - 1989
1 cient indexing for constraint and temporal databases (context) - Ramaswamy - 1997
Documents on the same site (http://www.cs.utexas.edu/ftp/pub/techreports/): More
Parametric Quantitative Temporal Reasoning - Emerson, Trefler (1999) (Correct)
Two Problems of TCP AIMD Congestion Control - Yang, Kim, Zhang, Lam (2000) (Correct)
Verifying Adder Circuits Using Powerlists - Adams (1994) (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