A performance comparison of quadtree-based access methods for thematic maps

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A performance comparison of quadtree-based access methods for thematic maps

Full text

Pdf (749 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2000 ACM symposium on Applied computing - Volume 1 table of contents

Como, Italy

Pages: 381 - 388

Year of Publication: 2000

ISBN:1-58113-240-9

Authors

Eleni Tousidou	Data Engineering Lab, Department of Informatics, Aristotle University, 54006 Thessaloniki, Greece
Yannis Manolopoulos	Data Engineering Lab, Department of Informatics, Aristotle University, 54006 Thessaloniki, Greece

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 17, Citation Count: 1

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/335603.335844 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	Walid G. Aref , Hanan Samet, Efficient processing of window queries in the pyramid data structure, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.265-272, April 02-04, 1990, Nashville, Tennessee, United States [doi>10.1145/298514.298579]
	2	W. Aref and I-I. Samet. Decomposing a window into maximal quadtree blocks. Acta lnformatica, 30:425- 439, 1993.
	3	Uwe Deppisch, S-tree: a dynamic balanced signature index for office retrieval, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, p.77-87, September 1986, Palazzo dei Congressi, Pisa, Italy [doi>10.1145/253168.253189]
	4	Volker Gaede , Oliver Günther, Multidimensional access methods, ACM Computing Surveys (CSUR), v.30 n.2, p.170-231, June 1998 [doi>10.1145/280277.280279]
	5	Irene Gargantini, An effective way to represent quadtrees, Communications of the ACM, v.25 n.12, p.905-910, Dec 1982 [doi>10.1145/358728.358741]
	6	Oliver Günther, Efficient structures for geometric data management, Springer-Verlag New York, Inc., New York, NY, 1989
	7	Wiebren de Jonge , Peter Scheuermann , Ardie Schijf, S+-trees: an efficient structure for the representation of large pictures, CVGIP: Image Understanding, v.59 n.3, p.265-280, May 1994 [doi>10.1006/ciun.1994.1018]
	8	E. Kawaguchi, T. Endo, and M. Yokota. Depth-first expression viewed from digital picture processing. {EEE Transactions on Pattern Analysis and Machine Intelligence, pages 373-384, 1983.
	9	Yannis Manolopoulos , Enrico Nardelli , Apostolos Papadopoulos , Guido Proietti, MOF-tree: a spatial access method to manipulate multiple overlapping features, Information Systems, v.22 n.9, p.465-481, Dec. 1997
	10	E. Naxdelli and G. Proietti. Etficicat secondary memory processing of window queries on spatial data. lnforraation Sciences, 80:1~17, 1994.
	11	Enrico Nardelli , Guido Proietti, A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries, Proceedings of the International Workshop on Advanced Information Systems: Geographic Information Systems, p.259-269, February 28-March 04, 1994
	12	E. Naxdelli and G. Proietti. An optimal resolution sensitive pyramid representation for hicrarchical memory models. Journal of Compu~in.q and {nforraation, 1:385- 4027 1994.
	13	Hanan Samet, The design and analysis of spatial data structures, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	14	S. Tanimoto and T. Pavlidis. A hierarchical data structure for picture processing. Computer Graphics and Image Processing, 4(2):104-119, 1975.
	15	Michael Vassilakopoulos , Yannis Manolopoulos, Analytical comparison of two spatial data structures, Information Systems, v.19 n.7, p.569-582, Oct. 1994 [doi>10.1016/0306-4379(94)90015-9]