Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,499,848 papers from all fields of science
Search
Sign In
Create Free Account
Interval tree
In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Binary heap
Computer science
Herbert Edelsbrunner
Introduction to Algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Quantifying recent variation and relatedness in human populations
A. Gusev
2012
Corpus ID: 89955531
Quantifying Recent Variation and Relatedness in Human Populations
2011
2011
Threshold Interval Indexing for Complicated Uncertain Data
Andrew Knight
,
M. Rege
2011
Corpus ID: 17412484
Uncertain data is an increasingly prevalent topic in database research, given the advance of instruments which inherently…
Expand
2009
2009
Substring Statistics
Kyoji Umemura
,
Kenneth Ward Church
Conference on Intelligent Text Processing and…
2009
Corpus ID: 15249488
The goal of this work is to make it practical to compute corpus-based statistics for all substrings (ngrams). Anything you can do…
Expand
2005
2005
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
Christoph Brochhaus
,
Jost Enderle
,
Achim Schlosser
,
T. Seidl
,
Knut Stolze
Datenbanksysteme für Business, Technologie und…
2005
Corpus ID: 17362086
User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database…
Expand
2005
2005
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
Jost Enderle
,
Nicole L. Schneider
,
T. Seidl
Very Large Data Bases Conference
2005
Corpus ID: 3436011
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is…
Expand
2005
2005
Efficient interval management using object-relational database servers
Christoph Brochhaus
,
Jost Enderle
,
Achim Schlosser
,
T. Seidl
,
Knut Stolze
Informatik - Forschung und Entwicklung
2005
Corpus ID: 36870761
User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database…
Expand
2004
2004
A Cost Model for Spatial Intersection Queries on RI-Trees
H. Kriegel
,
M. Pfeifle
,
Marco Pötke
,
T. Seidl
International Conference on Database Systems for…
2004
Corpus ID: 5249742
The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications…
Expand
2002
2002
A cost model for interval intersection queries on RI-trees
H. Kriegel
,
M. Pfeifle
,
Marco Pötke
,
T. Seidl
Proceedings 14th International Conference on…
2002
Corpus ID: 11959192
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With…
Expand
2001
2001
Object-Relational Indexing for General Interval Relationships
H. Kriegel
,
Marco Pötke
,
T. Seidl
International Symposium on Spatial and Temporal…
2001
Corpus ID: 7406204
Intervals represent a fundamental data type for temporal, scientific, and spatia l databases where time stamp s and point data…
Expand
1992
1992
Adaptive representation of histogram using interval tree
X. Yang
1992
Corpus ID: 124136060
Proposes a new data structure, called histogram interval tree, to represent a distribution of gray levels in terms of intervals…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE