Spatial Search with Polyhedra.
H. V. Jagadish:
Spatial Search with Polyhedra.
ICDE 1990: 311-319@inproceedings{DBLP:conf/icde/Jagadish90,
author = {H. V. Jagadish},
title = {Spatial Search with Polyhedra},
booktitle = {Proceedings of the Sixth International Conference on Data Engineering,
February 5-9, 1990, Los Angeles, California, USA},
publisher = {IEEE Computer Society},
year = {1990},
isbn = {0-8186-2025-0},
pages = {311-319},
ee = {db/conf/icde/Jagadish90.html},
crossref = {DBLP:conf/icde/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Copyright © 1990 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Proceedings of the Sixth International Conference on Data Engineering, February 5-9, 1990, Los Angeles, California, USA.
IEEE Computer Society 1990, ISBN 0-8186-2025-0
Contents BibTeX
References
- [1]
- ...
- [2]
- Jon Louis Bentley:
Multidimensional Binary Search Trees Used for Associative Searching.
Commun. ACM 18(9): 509-517(1975) BibTeX
- [3]
- Jon Louis Bentley, Jerome H. Friedman:
Data Structures for Range Searching.
ACM Comput. Surv. 11(4): 397-409(1979) BibTeX
- [4]
- Christos Faloutsos:
Gray Codes for Partial Match and Range Queries.
IEEE Trans. Software Eng. 14(10): 1381-1393(1988) BibTeX
- [5]
- Oliver Günther, Eugene Wong:
A Dual Space Representation for Geometric Data.
VLDB 1987: 501-506 BibTeX
- [6]
- Antonin Guttman:
R-Trees: A Dynamic Index Structure for Spatial Searching.
SIGMOD Conference 1984: 47-57 BibTeX
- [7]
- David B. Lomet, Betty Salzberg:
A Robust Multi-Attribute Search Structure.
ICDE 1989: 296-304 BibTeX
- [8]
- ...
- [9]
- Jack A. Orenstein, T. H. Merrett:
A Class of Data Structures for Associative Searching.
PODS 1984: 181-190 BibTeX
- [10]
- Jack A. Orenstein:
Redundancy in Spatial Databases.
SIGMOD Conference 1989: 295-305 BibTeX
- [11]
- John T. Robinson:
The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes.
SIGMOD Conference 1981: 10-18 BibTeX
- [12]
- ...
- [13]
- Hanan Samet:
The Quadtree and Related Hierarchical Data Structures.
ACM Comput. Surv. 16(2): 187-260(1984) BibTeX
- [14]
- Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos:
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.
VLDB 1987: 507-518 BibTeX
- [15]
- ...
Referenced by
- Miyeon Kim, Sumi Lim, Jangsu Kim:
Development of Multi-step Filtering Processor.
DASFAA 1999: 169-176
- Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas:
Fast and Effective Retrieval of Medical Tumor Shapes.
IEEE Trans. Knowl. Data Eng. 10(6): 889-904(1998)
- Volker Gaede, Oliver Günther:
Multidimensional Access Methods.
ACM Comput. Surv. 30(2): 170-231(1998)
- Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel:
Using Extended Feature Objects for Partial Similarity Retrieval.
VLDB J. 6(4): 333-348(1997)
- Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos:
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperectangles.
IEEE Trans. Knowl. Data Eng. 9(3): 373-383(1997)
- Stefan Deßloch, Nelson Mendonça Mattos:
Integrating SQL Databases with Content-Specific Search Engines.
VLDB 1997: 528-537
- Marcel Kornacker, C. Mohan, Joseph M. Hellerstein:
Concurrency and Recovery in Generalized Search Trees.
SIGMOD Conference 1997: 62-72
- Norio Katayama, Shin'ichi Satoh:
The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries.
SIGMOD Conference 1997: 369-380
- Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas:
Fast Nearest Neighbor Search in Medical Image Databases.
VLDB 1996: 215-226
- Christos Faloutsos, King-Ip Lin:
FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets.
SIGMOD Conference 1995: 163-174
- Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher:
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data.
PODS 1995: 54-65
- Walid G. Aref, Daniel Barbará, Stephen Johnson, Sharad Mehrotra:
Efficient Processing of Proximity Queries for Large Databases.
ICDE 1995: 147-154
- King-Ip Lin, H. V. Jagadish, Christos Faloutsos:
The TV-Tree: An Index Structure for High-Dimensional Data.
VLDB J. 3(4): 517-542(1994)
- Ibrahim Kamel, Christos Faloutsos:
Hilbert R-tree: An Improved R-tree using Fractals.
VLDB 1994: 500-509
- Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos:
Fast Subsequence Matching in Time-Series Databases.
SIGMOD Conference 1994: 419-429
- Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger:
Multi-Step Processing of Spatial Joins.
SIGMOD Conference 1994: 197-208
- Christos Faloutsos, Ibrahim Kamel:
Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension.
PODS 1994: 4-13
- Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider:
Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems.
ICDE 1993: 40-49
- Shashi Shekhar, Toneluh Andrew Yang:
MoBiLe Files and Efficient Processing of Path Queries on Scientific Data.
ICDE 1992: 78-85
- H. V. Jagadish:
A Retrieval Technique for Similar Shapes.
SIGMOD Conference 1991: 208-217
- H. V. Jagadish:
On Indexing Line Segments.
VLDB 1990: 614-625
- H. V. Jagadish:
Linear Clustering of Objects with Multiple Atributes.
SIGMOD Conference 1990: 332-342
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:17:52 2009