Optimal Dynamic Range Searching in Non-replicating Index Structures
نویسندگان
چکیده
We consider the problem of dynamic range searching in tree structures that do not replicate data. We propose a new dynamic structure, called the O-tree, that achieves a query time complexity of O(n(d 1)=d) on n d-dimensional points and an amortized insertion/deletion time complexity of O(logn). We show that this structure is optimal when data is not replicated. In addition to optimal query and insertion/deletion times, the O-tree also supports exact match queries in worst-case logarithmic time.
منابع مشابه
Lecture Notes: Range Searching with Linear Space
In this lecture, we will continue our discussion on the range searching problem. Recall that the input set P consists of N points in R. Given an axis-parallel rectangle q, a range query reports all the points of P ∩ q. We want to maintain a fully dynamic structure on P to answer range queries efficiently. We will focus on non-replicating structures [2, 3]. Specifically, consider that each point...
متن کاملVISCOUS DAMPER PLACEMENT OPTIMIZATION IN CONCRETE STRUCTURES USING COLLIDING BODIES ALGORITHM AND STORY DAMAGE INDEX
Dampers can reduce structural response under dynamic loads. Since dampers are costly, the design of structures equipped with dampers should make their application economically justifiable. Among the effective cost reduction factors is optimal damper placement. Hence, this study intended to find the optimal viscous damper placement using efficient optimization methods. Taking into account the no...
متن کاملEfficient Dynamic Range Searching Using Data Replication
Given the lower bound of (n(d 1)=d) for range query time complexity on n d-dimensional point data, we investigate whether little replication can improve the query and update times significantly. We propose linear-space index structures that minimize the query and update times; the query time we achieve is O(n ) for any > 0, and, the update time is O(logn).
متن کاملImprove Replica Placement in Content Distribution Networks with Hybrid Technique
The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...
متن کاملModeling the Trade-off between Manufacturing Cell Design and Supply Chain Design
Nowadays, we are witnessing the growth of firms that distribute the production capacity of their products to a wide geographic range to supply the demand of several markets. In this article, the relationships and interactions between cell design and supply chain design are investigated. For this purpose, a novel integrated model is presented for designing dynamic cellular manufacturing systems ...
متن کامل