Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Range-Aggregate Queries Involving Geometric Aggregation Operations
verfasst von : Saladi Rahul, Ananda Swarup Das, K. S. Rajan, Kannan Srinathan
Erschienen in: WALCOM: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.