Communications of the ACM
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
The design of a document database
DOCPROCS '88 Proceedings of the ACM conference on Document processing systems
Data compression with finite windows
Communications of the ACM
Algorithms for string searching
ACM SIGIR Forum
ACM Computing Surveys (CSUR)
Bit-Tree: a data structure for fast file processing
Communications of the ACM
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
Estimating alphanumeric selectivity in the presence of wildcards
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
PAT-tree-based keyword extraction for Chinese information retrieval
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Axis-specified search: a fine-grained full-text search method for gathering and structuring excerpts
Proceedings of the third ACM conference on Digital libraries
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
IEPAD: information extraction based on pattern discovery
Proceedings of the 10th international conference on World Wide Web
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
B-trees: bearing fruits of all kinds
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
IEEE Micro
IEEE Micro
Tries for Approximate String Matching
IEEE Transactions on Knowledge and Data Engineering
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure
Information Processing and Management: an International Journal
Automatic information extraction from semi-structured Web pages by pattern discovery
Decision Support Systems - Web retrieval and mining
OVID: Design and Implementation of a Video-Object Database System
IEEE Transactions on Knowledge and Data Engineering
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
An Implementation of Longest Prefix Matching for IP Router on Plastic Cell Architecture
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Indexing Semistructured Data Using PATRICIA Tree
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
A Novel Full-Text Indexing Model for Chinese Text Retrieval
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
On the Evaluation of Path-Oriented Queries in Document Databases
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
A Metric Index for Approximate String Matching
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Adjacency Matrix Based Full-Text Indexing Models
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
External memory data structures
Handbook of massive data sets
Representations for enclosed arrays
APL '81 Proceedings of the international conference on APL
Documentation retrieval in a University Computer Center environment
ACM '69 Proceedings of the 1969 24th national conference
Building a complete inverted file for a set of text files in linear time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A pipelined memory architecture for high throughput network processors
Proceedings of the 30th annual international symposium on Computer architecture
Two-dimensional substring indexing
Journal of Computer and System Sciences - Special issu on PODS 2001
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
Building signature-trees on path signatures in document databases
Effective databases for text & document management
Signature file hierarchies and signature graphs: a new index method for object-oriented databases
Proceedings of the 2004 ACM symposium on Applied computing
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
PAT-trees with the deletion function as the learning device for linguistic patterns
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Translating unknown cross-lingual queries in digital libraries using a web-based approach
Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
NPSE: A High Performance Network Packet Search Engine
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe: Designers' Forum - Volume 2
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
LSH forest: self-tuning indexes for similarity search
WWW '05 Proceedings of the 14th international conference on World Wide Web
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast incremental updates for pipelined forwarding engines
IEEE/ACM Transactions on Networking (TON)
Dynamic pipelining: making IP-lookup truly scalable
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Hardware-based IP routing using partitioned lookup table
IEEE/ACM Transactions on Networking (TON)
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
PATRICIA - II: two level overlayed indexes for large libraries
ACM SIGIR Forum
A novel reconfigurable hardware architecture for IP address lookup
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Exact match search in sequence data using suffix trees
Proceedings of the 14th ACM international conference on Information and knowledge management
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
LZ trie and dictionary compression
Software—Practice & Experience
High-performance IPv6 forwarding algorithm for multi-core and multithreaded network processor
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Exploiting the Web as the multilingual corpus for unknown query translation
Journal of the American Society for Information Science and Technology
Worst case constant time priority queue
Journal of Systems and Software
Reconfigurable Web Wrapper Agents
IEEE Intelligent Systems
A metric index for approximate string matching
Theoretical Computer Science
On the Signature Tree Construction and Analysis
IEEE Transactions on Knowledge and Data Engineering
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
A TCAM-based distributed parallel IP lookup scheme and performance analysis
IEEE/ACM Transactions on Networking (TON)
Aldat: A retrospective on a work in progress
Information Systems
Mining contiguous sequential patterns from web logs
Proceedings of the 16th international conference on World Wide Web
Protecting Grid Data Transfer Services with Active Network Interfaces
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Dynamic Segment Trees for Ranges and Prefixes
IEEE Transactions on Computers
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Indexing schemes for similarity search in datasets of short protein fragments
Information Systems
OASIS: an online and accurate technique for local-alignment searches on biological sequences
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The SBC-tree: an index for run-length compressed sequences
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Contiguous item sequential pattern mining using UpDown Tree
Intelligent Data Analysis
Microprocessors & Microsystems
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Updating Reduced Implicate Tries
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Compressing Translation from Propositional Resolution to Natural Deduction
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Proximity Scoring Using Sentence-Based Inverted Index for Practical Full-Text Search
ECDL '08 Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries
An approximate string matching approach for handling incorrectly typed urls
Proceedings of the 17th ACM conference on Information and knowledge management
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data Compression for Proof Replay
Journal of Automated Reasoning
Expert Systems with Applications: An International Journal
Language Identification on the Web: Extending the Dictionary Method
CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
Dictionary-based order-preserving string compression for main memory column stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Identifying interaction sentences from biological literature using automatically extracted patterns
BioNLP '09 Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing
An unsupervised method for extracting domain-specific affixes in biological literature
BioNLP '07 Proceedings of the Workshop on BioNLP 2007: Biological, Translational, and Clinical Language Processing
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Prime Implicates and Reduced Implicate Tries
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
An evaluation of techniques for image searching and browsing on mobile devices
Proceedings of the 2009 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Provenance query evaluation: what's so special about it?
Proceedings of the 18th ACM conference on Information and knowledge management
Simple and fast IP lookups using binomial spanning trees
Computer Communications
Implementation of a parallel-search trie-based scheme for fast IP lookup
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Trie Partitioning in distributed PC based routers
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
Range trees with variable length comparisons
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
The bitmap Trie for fast prefix lookup
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Efficient and scalable indexing techniques for biological sequence data
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
An efficient dictionary mechanism based on double-byte
ICADL'07 Proceedings of the 10th international conference on Asian digital libraries: looking back 10 years and forging new frontiers
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The CPBT: a method for searching the prefixes using coded prefixes in B-tree
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Identifying Prime Implicate Branches in Reduced Implicate Tries
Fundamenta Informaticae - Methodologies for Intelligent Systems
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
IEEE/ACM Transactions on Networking (TON)
An internet protocol address clustering algorithm
SysML'08 Proceedings of the Third conference on Tackling computer systems problems with machine learning techniques
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Prefix tree indexing for similarity search and similarity joins on genomic data
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Range Tries for scalable address lookup
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
Journal of Experimental Algorithmics (JEA)
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
On building minimal automaton for subset matching queries
Information Processing Letters
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Sawja: static analysis workshop for java
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Memory-efficient and scalable virtual routers using FPGA
Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays
Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Space-efficient construction of Lempel-Ziv compressed text indexes
Information and Computation
Retrieving similar documents from the web
Journal of Web Engineering
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Counting colours in compressed strings
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
An n-gram frequency database reference to handle MWE extraction in NLP applications
MWE '11 Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World
An efficient management of correlation sets with broadcast
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Theory and practice of monotone minimal perfect hashing
Journal of Experimental Algorithmics (JEA)
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
A new unsupervised approach to word segmentation
Computational Linguistics
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Reducing the space requirement of LZ-Index
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
TrieC: a high-speed IPv6 lookup with fast updates using network processor
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Space-efficient construction of LZ-index
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the general signature trees
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient semantic-aware detection of near duplicate resources
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Verifying two lines of c with why3: an exercise in program verification
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
The wavelet trie: maintaining an indexed sequence of strings in compressed space
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Scalable sequence similarity search and join in main memory on multi-cores
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing - Volume 2
A faster grammar-based self-index
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Fast searches in a recommendation session
Mathematical and Computer Modelling: An International Journal
Efficient similarity search in very large string sets
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
On suffix extensions in suffix trees
Theoretical Computer Science
Detecting anomalies in netflow record time series by using a kernel function
AIMS'12 Proceedings of the 6th IFIP WG 6.6 international autonomous infrastructure, management, and security conference on Dependable Networks and Services
A Lempel-Ziv text index on secondary storage
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Optimization in a self-stabilizing service discovery framework for large scale systems
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Improved grammar-based compressed indexes
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient FIB caching using minimal non-overlapping prefixes
ACM SIGCOMM Computer Communication Review
On compressing and indexing repetitive sequences
Theoretical Computer Science
Colored range queries and document retrieval
Theoretical Computer Science
Future Generation Computer Systems
Pushing CDN-ISP collaboration to the limit
ACM SIGCOMM Computer Communication Review
Higher-Order reactive programming with incremental lists
ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
Sparse suffix tree construction in small space
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Re-Ordered FEGC and Block Based FEGC for Inverted File Compression
International Journal of Information Retrieval Research
| Hi-index | 0.04 |
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.