On Effective Multi-Dimensional Indexing for Strings.

@inproceedings{DBLP:conf/sigmod/JagadishKS00,
  author    = {H. V. Jagadish and
               Nick Koudas and
               Divesh Srivastava},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {On Effective Multi-Dimensional Indexing for Strings},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {403-414},
  ee        = {http://doi.acm.org/10.1145/342009.335434, db/conf/sigmod/JagadishKS00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[1]

Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548

[2]

Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM Trans. Database Syst. 2(1): 11-26(1977)

[3]

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331

[4]

Paolo Ferragina, Roberto Grossi: A fully-dynamic data structure for external substring search (Extended Abstract). STOC 1995: 693-702

[5]

Paolo Ferragina, Roberto Grossi: Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. SODA 1996: 373-382

[6]

Paolo Ferragina, Roberto Grossi: The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. J. ACM 46(2): 236-280(1999)

[7]

Volker Gaede, Oliver Günther: Multidimensional Access Methods. ACM Comput. Surv. 30(2): 170-231(1998)

[8]

Gaston H. Gonnet, Ricardo A. Baeza-Yates, Tim Snider: New Indices for Text: Pat Trees and Pat Arrays. Information Retrieval: Data Structures & Algorithms 1992: 66-82

[9]

Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57

[10]

...

[11]

H. V. Jagadish, Olga Kapitskaia, Raymond T. Ng, Divesh Srivastava: Multi-Dimensional Substring Selectivity Estimation. VLDB 1999: 387-398

[12]

...

[13]

H. V. Jagadish, Laks V. S. Lakshmanan, Tova Milo, Divesh Srivastava, Dimitra Vista: Querying Network Directories. SIGMOD Conference 1999: 133-144

[14]

...

[15]

Edward M. McCreight: A Space-Economical Suffix Tree Construction Algorithm. J. ACM 23(2): 262-272(1976)

[16]

Donald R. Morrison: PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric. J. ACM 15(4): 514-534(1968)

[17]

John T. Robinson: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes. SIGMOD Conference 1981: 10-18

[18]

Nick Roussopoulos, Daniel Leifker: Direct Spatial Search on Pictorial Databases Using Packed R-Trees. SIGMOD Conference 1985: 17-31

[19]

Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley 1990

[20]

Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB 1987: 507-518

[21]

Kenneth C. Sevcik, Nick Koudas: Filter Trees for Managing Spatial Data over a Range of Size Granularities. VLDB 1996: 16-27

[22]

Udi Manber, Eugene W. Myers: Suffix Arrays: A New Method for On-Line String Searches. SIAM J. Comput. 22(5): 935-948(1993)