Access Restriction

Author Yi, Ke
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword B-trees ♦ Indexability ♦ Dynamization ♦ Lower bound ♦ Range query
Abstract One-dimensional range queries, as one of the most basic type of queries in databases, have been studied extensively in the literature. For large databases, the goal is to build an external index that is optimized for disk block accesses (or I/Os). The problem is well understood in the static case. Theoretically, there exists an index of linear size that can answer a range query in O(1 + $\textit{KB})$ I/Os, where $\textit{K}$ is the output size and $\textit{B}$ is the disk block size, but it is highly impractical. In practice, the standard solution is the B-tree, which answers a query in $O(log_{B}$ $\textit{NM}$ + $\textit{KB})$ I/Os on a data set of size $\textit{N},$ where $\textit{M}$ is the main memory size. For typical values of N, M, and $\textit{B},$ $log_{B}$ $\textit{NM}$ can be considered a constant. However, the problem is still wide open in the dynamic setting, when insertions and deletions of records are to be supported. With smart buffering, it is possible to speed up updates significantly to $\textit{o}(1)$ I/Os amortized. Indeed, several dynamic B-trees have been proposed, but they all cause certain levels of degradation in the query performance, with the most interesting tradeoff point at $\textit{O}(1\textit{B}$ log $\textit{NM})$ I/Os for updates and $\textit{O}(log$ $\textit{NM}$ + $\textit{KB})$ I/Os for queries. In this article, we prove that the query-update tradeoffs of all the known dynamic B-trees are optimal, when $log_{B}$ $\textit{NM}$ is a constant. This implies that one should not hope for substantially better solutions for all practical values of the parameters. Our lower bounds hold in a dynamic version of the indexability model, which is of independent interests. Dynamic indexability is a clean yet powerful model for studying dynamic indexing problems, and can potentially lead to more interesting lower bound results.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-08-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 59
Issue Number 4
Page Count 19
Starting Page 1
Ending Page 19

Open content in new tab

   Open content in new tab
Source: ACM Digital Library