Chan et al., 2004 - Google Patents
Compressed index for a dynamic collection of textsChan et al., 2004
View PDF- Document ID
- 9927719654416720345
- Author
- Chan H
- Hon W
- Lam T
- Publication year
- Publication venue
- Annual Symposium on Combinatorial Pattern Matching
External Links
Snippet
Let T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (ie, O (n) bits), while supporting very efficient pattern matching [2, 4]. This paper extends the …
- 238000000034 method 0 description 14
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30952—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures using directory or table look-up
- G06F17/30955—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures using directory or table look-up using more than one table in sequence, i.e. systems with three or more layers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
- G06F17/3033—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30964—Querying
- G06F17/30979—Query processing
- G06F17/30985—Query processing by using string matching techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30613—Indexing
- G06F17/30619—Indexing indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30389—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30994—Browsing or visualization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30067—File systems; File servers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30908—Information retrieval; Database structures therefor; File system structures therefor of semistructured data, the undelying structure being taken into account, e.g. mark-up language structure data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chan et al. | Compressed indexes for dynamic text collections | |
| US6505206B1 (en) | Method for implementing an associative memory based on a digital trie structure | |
| US6499032B1 (en) | Method for implementing an associative memory based on a digital trie structure | |
| Sirén | Indexing variation graphs | |
| JP3849279B2 (en) | Index creation method and search method | |
| Munro et al. | Space-efficient construction of compressed indexes in deterministic linear time | |
| KR100414236B1 (en) | A search system and method for retrieval of data | |
| JP2957703B2 (en) | Method and memory structure for storing and retrieving data | |
| Chan et al. | Compressed index for a dynamic collection of texts | |
| EP0970430A1 (en) | Method for implementing an associative memory based on a digital trie structure | |
| Perego et al. | Compressed indexes for fast search of semantic data | |
| Chien et al. | Geometric BWT: compressed text indexing via sparse suffixes and range searching | |
| Hon et al. | Compressed index for dictionary matching | |
| Chen et al. | On the signature tree construction and analysis | |
| Prezza | In-place sparse suffix sorting | |
| Gupta et al. | A framework for dynamizing succinct data structures | |
| Kärkkäinen et al. | Full-text indexes in external memory | |
| Ayad et al. | Sparse suffix and LCP array: Simple, direct, small, and fast | |
| Hon et al. | Succinct index for dynamic dictionary matching | |
| Chan et al. | Dynamic dictionary matching and compressed suffix trees | |
| Köppl | Exploring regular structures in strings | |
| Lu | An Introduction to XML Query Processing and Keyword Search | |
| Pagh | Basic external memory data structures | |
| Kim et al. | Efficient processing of substring match queries with inverted variable-length gram indexes | |
| Navarro | (Worst-Case) Optimal Adaptive Dynamic Bitvectors |