Efficiently Update Disk-Resident Interval Tree

2021 ◽  
pp. 198-207
Author(s):  
Jianqiu Xu ◽  
Jianhua Wei
Keyword(s):  
Interval Tree

scholarly journals Bedtk: finding interval overlap with implicit interval tree

2020 ◽  
Author(s):  
Heng Li ◽  
Jiazhen Rong
Keyword(s):  
Data Structure ◽  
Source Code ◽  
Interval Tree

Abstract Summary We present bedtk, a new toolkit for manipulating genomic intervals in the BED format. It supports sorting, merging, intersection, subtraction and the calculation of the breadth of coverage. Bedtk uses implicit interval tree, a data structure for fast interval overlap queries. It is several to tens of times faster than existing tools and tends to use less memory. Availability and implementation The source code is available at https://github.com/lh3/bedtk.

One-sided variations on interval trees

2003 ◽  
Vol 40 (03) ◽  
pp. 654-670 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Hosam M. Mahmoud
Keyword(s):  
Differential Equations ◽  
Path Length ◽  
Analytic Approach ◽  
Tauberian Theorems ◽  
Random Structure ◽  
Delayed Differential Equations ◽  
Interval Tree ◽  
Binary Case ◽  
Interval Trees ◽  
Parameters Of Interest

The binary interval tree is a random structure that underlies interval division and parking problems. Five incomplete one-sided variants of binary interval trees are considered, providing additional flavors and variations on the main applications. The size of each variant is studied, and a Gaussian tendency is proved in each case via an analytic approach. Differential equations on half scale and delayed differential equations arise and can be solved asymptotically by local expansions and Tauberian theorems. Unlike the binary case, in an incomplete interval tree the size determines most other parameters of interest, such as the height or the internal path length.

scholarly journals Interval Tree and Its Application in Integer Factorization

2019 ◽  
Vol 11 (2) ◽  
pp. 103
Author(s):  
Xingbo WANG
Keyword(s):  
Binary Tree ◽  
Numerical Experiments ◽  
Simple Approach ◽  
Binary Trees ◽  
Integer Factorization ◽  
Interval Tree

The paper first puts forward a way to study odd integers by placing the odd integers in a given interval on a perfect full binary tree, then makes an investigation on the odd integers by means of combining the original properties of the integers with the properties of the binary trees and obtains several new results on how an odd integer's divisors distribute on a level of a binary tree. The newly discovered law of divisors' distribution that includes common divisors between two symmetric nodes, genetic divisors between an ancestor node and its descendant node can provide a new and simple approach to factorize odd composite integers. Based on the mathematical deductions, numerical experiments are designed and demonstrated in the Maple software. All the results of the experiments are conformance to expectation and validate the validity of the approach.

scholarly journals Radiocarbon Analysis of Tree Rings from a 15.5-Cal kyr BP Pyroclastically Buried Forest: A Pilot Study

Radiocarbon ◽  
2007 ◽  
Vol 49 (2) ◽  
pp. 1123-1132 ◽  
Author(s):  
Kazuho Horiuchi ◽  
Shinya Sonoda ◽  
Hiroyuki Matsuzaki ◽  
Motonari Ohyama
Keyword(s):  
Solar Activity ◽  
Tree Rings ◽  
Weighted Average ◽  
Activity Change ◽  
Last Glacial Period ◽  
Standard Curve ◽  
Regional Impacts ◽  
Interval Tree ◽  
Honshu Island ◽  
The Last Glacial

We have determined the radiocarbon ages for 40-yr-interval tree rings in 2 fossil trees of the Towada Hachinohe buried forest, northeastern Honshu Island, Japan. The 14C ages range from 13.0 to 13.3 kyr BP (about 15.5 cal kyr BP). The weighted average of the 14C age of the outermost 5 rings is 13,133 ± 33 BP, which can be calibrated to 15,363–15,679 cal BP by using the IntCal04 standard curve (Reimer et al. 2004). The estimated δ14C values range between 265 and 300% and show approximately sinusoidal fluctuation of an indicated ∼200-yr cycle, perhaps reflecting contemporary solar activity change. Comparison between the tree 14C profile and the Cariaco Basin 14C record provides further information on the accurate date of the Towada Hachinohe buried forest and the eruption that produced it. 14C analysis of tree rings from the buried forest may contribute to the construction of a better 14C calibration curve and the elucidation of solar activity change during the last glacial period, as well as possible global and regional impacts of the huge eruption from Towada Volcano.

A Data Structure on Interval Graphs and Its Applications

1997 ◽  
Vol 07 (03) ◽  
pp. 165-175 ◽  
Author(s):  
Madhumangal Pal ◽  
G. P. Bhattacharjee
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Interval Graph ◽  
Interval Graphs ◽  
Point Of View ◽  
Interval Tree

In this papar, a new data structure, interval tree (IT), is introduced for an interval graph. Some important properties of IT are studies from the algorithmic point of view. It has many advantages compared to the data structures which are commonly used to solve the problems on interval graphs. Using the properties of IT, the following problems are solved on interval graphs: (i) shortest distances between any two vertices, and (ii) the diameter of the graph.

scholarly journals Query co-planning for shared execution in key-value stores

2021 ◽  
Vol 12 (5) ◽  
Author(s):  
Josué Ttito ◽  
Renato Marroquín ◽  
Sergio Lifschitz ◽  
Lewis McGibbney ◽  
José Talavera
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Data Model ◽  
Range Queries ◽  
Model Data ◽  
Data Movement ◽  
Segment Tree ◽  
Interval Tree ◽  
Simple Interface ◽  
Arbitrary Objects

Key-value stores propose a straightforward yet powerful data model. Data is modeled using key-value pairs where values can be arbitrary objects and written/read using the key associated with it. In addition to their simple interface, such data stores also provide read operations such as full and range scans. However, due to the simplicity of its interface, trying to optimize data accesses becomes challenging. This work aims to enable the shared execution of concurrent range and point queries on key-value stores. Thus, reducing the overall data movement when executing a complete workload. To accomplish this, we analyze different possible data structures and propose our variation of a segment tree, Updatable Interval Tree. Our data structure helps us co-planning and co-executing multiple range queries together and reduces redundant work. This results in executing workloads more efficiently and overall increased throughput, as we show in our evaluation.

Sign in / Sign up

Export Citation Format

Share Document