The interval skip list: A data structure for finding all intervals that overlap a point

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 519 LNCS, Issue , 1991, Pages 153-164

  Hanson, Eric N ^a,b  

^a AIR FORCE RESEARCH LABORATORY   (United States)

^b WRIGHT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BINS; COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; HIGH LEVEL LANGUAGES; PATTERN MATCHING;

AVL TREE; BALANCED BINARY TREE; BALANCED TREES; BINARY SEARCH TREES; EXPECTED TIME; INTERVAL INDEXING; QUERY POINTS; SKIP LISTES;

TREES (MATHEMATICS);

EID: 85015226904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028258     Document Type: Conference Paper

References (12)

1. G. M. Adel'son-Vel'skii and E. M. Landis. An algorithm for the organization of information. Soviet Math. Dokl., 3, 1962.
2. H. Edelsbrunner. A new approach to rectangle intersections: Part I. International Journal of Computer Mathematics, 13(3–4):209–219, 1983.
3. H. Edelsbrunner. A new approach to rectangle intersections: Part II. International Journal of Computer Mathematics, 13(3–4):221–229, 1983.
4. Gaston H. Gonnet, J. Ian Munro, and Derick Wood. Direct dynamic structures for some line segment problems. Computer Vision, Graphics, and Image Processing, 23, 1983.
5. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, June 1984.
6. Eric N. Hanson. An initial report on the design of Ariel: a DBMS with an integrated production rule system. SIGMOD Record, 18(3), September 1989.
7. Eric N. Hanson and Moez Chaabouni. The IBS-tree: A data structure for finding all intervals that overlap a point. Technical Report WSU-CS-90-11, Dept. of Computer Science and Eng., Wright State Univ., April 1990. Submitted for publication.
8. Eric N. Hanson, Moez Chaabouni, Chang-ho Kim, and Yu-wang Wang. A predicate matching algorithm for database rule systems. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, May 1990.
9. Edward M. McCreight. Priority search trees. SIAM Journal of Computing, 14(2):257–278, 1985.
10. William Pugh. A skip list cookbook. Technical Report CS-TR-2286, Dept. of Computer Science, Univ. of Maryland, July 1989.
11. William Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), June 1990.
12. Hanan Samet. The Design and Analysis of Spatial Data Structures. Addision Wesley, 1990.