Abstract
In this paper we consider range-aggregate query problems wherein we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain aggregation function on the objects S′ = S ∩ q can be answered efficiently. Range-aggregate version of point enclosure queries, 1-d segment intersection, 2-d orthogonal segment intersection (with/without distance constraint) are revisited and we improve the existing results for these problems. We also provide semi-dynamic (insertions) solutions to some of these problems. This paper is the first attempt to provide dynamic solutions to problems involving geometric aggregation operations.
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
Afshani, P.: On dominance reporting in 3D. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 41–51. Springer, Heidelberg (2008)
Agarwal, P.K., Arge, L., Yang, J., Yi, K.: I/O-efficient structures for orthogonal range-max and stabbing-max queries. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 7–18. Springer, Heidelberg (2003)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, 2nd edn. Springer, Heidelberg (2000)
Chiang, Y., Tamassia, R.: Dynamic Algorithms in Computational Geometry. In: Toussaint, G. (ed.) Proceedings of the IEEE, Special Issue on Computational Geometry, vol. 80(9), pp. 1412–1434 (1992)
Choudhary, A.N.: Dynamic Priority Search Trees (November 1987), http://www.cs.brown.edu/courses/cs252/misc/proj/src/Spr96-97/mjr/doc/dyn-pst.ps
Das, A.S., Gupta, P., Srinathan, K.: Data Structures for Reporting Extension Violations in a Query Range. In: Proceedings of 21st Canadian Conference on Computational Geometry (CCCG), pp. 129–132 (2009)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38, 86–124 (1989)
Gupta, P.: Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 892–901. Springer, Heidelberg (2005)
McCreight, E.M.: Priority search trees. SIAM Journal of Computing 14(2), 257–276 (1985)
Mehlhorn, K., Naher, S.: Dynamic Fractional Cascading. Algorithmica 5, 215–241 (1990)
Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Prentice-Hall, Englewood Cliffs (2002)
Tao, Y., Papadias, D.: Range aggregate processing in spatial databases. IEEE Transactions on Knowledge and Data Engineering 16(12), 1555–1570 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rahul, S., Das, A.S., Rajan, K.S., Srinathan, K. (2011). Range-Aggregate Queries Involving Geometric Aggregation Operations. In: Katoh, N., Kumar, A. (eds) WALCOM: Algorithms and Computation. WALCOM 2011. Lecture Notes in Computer Science, vol 6552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19094-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-19094-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19093-3
Online ISBN: 978-3-642-19094-0
eBook Packages: Computer ScienceComputer Science (R0)