Full-Text (Substring) Indexes in External Memory (Synthesis Lectures on Data Management)

0 avg rating
( 0 ratings by Goodreads )
 
9781608457953: Full-Text (Substring) Indexes in External Memory (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 was considered impractical due to excessive I/O costs. Despite this, algorithms developed in the last decade demonstrated that efficient external construction of full-text indexes is indeed possible.

This book is about large-scale construction and usage of full-text indexes. We focus mainly on suffix trees, and show efficient algorithms that can convert suffix trees to other kinds of full-text indexes and vice versa. There are four parts in this book. They are a mix of string searching theory with the reality of external memory constraints. The first part introduces general concepts of full-text indexes and shows the relationships between them. The second part presents the first series of external-memory construction algorithms that can handle the construction of full-text indexes for moderately large strings in the order of few gigabytes. The third part presents algorithms that scale for very large strings. The final part examines queries that can be facilitated by disk-resident full-text indexes.

Table of Contents: Structures for Indexing Substrings / External Construction of Suffix Trees / Scaling Up: When the Input Exceeds the Main Memory / Queries for Disk-based Indexes / Conclusions and Open Problems

"synopsis" may belong to another edition of this title.

Top Search Results from the AbeBooks Marketplace

1.

Barsky, Marina
Published by Morgan and Claypool Publishers (2011)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Morgan and Claypool Publishers, 2011. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 30.00
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

2.

Marina Barsky, Alex Thomo, Ulrike Stege
Published by Morgan Claypool Publishers, United States (2012)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: 1
Seller:
The Book Depository US
(London, United Kingdom)
Rating
[?]

Book Description Morgan Claypool Publishers, United States, 2012. Paperback. Book Condition: New. Language: English . Brand New Book. 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 was considered impractical due to excessive I/O costs. Despite this, algorithms developed in the last decade demonstrated that efficient external construction of full-text indexes is indeed possible.This book is about large-scale construction and usage of full-text indexes. We focus mainly on suffix trees, and show efficient algorithms that can convert suffix trees to other kinds of full-text indexes and vice versa. There are four parts in this book. They are a mix of string searching theory with the reality of external memory constraints. The first part introduces general concepts of full-text indexes and shows the relationships between them. The second part presents the first series of external-memory construction algorithms that can handle the construction of full-text indexes for moderately large strings in the order of few gigabytes. The third part presents algorithms that scale for very large strings. The final part examines queries that can be facilitated by disk-resident full-text indexes. Bookseller Inventory # AAN9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 38.40
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

3.

Marina Barsky, Alex Thomo, Ulrike Stege
Published by Morgan Claypool Publishers, United States (2012)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: 1
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description Morgan Claypool Publishers, United States, 2012. Paperback. Book Condition: New. Language: English . Brand New Book. 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 was considered impractical due to excessive I/O costs. Despite this, algorithms developed in the last decade demonstrated that efficient external construction of full-text indexes is indeed possible.This book is about large-scale construction and usage of full-text indexes. We focus mainly on suffix trees, and show efficient algorithms that can convert suffix trees to other kinds of full-text indexes and vice versa. There are four parts in this book. They are a mix of string searching theory with the reality of external memory constraints. The first part introduces general concepts of full-text indexes and shows the relationships between them. The second part presents the first series of external-memory construction algorithms that can handle the construction of full-text indexes for moderately large strings in the order of few gigabytes. The third part presents algorithms that scale for very large strings. The final part examines queries that can be facilitated by disk-resident full-text indexes. Bookseller Inventory # AAN9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 39.50
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

4.

Marina Barsky, Alex Thomo, Ulrike Stege
Published by Morgan Claypool Publishers, United States (2012)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)
Rating
[?]

Book Description Morgan Claypool Publishers, United States, 2012. Paperback. Book Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. 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 was considered impractical due to excessive I/O costs. Despite this, algorithms developed in the last decade demonstrated that efficient external construction of full-text indexes is indeed possible.This book is about large-scale construction and usage of full-text indexes. We focus mainly on suffix trees, and show efficient algorithms that can convert suffix trees to other kinds of full-text indexes and vice versa. There are four parts in this book. They are a mix of string searching theory with the reality of external memory constraints. The first part introduces general concepts of full-text indexes and shows the relationships between them. The second part presents the first series of external-memory construction algorithms that can handle the construction of full-text indexes for moderately large strings in the order of few gigabytes. The third part presents algorithms that scale for very large strings. The final part examines queries that can be facilitated by disk-resident full-text indexes. Bookseller Inventory # LIE9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 41.91
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

5.

Barsky, Marina
Published by Morgan and Claypool Publishers (2011)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Morgan and Claypool Publishers, 2011. PAP. Book Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 31.09
Convert Currency

Add to Basket

Shipping: US$ 11.88
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Barsky, Marina; Thomo, Alex; Stege, Ulrike
Published by Morgan & Claypool Publishers (2011)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: 10
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Morgan & Claypool Publishers, 2011. Paperback. Book Condition: New. Bookseller Inventory # INGM9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 39.85
Convert Currency

Add to Basket

Shipping: US$ 4.99
Within U.S.A.
Destination, Rates & Speeds

7.

Barsky, Marina
Published by Morgan and Claypool Publishers (2011)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Quantity Available: 5
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Morgan and Claypool Publishers, 2011. PAP. Book Condition: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Bookseller Inventory # CE-9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 33.08
Convert Currency

Add to Basket

Shipping: US$ 11.88
From United Kingdom to U.S.A.
Destination, Rates & Speeds

8.

Marina Barsky
Published by Morgan & Claypool
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description Morgan & Claypool. Paperback. Book Condition: New. Paperback. 92 pages. Dimensions: 9.1in. x 7.4in. x 0.3in.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 was considered impractical due to excessive IO costs. Despite this, algorithms developed in the last decade demonstrated that efficient external construction of full-text indexes is indeed possible. This book is about large-scale construction and usage of full-text indexes. We focus mainly on suffix trees, and show efficient algorithms that can convert suffix trees to other kinds of full-text indexes and vice versa. There are four parts in this book. They are a mix of string searching theory with the reality of external memory constraints. The first part introduces general concepts of full-text indexes and shows the relationships between them. The second part presents the first series of external-memory construction algorithms that can handle the construction of full-text indexes for moderately large strings in the order of few gigabytes. The third part presents algorithms that scale for very large strings. The final part examines queries that can be facilitated by disk-resident full-text indexes. Table of Contents: Structures for Indexing Substrings External Construction of Suffix Trees Scaling Up: When the Input Exceeds the Main Memory Queries for Disk-based Indexes Conclusions and Open Problems This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Bookseller Inventory # 9781608457953

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 45.77
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

9.

Marina Barsky; Alex Thomo; Ulrike Stege
Published by Morgan & Claypool Publishers (2011)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: 1
Seller:
Irish Booksellers
(Rumford, ME, U.S.A.)
Rating
[?]

Book Description Morgan & Claypool Publishers, 2011. Paperback. Book Condition: New. book. Bookseller Inventory # M1608457958

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 50.75
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

10.

BARSKY, THOMO & STEGE
Published by Morgan & Claypool Publishers (2011)
ISBN 10: 1608457958 ISBN 13: 9781608457953
New Paperback Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description Morgan & Claypool Publishers, 2011. Paperback. Book Condition: NEW. 9781608457953 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE01045427

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 44.80
Convert Currency

Add to Basket

Shipping: US$ 10.56
From United Kingdom to U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book