| 書目名稱 | Full-Text (Substring) Indexes in External Memory | | 編輯 | Marina Barsky,Ulrike Stege,Alex Thomo | | 視頻video | http://file.papertrans.cn/350/349503/349503.mp4 | | 叢書名稱 | Synthesis Lectures on Data Management | | 圖書封面 |  | | 描述 | Nowadays, textual databases are among the most rapidly growing collections of data. Some of these collections contain a new type of data that differs from classical numerical or textual data. These are long sequences of symbols, not divided into well-separated small tokens (words). The most prominent among such collections are databases of biological sequences, which are experiencing today an unprecedented growth rate. Starting in 2008, the "1000 Genomes Project" has been launched with the ultimate goal of collecting sequences of additional 1,500 Human genomes, 500 each of European, African, and East Asian origin. This will produce an extensive catalog of Human genetic variations. The size of just the raw sequences in this catalog would be about 5 terabytes. Querying strings without well-separated tokens poses a different set of challenges, typically addressed by building full-text indexes, which provide effective structures to index all the substrings of the given strings. Since full-text indexes occupy more space than the raw data, it is often necessary to use disk space for their construction. However, until recently, the construction of full-text indexes in secondary storage wa | | 出版日期 | Book 2012 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-01885-5 | | isbn_softcover | 978-3-031-00757-6 | | isbn_ebook | 978-3-031-01885-5Series ISSN 2153-5418 Series E-ISSN 2153-5426 | | issn_series | 2153-5418 | | copyright | Springer Nature Switzerland AG 2012 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 09:21
發(fā)表于 2025-3-21 19:44:16
