Given an arbitrary set A of two-dimensional points over a totally-ordered domain, a two-sided planar range query consists on finding all points of A within an arbitrary quadrant. In this paper we present a novel data structure that uses linear space in |A| while allowing for two-dimensional orthogonal range queries with logarithmic pre-processing and constant-delay enumeration.
A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries / Grez., Alejandro; Cali', Andrea; Ugarte, Martín. - 11529:(2019), pp. 43-47. ( 13th International Conference on Flexible Query Answering Systems, FQAS 2019 ita 2019) [10.1007/978-3-030-27629-4_7].
A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries
Andrea Cali';
2019
Abstract
Given an arbitrary set A of two-dimensional points over a totally-ordered domain, a two-sided planar range query consists on finding all points of A within an arbitrary quadrant. In this paper we present a novel data structure that uses linear space in |A| while allowing for two-dimensional orthogonal range queries with logarithmic pre-processing and constant-delay enumeration.| File | Dimensione | Formato | |
|---|---|---|---|
|
FQAS-19-1.pdf
solo utenti autorizzati
Tipologia:
Versione Editoriale (PDF)
Licenza:
Copyright dell'editore
Dimensione
236.37 kB
Formato
Adobe PDF
|
236.37 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
