Tries for combined text and spatial data range search

We use tries to represent combined text and spatial data, and present a range search algorithm for reporting all 2-d points and rectangles from a set of size intersecting a query rectangle. Data and queries can include text. Our -d+ tries are evaluated experimentally (for up to 300,000) using uniform distributed random spatial data and randomly selected strings from a set of place names. For random queries, we find that -d+ tries have faster search times compared to naive search. The expected range search time for -d+ tries was determined theoretically, and found to agree with experimental results for =100,000 and

[1]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[2]  Luc Devroye,et al.  Analysis of range search for random k-d trees , 2001, Acta Informatica.

[3]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[4]  Philippe Flajolet,et al.  Partial match retrieval of multidimensional data , 1986, JACM.

[5]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[6]  Bradford G. Nickerson,et al.  Multidimensional Orthogonal Range Search Using Tries , 2003, CCCG.

[7]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[8]  Rene De La Briandais.  File searching using variable length keys , 1959, IRE-AIEE-ACM Computer Conference.

[9]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[10]  Gaston H. Gonnet,et al.  Fast text searching for regular expressions or automaton searching on tries , 1996, JACM.

[11]  Wojciech Szpankowski,et al.  Patricia tries again revisited , 1990, JACM.

[12]  Heping Shang.  Trie Methods for Text and Spatial Data on Secondary Storage , 1994 .

[13]  Helmut Prodinger,et al.  Multidimensional Digital Searching-Alternative Data Structures , 1994, Random Struct. Algorithms.

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[15]  Jack A. Orenstein.  Multidimensional Tries Used for Associative Searching , 1982, Inf. Process. Lett..