Range-aggregate queries involving geometric aggregation operations

Authors:
Saladi Rahul;Ananda Swarup Das;K. S. Rajan;Kannan Srinathan
Affiliations:
International Institute of Information Technology, Hyderabad, India;International Institute of Information Technology, Hyderabad, India;International Institute of Information Technology, Hyderabad, India;International Institute of Information Technology, Hyderabad, India
Venue:
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Year:
2011

Citing 4
Cited 2

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Range Aggregate Processing in Spatial Databases

IEEE Transactions on Knowledge and Data Engineering
On Dominance Reporting in 3D

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Algorithms for range-aggregate query problems involving geometric aggregation operations

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Two-Dimensional range diameter queries

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Range-aggregate queries for geometric extent problems

CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141

Quantified Score

Hi-index	0.00

Visualization

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 semidynamic (insertions) solutions to some of these problems. This paper is the first attempt to provide dynamic solutions to problems involving geometric aggregation operations.