The interval skip list: A data structure for finding all intervals that overlap a point
- 22 November 2005
- book chapter
- Published by Springer Nature
- p. 153-164
- https://doi.org/10.1007/bfb0028258
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- A predicate matching algorithm for database rule systemsPublished by Association for Computing Machinery (ACM) ,1990
- Hierarchical spatial data structuresPublished by Springer Nature ,1990
- An initial report on the design of Ariel DBMS with an integrated production rule systemACM SIGMOD Record, 1989
- Priority Search TreesSIAM Journal on Computing, 1985
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- Direct dynamic structures for some line segment problemsComputer Vision, Graphics, and Image Processing, 1983
- A new approach to rectangle intersectionsInternational Journal of Computer Mathematics, 1983
- A new approach to rectangle intersections part IInternational Journal of Computer Mathematics, 1983