A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES

被引：4
|
作者：
Nekrich, Yakov [1 ]
机构：
[1] Univ Bonn, Dept Comp Sci, D-53117 Bonn, Germany
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 2009年 / 19卷 / 01期
关键词：
Data structures; dynamic data structures; orthogonal range reporting;
D O I：
10.1142/S0218195909002800
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we present a linear space dynamic data structure for two-dimensional orthogonal range reporting and emptiness queries. This data structure answers range reporting queries in time O(log n log log n + k log(epsilon) 2n/k+1) for any epsilon > 0 and k the size of the answer. Our data structure also supports emptiness and one-reporting queries in time O(log n log log n). The model of computation used in this paper is a unit-cost RAM model.
引用
收藏
页码：1 / 15
页数：15
相关论文
共 50 条
  • [21] A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries
    Grez, Alejandro
    Cali, Andrea
    Ugarte, Martin
    FLEXIBLE QUERY ANSWERING SYSTEMS, 2019, 11529 : 43 - 47
  • [22] Dynamic orthogonal range queries in OLAP
    Poon, CK
    THEORETICAL COMPUTER SCIENCE, 2003, 296 (03) : 487 - 510
  • [23] Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space
    Peyman Afshani
    Chris Hamilton
    Norbert Zeh
    Discrete & Computational Geometry, 2011, 45 : 824 - 850
  • [24] Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space
    Afshani, Peyman
    Hamilton, Chris
    Zeh, Norbert
    DISCRETE & COMPUTATIONAL GEOMETRY, 2011, 45 (04) : 824 - 850
  • [25] Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space
    Afshani, Peyman
    Hamilton, Chris
    Zeh, Norbert
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 277 - 286
  • [26] Range selection and predecessor queries in data aware space and time
    Külekci M.O.
    Thankachan S.V.
    Külekci, M. Oğuzhan (kulekci@itu.edu.tr), 1600, Elsevier B.V., Netherlands (43): : 18 - 25
  • [27] An Efficiently Searchable Encrypted Data Structure for Range Queries
    Kerschbaum, Florian
    Tueno, Anselme
    COMPUTER SECURITY - ESORICS 2019, PT II, 2019, 11736 : 344 - 364
  • [28] PARTITIONING SPACE FOR RANGE QUERIES
    YAO, FF
    DOBKIN, DP
    EDELSBRUNNER, H
    PATERSON, MS
    SIAM JOURNAL ON COMPUTING, 1989, 18 (02) : 371 - 384
  • [29] A LOWER BOUND ON THE COMPLEXITY OF ORTHOGONAL RANGE QUERIES
    FREDMAN, ML
    JOURNAL OF THE ACM, 1981, 28 (04) : 696 - 705
  • [30] Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
    Farzan, Arash
    Munro, J. Ian
    Raman, Rajeev
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 327 - 338
12345