License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2015.277
URN: urn:nbn:de:0030-drops-49900
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/4990/
Biswas, Sudip ;
Patil, Manish ;
Shah, Rahul ;
Thankachan, Sharma V.
Shared-Constraint Range Reporting
Abstract
Orthogonal range reporting is one of the classic and most fundamental data structure problems. (2,1,1) query is a 3 dimensional query with two-sided constraint on the first dimension and one sided constraint on each of the 2nd and 3rd dimension. Given a set of N points in three dimension, a particular formulation of such a (2,1,1) query (known as four-sided range reporting in three-dimension) asks to report all those K points within a query region [a, b]X(-infinity, c]X[d, infinity). These queries have overall 4 constraints. In Word-RAM model, the best known structure capable of answering such queries with optimal query time takes O(N log^{epsilon} N) space, where epsilon>0 is any positive constant. It has been shown that any external memory structure in optimal I/Os must use Omega(N log N/ log log_B N) space (in words), where B is the block size [Arge et al., PODS 1999]. In this paper, we study a special type of (2,1,1) queries, where the query parameters a and c are the same i.e., a=c. Even though the query is still four-sided, the number of independent constraints is only three. In other words, one constraint is shared. We call this as a Shared-Constraint Range Reporting (SCRR) problem. We study this problem in both internal as well as external memory models. In RAM model where coordinates can only be compared, we achieve linear-space and O(log N+K) query time solution, matching the best-known three dimensional dominance query bound. Whereas in external memory, we present a linear space structure with O(log_B N + log log N + K/B) query I/Os. We also present an I/O-optimal (i.e., O(log_B N+K/B) I/Os) data structure which occupies O(N log log N)-word space. We achieve these results by employing a novel divide and conquer approach. SCRR finds application in database queries containing sharing among the constraints. We also show that SCRR queries naturally arise in many well known problems such as top-k color reporting, range skyline reporting and ranked document retrieval.
BibTeX - Entry
@InProceedings{biswas_et_al:LIPIcs:2015:4990,
author = {Sudip Biswas and Manish Patil and Rahul Shah and Sharma V. Thankachan},
title = {{Shared-Constraint Range Reporting}},
booktitle = {18th International Conference on Database Theory (ICDT 2015)},
pages = {277--290},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-79-8},
ISSN = {1868-8969},
year = {2015},
volume = {31},
editor = {Marcelo Arenas and Mart{\'i}n Ugarte},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/4990},
URN = {urn:nbn:de:0030-drops-49900},
doi = {10.4230/LIPIcs.ICDT.2015.277},
annote = {Keywords: data structure, shared constraint, multi-slab, point partitioning}
}
|
Keywords: |
|
data structure, shared constraint, multi-slab, point partitioning |
|
Collection: |
|
18th International Conference on Database Theory (ICDT 2015) |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
19.03.2015 |
