Barsky marina (11 Ergebnisse)
- Softcover
Anbieter: Books Puddle, New York, NY, USABooks Puddle
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 44,18
EUR 3,46 VersandVersand innerhalb von USAAnzahl: 4 verfügbar
Zustand: New. 1st edition NO-PA16APR2015-KAP.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 34,68
EUR 13,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.
- Softcover
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USAThriftBooks-Atlanta
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 95,37
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Paperback. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 29,15
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Full-Text (Substring) Indexes in External Memory | Marina Barsky (u. a.) | Taschenbuch | Synthesis Lectures on Data Management | xv | Englisch | 2011 | Springer | EAN 9783031007576 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]sp…ringer[dot]com | Anbieter: preigu.
- Softcover
- Print-on-Demand
Anbieter: Brook Bookstore On Demand, Napoli, NA, ItalienBrook Bookstore On Demand
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 28,61
EUR 4,00 VersandVersand von Italien nach USAAnzahl: Mehr als 20 verfügbar
Zustand: new. Questo è un articolo print on demand.
- Softcover
- Print-on-Demand
Anbieter: Basi6 International, Irving, TX, USABasi6 International
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 44,22
Versand gratisVersand innerhalb von USAAnzahl: 10 verfügbar
Zustand: Brand New. New. Delivery takes 20-25 days. Print on Demand.
- Softcover
- Print-on-Demand
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 41,02
EUR 7,58 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: New. Print on Demand.
- Softcover
- Print-on-Demand
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 42,77
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
Zustand: New. PRINT ON DEMAND.
- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 29,95
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 d…ivided 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 96 pp. Englisch.
- Softcover
- Print-on-Demand
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 28,42
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Marina Barsky is a Post-Doctoral Fellow in the Department of Computer Science at the University of Illinois at Urbana[1]Champaign, US. She received her PhD in Computer Science from the University of Victoria, British Co…lumbia, Canada in 2010. Her PhD resear.
- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 29,95
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 divid…ed 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 ProblemsSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 96 pp. Englisch.
