PATRICIA

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.


References in zbMATH (referenced in 51 articles )

Showing results 21 to 40 of 51.
Sorted by year (citations)
  1. Fuchs, Michael; Lee, Chung-Kuei: A general central limit theorem for shape parameters of (m)-ary tries and PATRICIA tries (2014)
  2. Gagie, Travis; Kärkkäinen, Juha; Navarro, Gonzalo; Puglisi, Simon J.: Colored range queries and document retrieval (2013)
  3. Hershcovitch, Moshe; Kaplan, Haim: I/O efficient dynamic data structures for longest prefix queries (2013)
  4. Kreft, Sebastian; Navarro, Gonzalo: On compressing and indexing repetitive sequences (2013)
  5. Arroyuelo, Diego; Navarro, Gonzalo; Sadakane, Kunihiko: Stronger Lempel-Ziv based compressed text indexing (2012)
  6. Breslauer, Dany; Italiano, Giuseppe F.: On suffix extensions in suffix trees (2012)
  7. Jansson, Jesper; Sadakane, Kunihiko; Sung, Wing-Kin: Ultra-succinct representation of ordered trees with applications (2012)
  8. Arroyuelo, Diego; Navarro, Gonzalo: Space-efficient construction of Lempel-Ziv compressed text indexes (2011)
  9. Gagie, Travis; Kärkkäinen, Juha: Counting colours in compressed strings (2011)
  10. Hubert, Laurent; Barré, Nicolas; Besson, Frédéric; Demange, Delphine; Jensen, Thomas; Monfort, Vincent; Pichardie, David; Turpin, Tiphaine: Sawja: static analysis workshop for Java (2011)
  11. Kniesburges, Sebastian; Scheideler, Christian: Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems (2011)
  12. Kreft, Sebastian; Navarro, Gonzalo: Self-indexing based on LZ77 (2011)
  13. Askitis, Nikolas; Sinha, Ranjan: Engineering scalable, cache and space efficient tries for strings (2010) ioport
  14. Drews, Frank; Lichtenberg, Jens; Welch, Lonnie: Scalable parallel word search in multicore/multiprocessor systems (2010) ioport
  15. Fredriksson, Kimmo: On building minimal automaton for subset matching queries (2010)
  16. Murray, Neil V.; Rosenthal, Erik: Linear response time for implicate and implicant queries (2010) ioport
  17. Claude, Francisco; Navarro, Gonzalo: Self-indexed text compression using straight-line programs (2009)
  18. Devroye, Luc; Lugosi, Gábor; Park, Gahyun; Szpankowski, Wojciech: Multiple choice tries and distributed hash tables (2009)
  19. Amjad, Hasan: Data compression for proof replay (2008)
  20. Broutin, N.; Devroye, L.; McLeish, E.: Weighted height of random trees (2008)