I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distribution sort with randomized cycling
Journal of the ACM (JACM)
Scalable continuous query processing by tracking hotspots
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Tight bounds for dynamic convex hull queries (again)
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Cache-oblivious streaming B-trees
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
ACM Transactions on Algorithms (TALG)
Worst-case efficient range search indexing: invited tutorial
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
Recent Advances in Worst-Case Efficient Range Search Indexing
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Data Structures for Range Median Queries
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Succinct Index for Dynamic Dictionary Matching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
I/O-Efficient Contour Tree Simplification
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Theoretical Computer Science
Indexing for vector projections
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Dynamic planar range maxima queries
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Space efficient data structures for dynamic orthogonal range counting
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Amortized rigidness in dynamic cartesian trees
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Dynamic range majority data structures
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Dynamic range selection in linear space
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A dynamic stabbing-max data structure with sub-logarithmic query time
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
External memory orthogonal range reporting with fast updates
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Indexability of 2D range search revisited: constant redundancy and weak indivisibility
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
SIAM Journal on Computing
Proceedings of the VLDB Endowment
Orthogonal range searching in linear and almost-linear space
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Indexing for summary queries: Theory and practice
ACM Transactions on Database Systems (TODS)
Space efficient data structures for dynamic orthogonal range counting
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In this paper we present the external interval tree, an optimal external memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The external interval tree can be used in an optimal solution to the dynamic interval management problem, which is a central problem for object-oriented and temporal databases and for constraint logic programming. Part of the structure uses a weight-balancing technique for efficient worst-case manipulation of balanced trees, which is of independent interest. The external interval tree, as well as our new balancing technique, have recently been used to develop several efficient external data structures.