Orthogonal range searching for text indexing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations


Text indexing, the problem in which one desires to preprocess a (usually large) text for future (shorter) queries, has been researched ever since the suffix tree was invented in the early 70's. With textual data continuing to increase and with changes in the way it is accessed, new data structures and new algorithmic methods are continuously required. Therefore, text indexing is of utmost importance and is a very active research domain. Orthogonal range searching, classically associated with the computational geometry community, is one of the tools that has increasingly become important for various text indexing applications. Initially, in the mid 90's there were a couple of results recognizing this connection. In the last few years we have seen an increase in use of this method and are reaching a deeper understanding of the range searching uses for text indexing. In this monograph we survey some of these results.

Original languageEnglish
Title of host publicationSpace-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday
PublisherSpringer Verlag
Number of pages36
ISBN (Print)9783642402722
StatePublished - 2013
EventConference on Space-Efficient Data Structures, Streams, and Algorithms - Waterloo, ON, Canada
Duration: 15 Aug 201316 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8066 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceConference on Space-Efficient Data Structures, Streams, and Algorithms
CityWaterloo, ON


Dive into the research topics of 'Orthogonal range searching for text indexing'. Together they form a unique fingerprint.

Cite this