The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
The input/output complexity of sorting and related problems
Communications of the ACM
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
Wave-indices: indexing evolving databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient searching with linear constraints
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Databases for Tracking Mobile Units in Real Time
ICDT '99 Proceedings of the 7th International Conference on Database Theory
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Journal of Computer and System Sciences - Special issue on PODS 2000
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
Approximate counts and quantiles over sliding windows
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
This paper studies first-in-first-out (FIFO) indexes, each of which manages a dataset where objects are deleted in the same order as their insertions. We give a technique that converts a static data structure to a FIFO index for all decomposable problems, provided that the static structure can be constructed efficiently. We present FIFO access methods to solve several problems including half-plane search, nearest neighbor search, and extreme-point search. All of our structures consume linear space, and have optimal or near-optimal query cost.