Abstract
A progressive spatial query retrieves spatial data based on previous queries (e.g., to fetch data in a more restricted area with higher resolution). A direct query, on the other side, is defined as an isolated window query. A multi-resolution spatial database system should support both progressive queries and traditional direct queries. It is conceptually challenging to support both types of query at the same time, as direct queries favour location-based data clustering, whereas progressive queries require fragmented data clustered by resolutions. Two new scaleless data structures are proposed in this paper. Experimental results using both synthetic and real world datasets demonstrate that the query processing time based on the new multiresolution approaches is comparable and often better than multi-representation data structures for both types of queries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aboulnaga, A., Naughton, J.R.F.: Estimation of the cost of spatial selections. In: ICDE, pp. 123–134 (2000)
Diggle, P.J.: Statistical analysis of spatial point patterns. Oxford University Press, Oxford (2003)
Dittrich, J., Seeger, B., Taylor, D.S., Widmayer, P.: Progressive merge join: A generic and non-blocking sort-based join algorithm. In: VLDB, pp. 299–310 (2002)
Frank, A.U., Timpf, S.: Multiple representations for cartographical objects in a multi-scale tree - an intelligent graphical zoom. Computers and Graphics 18(6), 823–829 (1994)
Horhammer, M., Freeston, M.: Spatial indexing with a scale dimension. In: SSD, pp. 52–71 (1999)
Kanth, R., Agrawal, D., Abbadi, A.E., Singh, A.K., Smith, T.R.: Parallelizing multidimensional index structures. In: IEEE Symposium on Parallel and Distributed Processing, pp. 376–383 (1996)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB, pp. 275–286 (2002)
Prasher, P.: Perfect cartographic generalisation and visualisation. In: VDB (2002)
Prasher, S., Zhou, X., Kitsuregawa, M.: Dynamic multi-resolution spatial object derivation for mobile and WWW applications. J. WWW 6(3), 305–325 (2003)
Puppo, E., Dettori, G.: Towards a formal model for multiresolution spatial maps. In: SSD, pp. 152–169 (1995)
Samet, H.: Applications of Spatial Data Structures. Addison-Wesley, Reading (1990)
Stonebraker, M.: An overview of the sequoia 2000 project. Digital Technical Journal of Digital Equipment Corporation 7(3), 39–49 (1995)
Sun, C., Agrawal, D., Abbadi, A.E.: Selectivity estimation for spatial joins with geometric selections. In: EDBT, pp. 609–626 (2002)
Vijayshankar, R.: Partial results for online query processing. In: SIGMOD, pp. 275–286 (2002)
Zhou, S., Jones, C.B.: Design and implementation of multi-scale databases. In: SSTD, pp. 365–384 (2001)
Zhou, S., Jones, C.B.: A multi-representation spatial data model. In: SSTD, pp. 33–51 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, S., Prasher, S., Zhou, X. (2004). A Scaleless Data Model for Direct and Progressive Spatial Query Processing. In: Wang, S., et al. Conceptual Modeling for Advanced Application Domains. ER 2004. Lecture Notes in Computer Science, vol 3289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30466-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30466-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23722-8
Online ISBN: 978-3-540-30466-1
eBook Packages: Springer Book Archive