Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
Efficient text searching
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
An algorithm for string matching with a sequence of don't cares
Information Processing Letters
Self-alignments in words and their applications
Journal of Algorithms
A generalized suffix tree and its (un)expected asymptotic behaviors
SIAM Journal on Computing
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Transactions on Database Systems (TODS)
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Unstructured data bases or very efficient text searching
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient Text Searching of Regular Expressions (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Approximate String-Matching over Suffix Trees
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A graph-based recommender system for digital library
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Matchsimile: a flexible approximate matching tool for searching proper names
Journal of the American Society for Information Science and Technology
Database indexing for large DNA and protein sequence collections
The VLDB Journal — The International Journal on Very Large Data Bases
A New Indexing Method for Approximate String Matching
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Indexing Semistructured Data Using PATRICIA Tree
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A New Recognition Algorithm for Extended Regular Expressions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Searching large text collections
Handbook of massive data sets
RE-tree: an efficient index structure for regular expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Regular expression searching on compressed text
Journal of Discrete Algorithms
A graph model for E-commerce recommender systems
Journal of the American Society for Information Science and Technology
Properties-based retrieval and user decision states: user control and behavior modeling
Journal of the American Society for Information Science and Technology
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Newsmap: a knowledge map for online news
Decision Support Systems - Special issue: Collaborative work and knowledge management
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
Clustering and indexing of experience sequences for popularity-driven recommendations
Proceedings of the 3rd ACM workshop on Continuous archival and retrival of personal experences
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
RE-Tree: an efficient index structure for regular expressions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Optimization issues in inverted index-based entity annotation
Proceedings of the 3rd international conference on Scalable information systems
Information filtering and query indexing for an information retrieval model
ACM Transactions on Information Systems (TOIS)
Fast and compact regular expression matching
Theoretical Computer Science
Benchmarking Fulltext Search Performance of RDF Stores
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
A fast bit-parallel algorithm for matching extended regular expressions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
International Journal of Web and Grid Services
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
The compressed permuterm index
ACM Transactions on Algorithms (TALG)
Processing SPARQL queries with regular expressions in RDF databases
DTMBIO '10 Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics
XPath whole query optimization
Proceedings of the VLDB Endowment
Compressing regular expressions' DFA table by matrix decomposition
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
FEMTO: fast search of large sequence collections
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Improving regular-expression matching on strings using negative factors
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient subsequence search in databases
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.01 |
We present algorithms for efficient searching of regular expressions on preprocessed text, using a Patricia tree as a logical model for the index. We obtain searching algorithms that run in logarithmic expected time in the size of the text for a wide subclass of regular expressions, and in sublinear expected time for any regular expression. This is the first such algorithm to be found with this complexity.