Spatial priority search

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Spatial priority search: an access technique for scaleless maps

Full text

Pdf (1.04 MB)

Source

International Conference on Management of Data archive
Proceedings of the 1991 ACM SIGMOD international conference on Management of data table of contents

Denver, Colorado, United States

Pages: 128 - 137

Year of Publication: 1991

ISBN:0-89791-425-2

Also published in ...

Authors

Bruno Becker	Institut für Informatik, Universität Freiburg, Rheinstraβe 10-12, D-7800 Freiburg
Hans-Werner Six	Praktische Informatik III, FernUniversität Hagen, Postfach 940 D-5800 Hagen
Peter Widmayer	Institut für Informatik, Universität Freiburg, Rheinstraβe 10-12, D-7800 Freiburg

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 36, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/115790.115805 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bruno Becker , Peter Widmayer, Spatial Priority Search: An Access Technique for Scaleless Maps, Albert-Ludwigs University at Freiburg, 1990
	2	Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
	3	D.H. Douglas, T.K. Peucker: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature, The Canadian Cartographer, Vol. 10, No. 2, 1973, 112-122.
	4	Michael Freeston, The BANG file: A new kind of grid file, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.260-269, May 27-29, 1987, San Francisco, California, United States
	5	M. W. Forreston, Advances in the design of the BANG file, 3rd International Conference, FODO 1989 on Foundations of Data Organization and Algorithms, p.322-338, July 1989, Paris, France
	6	S.C. Guptill: Speculations on seamless, scaleless cartographic data bases, Proc. 9th International Symposium on Computer-Assisted Cartography, 1989.
	7	Antonin Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
	8	Andreas Hutflesz , Hans-Werner Six , Peter Widmayer, Globally Order Preserving Multidimensional Linear Hashing, Proceedings of the Fourth International Conference on Data Engineering, p.572-579, February 01-05, 1988
	9	Andreas Hutflesz , Hans-Werner Six , Peter Widmayer, The R-File: An Efficient Access Structure for Proximity Queries, Proceedings of the Sixth International Conference on Data Engineering, p.372-379, February 05-09, 1990
	10	D.M. Mark: Conceptual basis for geographic line generalization, Proc. 9th International Symposium on Computer-Assisted Cartography, 1989, 68-77.
	11	R.B. McMaster: The integration of simplification and smoothing algorithms in line generalization, Cartographica, Vol. 26, 1989, 101-121.
	12	J.-C. Muller: Rule based generalization: Potentials and impediments, 4th International Symposium on Spatial Data Handling, 1990, 317-334.
	13	W.-D. Rase: Tools for geometric data acquisition and maintenance, NATO Advanced Research Workshop "Mapping and Spatial Modelling for Navigation", Denmark, August 1989.
	14	J. Roberg6: A data reduction algorithm for planar curves, Computer Vision, Graphics, and Image Processing, Vol. 29, 1985, 168-195.
	15	H.-J. Schek, W. Waterfeld: A Database Kernel System for Geoscientific Applications, Proc. 2"~ International Symposium on Spatial Data Handling, Seattle, 1986, 273-288.
	16	K.S. Shea, R.B. McMaster: Cartographic generalization in a digital environment: When and how to generalize, Proc. 9th International Symposium on Computer-Assisted Cartography, 1989, 56-67.
	17	Hans-Werner Six , Peter Widmayer, Spatial Searching in Geometric Databases, Proceedings of the Fourth International Conference on Data Engineering, p.496-503, February 01-05, 1988
	18	K. Thapa: Data compression and critical points detection using normalized symmetric scattered matrix, Proc. 9th International Symposium on Computer-Assisted Cartography, 1989, 78-89.
	19	F. TSpfer, W. Pillewizer: The principles of selection, a means of cartographic generalisation, Cartographic Journal, Vol. 3, No. 1, 1966, 10-16.
	20	P. v. Oosterom: The Reactive-tree: A Storage Structure for a Seamless, Scaleless Geographic Database, submitted for publication.

CITED BY 4

	Goetz Graefe, Query evaluation techniques for large databases, ACM Computing Surveys (CSUR), v.25 n.2, p.73-169, June 1993
	Edward P. F. Chan , Kevin K. W. Chow, On multi-scale display of geometric objects, Data & Knowledge Engineering, v.40 n.1, p.91-119, January 2002
	Maurìcio R. Mediano , Marco A. Casanova , Marcelo Dreux, V-Trees - A Storage Method for Long Vector Data, Proceedings of the 20th International Conference on Very Large Data Bases, p.321-330, September 12-15, 1994
	Changxiu Cheng , Fangqu Niu , Jun Cai , Yanlu Zhu, Extensions of GAP-tree and its implementation based on a non-topological data model, International Journal of Geographical Information Science, v.22 n.6, p.657-673, January 2008