Algorithm engineering for large data sets: hardware, software, algorithms
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Saarbrücken
VDM Verl. Dr. Müller
2007
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | X, 193 S. Ill., graph. Darst. 24 cm |
| ISBN: | 9783836447416 383644741X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023427202 | ||
| 003 | DE-604 | ||
| 005 | 20080825 | ||
| 007 | t | ||
| 008 | 080731s2007 gw ad|| m||| 00||| eng d | ||
| 015 | |a 07,N51,0007 |2 dnb | ||
| 015 | |a 08,H07,0017 |2 dnb | ||
| 016 | 7 | |a 986494429 |2 DE-101 | |
| 020 | |a 9783836447416 |c kart. : EUR 68.00, sfr 114.00 |9 978-3-8364-4741-6 | ||
| 020 | |a 383644741X |c kart. : EUR 68.00, sfr 114.00 |9 3-8364-4741-X | ||
| 024 | 3 | |a 9783836447416 | |
| 035 | |a (OCoLC)254418877 | ||
| 035 | |a (DE-599)DNB986494429 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-SL | ||
| 049 | |a DE-703 | ||
| 082 | 0 | |a 005.1 |2 22//ger | |
| 082 | 0 | |a 005.1 |2 22/ger | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Dementiev, Roman |d 1979- |e Verfasser |0 (DE-588)124503829 |4 aut | |
| 245 | 1 | 0 | |a Algorithm engineering for large data sets |b hardware, software, algorithms |c Roman Dementiev |
| 264 | 1 | |a Saarbrücken |b VDM Verl. Dr. Müller |c 2007 | |
| 300 | |a X, 193 S. |b Ill., graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Saarbrücken, Univ., Diss., 2006 | ||
| 650 | 4 | |a Effizienter Algorithmus - Datenauswertung | |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenauswertung |0 (DE-588)4131193-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | 1 | |a Datenauswertung |0 (DE-588)4131193-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016609542&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016609542 | |
Datensatz im Suchindex
| _version_ | 1805090872283365376 |
|---|---|
| adam_text |
CONTENTS 1 INTRODUCTION 1 1.1 I/O-EFFICIENT ALGORITHMS AND MODELS 3 1.2
DISK PARALLELISM IN STORAGE TECHNOLOGIES 4 1.3 MEMORY HIERARCHIES 6 1.4
ALGORITHM ENGINEERING FOR LARGE DATA SETS 9 1.5 C++ STANDARD TEMPLATE
LIBRARY 9 1.6 THE GOALS OF STXXL 10 1.7 SOFTWARE FACTS 11 1.8 STXXL
USERS 12 1.9 RELATED WORK 13 1.10 OUTLINE 15 2 BUILDING EXPERIMENTAL
PARALLEL DISK SYSTEMS 19 2.1 HARDWARE DISK INTERFACES 21 2.2 BUSSES,
CONTROLLERS, CHIPSETS 22 2.3 OUR FIRST SYSTEM 24 2.4 OTHER SYSTEMS 26
2.5 FILE SYSTEM ISSUES 26 3 THE STXXL LIBRARY 29 3.1 STXXL DESIGN 29 3.2
AIO LAYER 32 3.2.1 AIO LAYER IMPLEMENTATIONS 33 V GESCANNT DURCH
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/986494429 DIGITALISIERT
DURCH 4.4.2 SPANNING FOREST 101 VI CONTENTS 3.3 BM LAYER 36 3.4 STL
-USER LAYER 39 3.4.1 VECTOR 39 3.4.2 STACK 39 3.4.3 QUEUE 44 3.4.4 DEQUE
44 3.4.5 PRIORITY QUEUE 45 3.4.6 MAP . 50 3.4.7 GENERAL ISSUES
CONCERNING STXXL CONTAINERS 59 3.4.8 ALGORITHMS 60 3.5 PARALLEL DISK
SORTING 62 3.5.1 MULTI-WAY MERGE SORT WITH OVERLAPPED I/OS 65 3.5.2
IMPLEMENTATION DETAILS 69 3.5.3 EXPERIMENTS 70 3.5.4 DISCUSSION 78 3.6
ALGORITHM PIPELINING 79 3.7 STREAMING LAYER 79 4 ENGINEERING ALGORITHMS
FOR LARGE GRAPHS 85 4.1 OVERVIEW 85 4.2 MAXIMAL INDEPENDENT SET 87 4.3
MINIMUM SPANNING TREES 92 4.3.1 DEFINITIONS 92 4.3.2 RELATED WORK AND
MOTIVATION 92 4.3.3 SEMI-EXTERNAL ALGORITHM 93 4.3.4 NODE REDUCTION 93
4.3.5 EXPERIMENTS 98 4.3.6 CONCLUSIONS 100 4.4 CONNECTED COMPONENTS AND
SPANNING TREES 101 4.4.1 INTRODUCTION 101 5.5 I/O-OPTIMAL PIPELINED DC3
ALGORITHM 151 CONTENTS VII 4.4.3 CONNECTED COMPONENTS 102 4.4.4
EXPERIMENTS 103 4.5 BREADTH FIRST SEARCH 105 4.5.1 INTRODUCTION 105
4.5.2 INTERNAL MEMORY BFS 105 4.5.3 MR-BFS 106 4.5.4 MM-BFS 107 4.5.5
EXPERIMENTS 110 4.6 LISTING ALL TRIANGLES IN HUGE GRAPHS 113 4.6.1
I/O-EFFICIENT NODE-ITERATOR ALGORITHM 113 4.6.2 PIPELINED IMPLEMENTATION
114 4.6.3 EXPERIMENTS 116 4.7 GRAPH COLORING 117 4.7.1 INTRODUCTION 117
4.7.2 GREEDY COLORING 119 4.7.3 HIGHEST-DEGREE-FIRST HEURISTIC 120 4.7.4
BATCHED SMALLEST-DEGREE-LAST HEURISTIC 121 4.7.5 7-COIORING OF PLANAR
GRAPHS 124 4.7.6 6-COLORING OF PLANAR GRAPHS 127 4.7.7 2-COLORING 133
4.7.8 EXPERIMENTS 133 4.7.9 CONCLUSION AND FUTURE WORK 141 5 ENGINEERING
LARGE SUFFIX ARRAY CONSTRUCTION 143 5.1 INTRODUCTION 143 5.1.1 BASIC
CONCEPTS 144 5.1.2 OVERVIEW 144 5.2 DOUBLING ALGORITHM 145 5.3
DISCARDING 147 5.4 FROM DOUBLING TO A-TUPLING 150 A NOTATION 193 VIII
CONTENTS 5.6 GENERALIZED DIFFERENCE COVER ALGORITHM 154 5.7 CHECKER 156
5.8 EXPERIMENTS 157 5.8.1 THE CHECKER 163 5.9 AN ORACLE PL/SQL
IMPLEMENTATION 164 5.10 CONCLUSION 165 6 PORTING ALGORITHMS TO EXTERNAL
MEMORY 167 6.1 5-COLORING PLANAR GRAPHS 167 6.2 1/2-APPROXIMATION OF
MAXIMUM WEIGHTED MATCHING 168 6.2.1 DEFMITIONS 168 6.2.2 THE ALGORITHM
168 6.3 PERFECT MATCHINGS IN BIPARTITE MULTIGRAPHS 169 6.3.1 DEFINITIONS
169 6.3.2 INTRODUCTION 169 6.3.3 EULER PARTITION ALGORITHM 170 6.3.4
I/O-EFFICIENT PERFECT MATCHING ALGORITHM 171 7 CONCLUSIONS 173 |
| adam_txt |
CONTENTS 1 INTRODUCTION 1 1.1 I/O-EFFICIENT ALGORITHMS AND MODELS 3 1.2
DISK PARALLELISM IN STORAGE TECHNOLOGIES 4 1.3 MEMORY HIERARCHIES 6 1.4
ALGORITHM ENGINEERING FOR LARGE DATA SETS 9 1.5 C++ STANDARD TEMPLATE
LIBRARY 9 1.6 THE GOALS OF STXXL 10 1.7 SOFTWARE FACTS 11 1.8 STXXL
USERS 12 1.9 RELATED WORK 13 1.10 OUTLINE 15 2 BUILDING EXPERIMENTAL
PARALLEL DISK SYSTEMS 19 2.1 HARDWARE DISK INTERFACES 21 2.2 BUSSES,
CONTROLLERS, CHIPSETS 22 2.3 OUR FIRST SYSTEM 24 2.4 OTHER SYSTEMS 26
2.5 FILE SYSTEM ISSUES 26 3 THE STXXL LIBRARY 29 3.1 STXXL DESIGN 29 3.2
AIO LAYER 32 3.2.1 AIO LAYER IMPLEMENTATIONS 33 V GESCANNT DURCH
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/986494429 DIGITALISIERT
DURCH 4.4.2 SPANNING FOREST 101 VI CONTENTS 3.3 BM LAYER 36 3.4 STL
-USER LAYER 39 3.4.1 VECTOR 39 3.4.2 STACK 39 3.4.3 QUEUE 44 3.4.4 DEQUE
44 3.4.5 PRIORITY QUEUE 45 3.4.6 MAP . 50 3.4.7 GENERAL ISSUES
CONCERNING STXXL CONTAINERS 59 3.4.8 ALGORITHMS 60 3.5 PARALLEL DISK
SORTING 62 3.5.1 MULTI-WAY MERGE SORT WITH OVERLAPPED I/OS 65 3.5.2
IMPLEMENTATION DETAILS 69 3.5.3 EXPERIMENTS 70 3.5.4 DISCUSSION 78 3.6
ALGORITHM PIPELINING 79 3.7 STREAMING LAYER 79 4 ENGINEERING ALGORITHMS
FOR LARGE GRAPHS 85 4.1 OVERVIEW 85 4.2 MAXIMAL INDEPENDENT SET 87 4.3
MINIMUM SPANNING TREES 92 4.3.1 DEFINITIONS 92 4.3.2 RELATED WORK AND
MOTIVATION 92 4.3.3 SEMI-EXTERNAL ALGORITHM 93 4.3.4 NODE REDUCTION 93
4.3.5 EXPERIMENTS 98 4.3.6 CONCLUSIONS 100 4.4 CONNECTED COMPONENTS AND
SPANNING TREES 101 4.4.1 INTRODUCTION 101 5.5 I/O-OPTIMAL PIPELINED DC3
ALGORITHM 151 CONTENTS VII 4.4.3 CONNECTED COMPONENTS 102 4.4.4
EXPERIMENTS 103 4.5 BREADTH FIRST SEARCH 105 4.5.1 INTRODUCTION 105
4.5.2 INTERNAL MEMORY BFS 105 4.5.3 MR-BFS 106 4.5.4 MM-BFS 107 4.5.5
EXPERIMENTS 110 4.6 LISTING ALL TRIANGLES IN HUGE GRAPHS 113 4.6.1
I/O-EFFICIENT NODE-ITERATOR ALGORITHM 113 4.6.2 PIPELINED IMPLEMENTATION
114 4.6.3 EXPERIMENTS 116 4.7 GRAPH COLORING 117 4.7.1 INTRODUCTION 117
4.7.2 GREEDY COLORING 119 4.7.3 HIGHEST-DEGREE-FIRST HEURISTIC 120 4.7.4
BATCHED SMALLEST-DEGREE-LAST HEURISTIC 121 4.7.5 7-COIORING OF PLANAR
GRAPHS 124 4.7.6 6-COLORING OF PLANAR GRAPHS 127 4.7.7 2-COLORING 133
4.7.8 EXPERIMENTS 133 4.7.9 CONCLUSION AND FUTURE WORK 141 5 ENGINEERING
LARGE SUFFIX ARRAY CONSTRUCTION 143 5.1 INTRODUCTION 143 5.1.1 BASIC
CONCEPTS 144 5.1.2 OVERVIEW 144 5.2 DOUBLING ALGORITHM 145 5.3
DISCARDING 147 5.4 FROM DOUBLING TO A-TUPLING 150 A NOTATION 193 VIII
CONTENTS 5.6 GENERALIZED DIFFERENCE COVER ALGORITHM 154 5.7 CHECKER 156
5.8 EXPERIMENTS 157 5.8.1 THE CHECKER 163 5.9 AN ORACLE PL/SQL
IMPLEMENTATION 164 5.10 CONCLUSION 165 6 PORTING ALGORITHMS TO EXTERNAL
MEMORY 167 6.1 5-COLORING PLANAR GRAPHS 167 6.2 1/2-APPROXIMATION OF
MAXIMUM WEIGHTED MATCHING 168 6.2.1 DEFMITIONS 168 6.2.2 THE ALGORITHM
168 6.3 PERFECT MATCHINGS IN BIPARTITE MULTIGRAPHS 169 6.3.1 DEFINITIONS
169 6.3.2 INTRODUCTION 169 6.3.3 EULER PARTITION ALGORITHM 170 6.3.4
I/O-EFFICIENT PERFECT MATCHING ALGORITHM 171 7 CONCLUSIONS 173 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Dementiev, Roman 1979- |
| author_GND | (DE-588)124503829 |
| author_facet | Dementiev, Roman 1979- |
| author_role | aut |
| author_sort | Dementiev, Roman 1979- |
| author_variant | r d rd |
| building | Verbundindex |
| bvnumber | BV023427202 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)254418877 (DE-599)DNB986494429 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV023427202</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080825</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080731s2007 gw ad|| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N51,0007</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,H07,0017</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">986494429</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783836447416</subfield><subfield code="c">kart. : EUR 68.00, sfr 114.00</subfield><subfield code="9">978-3-8364-4741-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">383644741X</subfield><subfield code="c">kart. : EUR 68.00, sfr 114.00</subfield><subfield code="9">3-8364-4741-X</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783836447416</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254418877</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB986494429</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-SL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22//ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dementiev, Roman</subfield><subfield code="d">1979-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124503829</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm engineering for large data sets</subfield><subfield code="b">hardware, software, algorithms</subfield><subfield code="c">Roman Dementiev</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken</subfield><subfield code="b">VDM Verl. Dr. Müller</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 193 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Saarbrücken, Univ., Diss., 2006</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Effizienter Algorithmus - Datenauswertung</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenauswertung</subfield><subfield code="0">(DE-588)4131193-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Datenauswertung</subfield><subfield code="0">(DE-588)4131193-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016609542&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016609542</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV023427202 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:33:14Z |
| indexdate | 2024-07-20T09:46:43Z |
| institution | BVB |
| isbn | 9783836447416 383644741X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016609542 |
| oclc_num | 254418877 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | X, 193 S. Ill., graph. Darst. 24 cm |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | VDM Verl. Dr. Müller |
| record_format | marc |
| spelling | Dementiev, Roman 1979- Verfasser (DE-588)124503829 aut Algorithm engineering for large data sets hardware, software, algorithms Roman Dementiev Saarbrücken VDM Verl. Dr. Müller 2007 X, 193 S. Ill., graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Zugl.: Saarbrücken, Univ., Diss., 2006 Effizienter Algorithmus - Datenauswertung Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Datenauswertung (DE-588)4131193-0 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Effizienter Algorithmus (DE-588)4125422-3 s Datenauswertung (DE-588)4131193-0 s DE-604 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016609542&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Dementiev, Roman 1979- Algorithm engineering for large data sets hardware, software, algorithms Effizienter Algorithmus - Datenauswertung Effizienter Algorithmus (DE-588)4125422-3 gnd Datenauswertung (DE-588)4131193-0 gnd |
| subject_GND | (DE-588)4125422-3 (DE-588)4131193-0 (DE-588)4113937-9 |
| title | Algorithm engineering for large data sets hardware, software, algorithms |
| title_auth | Algorithm engineering for large data sets hardware, software, algorithms |
| title_exact_search | Algorithm engineering for large data sets hardware, software, algorithms |
| title_exact_search_txtP | Algorithm engineering for large data sets hardware, software, algorithms |
| title_full | Algorithm engineering for large data sets hardware, software, algorithms Roman Dementiev |
| title_fullStr | Algorithm engineering for large data sets hardware, software, algorithms Roman Dementiev |
| title_full_unstemmed | Algorithm engineering for large data sets hardware, software, algorithms Roman Dementiev |
| title_short | Algorithm engineering for large data sets |
| title_sort | algorithm engineering for large data sets hardware software algorithms |
| title_sub | hardware, software, algorithms |
| topic | Effizienter Algorithmus - Datenauswertung Effizienter Algorithmus (DE-588)4125422-3 gnd Datenauswertung (DE-588)4131193-0 gnd |
| topic_facet | Effizienter Algorithmus - Datenauswertung Effizienter Algorithmus Datenauswertung Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016609542&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT dementievroman algorithmengineeringforlargedatasetshardwaresoftwarealgorithms |