Dynamic Interval Trees is a dynamic data structure that extends the interval tree to support efficient insertion and deletion of intervals while maintaining logarithmic time complexity for querying overlapping intervals.
5
Publications
368
Citations
11
Authors
11
Institutions
Publications per year
2017–2026
1
Parents
Publications
5
A comprehensive XQuery to SQL translation using dynamic interval encoding
David DeHaan, David Toman, Mariano P. Consens et al. · 2003 · 162 citations
Optimal External Memory Interval Management
Lars Arge, Jeffrey Scott Vitter · SIAM Journal on Computing · 2003 · 137 citations · Full text
Enhanced interval trees for dynamic IP router-tables
Haibin Lu, Sartaj Sahni · IEEE Transactions on Computers · 2004 · 28 citations
1–5 of 5
Authors
11
- DT
1
h-index
- JY
1
h-index
- LA
1
h-index
- CCChristophe Crespelle
Centre National de la Recherche Scientifique, France
1 publications · 10 citations
1
h-index
- MP
1
h-index
1–5 of 11
Institutions
11
Université Claude Bernard Lyon 1
Villeurbanne, France
1 h-index
1 publications
10 citations
Université Paris Cité
Paris, France
1 h-index
1 publications
10 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
1 publications
137 citations
Sorbonne Université
Paris, France
1 h-index
1 publications
10 citations
École Normale Supérieure de Lyon
Lyon, France
1 h-index
1 publications
10 citations
Duke University
Durham, United States
1 h-index
1 publications
137 citations
Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
10 citations
National Information Society Agency
Seoul, South Korea
1 h-index
1 publications
31 citations
1–8 of 11
Venues
- SIAM Journal on Computing
1 publications · 137 citations
1
h-index
- Journal of Systems and Software
JSS · 1 publications · 31 citations
1
h-index
- IEEE Transactions on Computers
1 publications · 28 citations
1
h-index
- Theoretical Computer Science
1 publications · 10 citations
1
h-index
1–4