Communication issues in large-scale geometric computation
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
I/O-efficient algorithms and environments
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Indexing schemes for random points
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
A provably efficient computational model for approximate spatiotemporal retrieval
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Scalable isosurface visualization of massive datasets on COTS clusters
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Parallel and out-of-core view-dependent isocontour visualization using random data distribution
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Managing Intervals Efficiently in Object-Relational Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
2-D Spatial Indexing Scheme in Optimal Time
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Framework for Index Bulk Loading and Dynamization
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximation Techniques for Indexing Two-Dimensional Constraint Databases
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On Multi-way Spatial Joins with Direction Predicates
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Optimised Predecessor Data Structures for Internal Memory
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Journal of Computer and System Sciences - Special issue on PODS 2000
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
Journal of Parallel and Distributed Computing
Efficient indexing methods for probabilistic threshold queries over uncertain data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Value-based notification conditions in large-scale publish/subscribe systems?
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scalable isosurface visualization of massive datasets on commodity off-the-shelf clusters
Journal of Parallel and Distributed Computing
Randomized multi-pass streaming skyline algorithms
Proceedings of the VLDB Endowment
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Techniques for indexing and querying temporal observations for a collection of objects
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Dynamic top-k range reporting in external memory
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Proceedings of the VLDB Endowment
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The authors present a space- and I/O-optimal external-memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The data structure settles an open problem in databases and I/O algorithms by providing the first optimal external-memory solution to the dynamic interval management problem, which is a special case of 2-dimensional range searching and a central problem for object-oriented and temporal databases and for constraint logic programming. The data structure simultaneously uses optimal linear space (that is, O(N/B) blocks of disk space) and achieves the optimal O(log/sub B/ N+T/B) I/O query bound and O(log/sub B/ N) I/O update bound, where B is the I/O block size and T the number of elements in the answer to a query. The structure is also the first optimal external data structure for a 2-dimensional range searching problem that has worst-case as opposed to amortized update bounds. Part of the data structure uses a novel balancing technique for efficient worst-case manipulation of balanced trees, which is of independent interest.