PATRICIA — practical algorithm to retrieve information coded in alphanumeric. PATRICIA is an algorithm which provides a flexible means of storing, indexing, and retrieving information in a large file, which is economical of index space and of reindexing time. It does not require rearrangement of text or index as new material is added. It requires a minimum restriction of format of text and of keys; it is extremely flexible in the variety of keys it will respond to. It retrieves information in response to keys furnished by the user with a quantity of computation which has a bound which depends linearly on the length of keys and the number of their proper occurrences and is otherwise independent of the size of the library. It has been implemented in several variations as FORTRAN programs for the CDC-3600, utilizing disk file storage of text. It has been applied to several large information-retrieval problems and will be applied to others.
Keywords for this software
References in zbMATH (referenced in 51 articles )
Showing results 41 to 51 of 51.
- Murray, Neil V.; Rosenthal, Erik: Efficient query processing with reduced implicate tries (2007)
- Höpfner, Hagen: Anfragebasierte client-indexierung in client-server-informationssystemen (2006) ioport
- Navarro, Gonzalo; Chávez, Edgar: A metric index for approximate string matching (2006)
- Wong, Kam-Fai; Yu, Jeffrey Xu; Tang, Nan: Answering XML queries using path-based indexes: a survey (2006) ioport
- Devroye, Luc: Laws of large numbers and tail inequalities for random tries and PATRICIA trees (2002)
- Wang, Yingwei; Cercone, N.: Fast searches in a recommendation session. (2002)
- Giancarlo, Raffaele; Grossi, Roberto: Parallel construction and query of index data structures for pattern matching on square matrices (1999)
- Erlingsson, Úlfar; Krishnamoorthy, Mukkai; Raman, T. V.: Efficient multiway radix search trees (1996)
- Schachinger, Werner: On the variance of a class of inductive valuations of data structures for digital search (1995)
- Baeza-Yates, Ricardo A.: Searching subsequences (1991)
- Blumer, A.; Blumer, J.; Haussler, D.; Ehrenfeucht, A.; Chen, M. T.; Seiferas, J.: The smallest automaton recognizing the subwords of a text (1985)