Affiliation:
1. State Univ. of New York at Albany, Albany; and Bell Communications Research
2. Univ. of California at Irvine, Irvine
Abstract
A database is said to allow range restrictions if one may request that only records with some specified field in a specified range be considered when answering a given query. A transformation is presented that enables range restrictions to be added to an arbitrary dynamic data structure on
n
elements, provided that the problem satisfies a certain decomposability condition and that one is willing to allow increases by a factor of
O
(log
n
) in the worst-case time for an operation and in the space used. This is a generalization of a known transformation that works for static structures. This transformation is then used to produce a data structure for range queries in
k
dimensions with worst-case times of
O
(log
k
n
) for each insertion, deletion, or query operation.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
123 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献