Compact and succinct data structures for multidimensional orthogonal range searching
type: Item
instance of: scholarly article
title: Compact and succinct data structures for multidimensional orthogonal range searching
zbMATH Open document ID: 1446.68040
author: Kazuki Ishiyama
author: Kunihiko Sadakane
published in: Information and Computation
publication date: 2020-07-13T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 7219713
zbMATH Keywords: orthogonal range searching
zbMATH Keywords: succinct data structure
zbMATH Keywords: database
MaRDI profile type: Publication
full work available at URL: j.ic.2020.104519
OpenAlex ID: W2999656158
Wikidata QID: Q126342451
cites work: Q4821338
cites work: Multidimensional binary search trees used for associative searching
cites work: Decomposable searching problems
cites work: Q4471381
cites work: Rank and select revisited and extended
cites work: New algorithms on wavelet trees and applications to information retrieval
cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
cites work: Entropy-bounded representation of point grids
cites work: Space-efficient data-analysis queries on grids
cites work: Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
cites work: Optimal Succinctness for Range Minimum Queries
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
cites work: An experimental investigation of set intersection algorithms for text searching
cites work: Practical Entropy-Compressed Rank/Select Dictionary
DOI: 10.1016/J.IC.2020.104519
Recommended article: On the average performance of orthogonal range search in multidimensional data structures
Recommended article: Q4737184
Recommended article: Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
Recommended article: New Data Structures for Orthogonal Range Queries
Recommended article: Cache-oblivious data structures for orthogonal range searching
Recommended article: Orthogonal range searching in linear and almost-linear space
Recommended article: Orthogonal Range Searching in Linear and Almost-Linear Space
Recommended article: Space-Time Trade-Offs for Orthogonal Range Queries
Recommended article: Efficient Data Structures for the Orthogonal Range Successor Problem
Recommended article: Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
description: scientific article; zbMATH DE number 7219713