Hierarchical File Organization and Its Application to Similar-String Matching.

@article{DBLP:journals/tods/ItoK83,
  author    = {Tetsuro Ito and
               Makoto Kizawa},
  title     = {Hierarchical File Organization and Its Application to Similar-String
               Matching},
  journal   = {ACM Trans. Database Syst.},
  volume    = {8},
  number    = {3},
  year      = {1983},
  pages     = {410-433},
  ee        = {http://doi.acm.org/10.1145/319989.319994, db/journals/tods/ItoK83.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1983 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.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX

[2]

Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979) BibTeX

[3]

Walter A. Burkhard, Robert M. Keller: Some Approaches to Best-Match File Searching. Commun. ACM 16(4): 230-236(1973) BibTeX

[4]

Stuart K. Card, Thomas P. Moran, Allen Newell: The Keystroke-Level Model for User Performance Time with Interactice Systems. Commun. ACM 23(7): 396-410(1980) BibTeX

[5]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX

[6]

Manuel R. DeSousa: Electronic Information Interchange in an Office Environment. IBM Systems Journal 20(1): 4-22(1981) BibTeX

[7]

...

[8]

Clarence A. Ellis, Gary J. Nutt: Office Information Systems and Computer Science. ACM Comput. Surv. 12(1): 27-60(1980) BibTeX

[9]

...

[10]

Jerome H. Friedman, Jon Louis Bentley, Raphael A. Finkel: An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Trans. Math. Softw. 3(3): 209-226(1977) BibTeX

[11]

Patrick A. V. Hall, Geoff R. Dowling: Approximate String Matching. ACM Comput. Surv. 12(4): 381-402(1980) BibTeX

[12]

Tetsuro Ito, Makoto Kizawa: The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles. ACM Trans. Math. Softw. 3(3): 227-231(1977) BibTeX

[13]

...

[14]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[15]

James L. Peterson: Computer Programs for Detecting and Correcting Spelling Errors. Commun. ACM 23(12): 676-687(1980) BibTeX

[16]

...

[17]

Dennis Ritchie, Ken Thompson: The UNIX Time-Sharing System. Commun. ACM 17(7): 365-375(1974) BibTeX

[18]

P. J. Robinson, Dave Singer: Another Spelling Correction Program. Commun. ACM 24(5): 296-297(1981) BibTeX

[19]

...

[20]

John Salasin: Hierarchical Storage in Information Retrieval. Commun. ACM 16(5): 291-295(1973) BibTeX

[21]

...

[22]

Gerard Salton, A. Wong: Generation and Search of Clustered Files. ACM Trans. Database Syst. 3(4): 321-346(1978) BibTeX

[23]

Marvin B. Shapiro: The Choice of Reference Points in Best-Match File Searching. Commun. ACM 20(5): 339-343(1977) BibTeX

[24]

...

[25]

William E. Wright: Binary Search Trees in Secondary Memory. Acta Inf. 15: 3-17(1981) BibTeX

[26]

...

[27]

...

Referenced by

1. Jason Tsong-Li Wang, Dennis Shasha: Query Processing for Distance Metrics. VLDB 1990: 602-613