Information and Computation ( IF 1 ) Pub Date : 2020-01-15 , DOI: 10.1016/j.ic.2020.104519 Kazuki Ishiyama , Kunihiko Sadakane
We introduce compact and succinct representations of a d-dimensional point set for any constant supporting orthogonal range searching. Our first data structure uses bits, where n denotes the number of points in P, and supporting reporting queries in time, and counting queries in time, where occ denotes the number of point to report, which is faster than known algorithms. Our second data structure uses bits, where U is the size of the universe, which asymptotically matches the information-theoretic lower bound. The query time complexity is worse than the first one, but the algorithm runs fast in practical database search.
中文翻译:
紧凑而简洁的数据结构,用于多维正交范围搜索
我们为任何常数引入d维点集的简洁表示支持正交范围搜索。我们的第一个数据结构使用位,其中n表示P中的点数,并支持P中的报告查询 时间,并计算中的查询 时间,其中occ表示要报告的点数,比已知算法快。我们的第二个数据结构使用位,其中U是宇宙的大小,渐近地与信息理论的下限匹配。查询时间复杂度比第一个要差,但是该算法在实际的数据库搜索中运行速度很快。