Algorithms and data structures for external memory:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Boston, Mass. [u.a.]
Now Publ.
2008
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Auch als : Foundations and trends in theoretical computer science, vol. 2, issue 4 ersch. |
Beschreibung: | XV, 174 S. graph. Darst. |
ISBN: | 9781601981066 1601981066 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV023371542 | ||
003 | DE-604 | ||
005 | 20091217 | ||
007 | t | ||
008 | 080701s2008 d||| |||| 00||| eng d | ||
020 | |a 9781601981066 |9 978-1-60198-106-6 | ||
020 | |a 1601981066 |9 1-60198-106-6 | ||
035 | |a (OCoLC)602246095 | ||
035 | |a (DE-599)BVBBV023371542 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-20 |a DE-19 |a DE-Aug4 | ||
050 | 0 | |a QA76.9.D35 | |
084 | |a ST 265 |0 (DE-625)143634: |2 rvk | ||
100 | 1 | |a Vitter, Jeffrey Scott |d 1955- |e Verfasser |0 (DE-588)121260348 |4 aut | |
245 | 1 | 0 | |a Algorithms and data structures for external memory |c Jeffrey Scott Vitter |
264 | 1 | |a Boston, Mass. [u.a.] |b Now Publ. |c 2008 | |
300 | |a XV, 174 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Auch als : Foundations and trends in theoretical computer science, vol. 2, issue 4 ersch. | ||
650 | 4 | |a Accès disque (Informatique) | |
650 | 4 | |a Structures de données (Informatique) | |
650 | 4 | |a Data structures (Computer science) | |
650 | 4 | |a Disk access (Computer science) | |
650 | 0 | 7 | |a Peripherer Speicher |0 (DE-588)4173792-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 2 | |a Peripherer Speicher |0 (DE-588)4173792-1 |D s |
689 | 0 | |5 DE-604 | |
856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016554794&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016554794 |
Datensatz im Suchindex
_version_ | 1804137739368529920 |
---|---|
adam_text | ALGORITHMS AND DATA STRUCTURES FOR EXTERNAL MEMORY JEFFREY SCOTT VITTER
DEPARTMENT OF COMPUTER SCIENCE PURDUE UNIVERSITY WEST LAFAYETTE INDIANA,
47907-2107 USA JSV@PURDUE.EDU THE ESSENCE OF KFTOUJLEDGE BOSTON - DELFT
CONTENTS 1 INTRODUCTION 1 1.1 OVERVIEW 4 2 PARALLEL DISK MODEL (PDM) 9
2.1 PDM AND PROBLEM PARAMETERS 11 2.2 PRACTICAL MODELING CONSIDERATIONS
14 2.3 RELATED MODELS, HIERARCHICAL MEMORY, AND CACHE-OBLIVIOUS
ALGORITHMS 16 3 FUNDAMENTAL I/O OPERATIONS AND BOUNDS 21 4 EXPLOITING
LOCALITY AND LOAD BALANCING 25 4.1 LOCALITY ISSUES WITH A SINGLE DISK 26
4.2 DISK STRIPING AND PARALLELISM WITH MULTIPLE DISKS 27 5 EXTERNAL
SORTING AND RELATED PROBLEMS 29 5.1 SORTING BY DISTRIBUTION 31 5.2
SORTING BY MERGING 38 5.3 PREFETCHING, CACHING, AND APPLICATIONS TO
SORTING 42 5.4 A GENERAL SIMULATION FOR PARALLEL DISKS 52 5.5 HANDLING
DUPLICATES: BUNDLE SORTING 53 5.6 PERMUTING 54 5.7 FAST FOURIER
TRANSFORM AND PERMUTATION NETWORKS 54 XIV CONTENTS 6 LOWER BOUNDS ON I/O
57 6.1 PERMUTING 57 6.2 LOWER BOUNDS FOR SORTING AND OTHER PROBLEMS 61 7
MATRIX AND GRID COMPUTATIONS 65 7.1 MATRIX OPERATIONS 65 7.2 MATRIX
TRANSPOSITION 66 8 BATCHED PROBLEMS IN COMPUTATIONAL GEOMETRY 69 8.1
DISTRIBUTION SWEEP 71 8.2 OTHER BATCHED GEOMETRIC PROBLEMS 76 9 BATCHED
PROBLEMS ON GRAPHS 77 9.1 SPARSIFICATION 80 9.2 SPECIAL CASES 81 9.3
SEQUENTIAL SIMULATION OF PARALLEL ALGORITHMS 81 10 EXTERNAL HASHING FOR
ONLINE DICTIONARY SEARCH 83 10.1 EXTENDIBLE HASHING 84 10.2
DIRECTORYLESS METHODS 87 10.3 ADDITIONAL PERSPECTIVES 87 11 MULTIWAY
TREE DATA STRUCTURES 89 11.1 B-TREES AND VARIANTS 89 11.2
WEIGHT-BALANCED B-TREES 92 11.3 PARENT POINTERS AND LEVEL-BALANCED
B-TREES 93 11.4 BUFFER TREES 95 12 SPATIAL DATA STRUCTURES AND RANGE
SEARCH 99 12.1 LINEAR-SPACE SPATIAL STRUCTURES 102 12.2 R-TREES 103
CONTENTS XV 12.3 BOOTSTRAPPING FOR 2-D DIAGONAL CORNER AND STABBING
QUERIES 107 12.4 BOOTSTRAPPING FOR THREE-SIDED ORTHOGONAL 2-D RANGE
SEARCH 110 12.5 GENERAL ORTHOGONAL 2-D RANGE SEARCH 112 12.6 OTHER TYPES
OF RANGE SEARCH 114 12.7 LOWER BOUNDS FOR ORTHOGONAL RANGE SEARCH 116 13
DYNAMIC AND KINETIC DATA STRUCTURES 119 13.1 DYNAMIC METHODS FOR
DECOMPOSABLE SEARCH PROBLEMS 119 13.2 CONTINUOUSLY MOVING ITEMS 121 14
STRING PROCESSING 123 14.1 INVERTED FILES 123 14.2 STRING B-TREES 124
14.3 SUFFIX TREES AND SUFFIX ARRAYS 127 14.4 SORTING STRINGS 127 15
COMPRESSED DATA STRUCTURES 129 15.1 DATA REPRESENTATIONS AND COMPRESSION
MODELS 130 15.2 EXTERNAL MEMORY COMPRESSED DATA STRUCTURES 133 16
DYNAMIC MEMORY ALLOCATION 139 17 EXTERNAL MEMORY PROGRAMMING
ENVIRONMENTS 141 CONCLUSIONS 145 NOTATIONS AND ACRONYMS 147 REFERENCES
151
|
adam_txt |
ALGORITHMS AND DATA STRUCTURES FOR EXTERNAL MEMORY JEFFREY SCOTT VITTER
DEPARTMENT OF COMPUTER SCIENCE PURDUE UNIVERSITY WEST LAFAYETTE INDIANA,
47907-2107 USA JSV@PURDUE.EDU THE ESSENCE OF KFTOUJLEDGE BOSTON - DELFT
CONTENTS 1 INTRODUCTION 1 1.1 OVERVIEW 4 2 PARALLEL DISK MODEL (PDM) 9
2.1 PDM AND PROBLEM PARAMETERS 11 2.2 PRACTICAL MODELING CONSIDERATIONS
14 2.3 RELATED MODELS, HIERARCHICAL MEMORY, AND CACHE-OBLIVIOUS
ALGORITHMS 16 3 FUNDAMENTAL I/O OPERATIONS AND BOUNDS 21 4 EXPLOITING
LOCALITY AND LOAD BALANCING 25 4.1 LOCALITY ISSUES WITH A SINGLE DISK 26
4.2 DISK STRIPING AND PARALLELISM WITH MULTIPLE DISKS 27 5 EXTERNAL
SORTING AND RELATED PROBLEMS 29 5.1 SORTING BY DISTRIBUTION 31 5.2
SORTING BY MERGING 38 5.3 PREFETCHING, CACHING, AND APPLICATIONS TO
SORTING 42 5.4 A GENERAL SIMULATION FOR PARALLEL DISKS 52 5.5 HANDLING
DUPLICATES: BUNDLE SORTING 53 5.6 PERMUTING 54 5.7 FAST FOURIER
TRANSFORM AND PERMUTATION NETWORKS 54 XIV CONTENTS 6 LOWER BOUNDS ON I/O
57 6.1 PERMUTING 57 6.2 LOWER BOUNDS FOR SORTING AND OTHER PROBLEMS 61 7
MATRIX AND GRID COMPUTATIONS 65 7.1 MATRIX OPERATIONS 65 7.2 MATRIX
TRANSPOSITION 66 8 BATCHED PROBLEMS IN COMPUTATIONAL GEOMETRY 69 8.1
DISTRIBUTION SWEEP 71 8.2 OTHER BATCHED GEOMETRIC PROBLEMS 76 9 BATCHED
PROBLEMS ON GRAPHS 77 9.1 SPARSIFICATION 80 9.2 SPECIAL CASES 81 9.3
SEQUENTIAL SIMULATION OF PARALLEL ALGORITHMS 81 10 EXTERNAL HASHING FOR
ONLINE DICTIONARY SEARCH 83 10.1 EXTENDIBLE HASHING 84 10.2
DIRECTORYLESS METHODS 87 10.3 ADDITIONAL PERSPECTIVES 87 11 MULTIWAY
TREE DATA STRUCTURES 89 11.1 B-TREES AND VARIANTS 89 11.2
WEIGHT-BALANCED B-TREES 92 11.3 PARENT POINTERS AND LEVEL-BALANCED
B-TREES 93 11.4 BUFFER TREES 95 12 SPATIAL DATA STRUCTURES AND RANGE
SEARCH 99 12.1 LINEAR-SPACE SPATIAL STRUCTURES 102 12.2 R-TREES 103
CONTENTS XV 12.3 BOOTSTRAPPING FOR 2-D DIAGONAL CORNER AND STABBING
QUERIES 107 12.4 BOOTSTRAPPING FOR THREE-SIDED ORTHOGONAL 2-D RANGE
SEARCH 110 12.5 GENERAL ORTHOGONAL 2-D RANGE SEARCH 112 12.6 OTHER TYPES
OF RANGE SEARCH 114 12.7 LOWER BOUNDS FOR ORTHOGONAL RANGE SEARCH 116 13
DYNAMIC AND KINETIC DATA STRUCTURES 119 13.1 DYNAMIC METHODS FOR
DECOMPOSABLE SEARCH PROBLEMS 119 13.2 CONTINUOUSLY MOVING ITEMS 121 14
STRING PROCESSING 123 14.1 INVERTED FILES 123 14.2 STRING B-TREES 124
14.3 SUFFIX TREES AND SUFFIX ARRAYS 127 14.4 SORTING STRINGS 127 15
COMPRESSED DATA STRUCTURES 129 15.1 DATA REPRESENTATIONS AND COMPRESSION
MODELS 130 15.2 EXTERNAL MEMORY COMPRESSED DATA STRUCTURES 133 16
DYNAMIC MEMORY ALLOCATION 139 17 EXTERNAL MEMORY PROGRAMMING
ENVIRONMENTS 141 CONCLUSIONS 145 NOTATIONS AND ACRONYMS 147 REFERENCES
151 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Vitter, Jeffrey Scott 1955- |
author_GND | (DE-588)121260348 |
author_facet | Vitter, Jeffrey Scott 1955- |
author_role | aut |
author_sort | Vitter, Jeffrey Scott 1955- |
author_variant | j s v js jsv |
building | Verbundindex |
bvnumber | BV023371542 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.9.D35 |
callnumber-search | QA76.9.D35 |
callnumber-sort | QA 276.9 D35 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 265 |
ctrlnum | (OCoLC)602246095 (DE-599)BVBBV023371542 |
discipline | Informatik |
discipline_str_mv | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01829nam a2200445 c 4500</leader><controlfield tag="001">BV023371542</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091217 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080701s2008 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781601981066</subfield><subfield code="9">978-1-60198-106-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1601981066</subfield><subfield code="9">1-60198-106-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)602246095</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023371542</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D35</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 265</subfield><subfield code="0">(DE-625)143634:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vitter, Jeffrey Scott</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121260348</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and data structures for external memory</subfield><subfield code="c">Jeffrey Scott Vitter</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, Mass. [u.a.]</subfield><subfield code="b">Now Publ.</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 174 S.</subfield><subfield code="b">graph. Darst.</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="500" ind1=" " ind2=" "><subfield code="a">Auch als : Foundations and trends in theoretical computer science, vol. 2, issue 4 ersch.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Accès disque (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Structures de données (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Disk access (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Peripherer Speicher</subfield><subfield code="0">(DE-588)4173792-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Peripherer Speicher</subfield><subfield code="0">(DE-588)4173792-1</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="m">GBV 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=016554794&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016554794</subfield></datafield></record></collection> |
id | DE-604.BV023371542 |
illustrated | Illustrated |
index_date | 2024-07-02T21:12:43Z |
indexdate | 2024-07-09T21:17:05Z |
institution | BVB |
isbn | 9781601981066 1601981066 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016554794 |
oclc_num | 602246095 |
open_access_boolean | |
owner | DE-20 DE-19 DE-BY-UBM DE-Aug4 |
owner_facet | DE-20 DE-19 DE-BY-UBM DE-Aug4 |
physical | XV, 174 S. graph. Darst. |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | Now Publ. |
record_format | marc |
spelling | Vitter, Jeffrey Scott 1955- Verfasser (DE-588)121260348 aut Algorithms and data structures for external memory Jeffrey Scott Vitter Boston, Mass. [u.a.] Now Publ. 2008 XV, 174 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Auch als : Foundations and trends in theoretical computer science, vol. 2, issue 4 ersch. Accès disque (Informatique) Structures de données (Informatique) Data structures (Computer science) Disk access (Computer science) Peripherer Speicher (DE-588)4173792-1 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Datenstruktur (DE-588)4011146-5 s Algorithmus (DE-588)4001183-5 s Peripherer Speicher (DE-588)4173792-1 s DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016554794&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Vitter, Jeffrey Scott 1955- Algorithms and data structures for external memory Accès disque (Informatique) Structures de données (Informatique) Data structures (Computer science) Disk access (Computer science) Peripherer Speicher (DE-588)4173792-1 gnd Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4173792-1 (DE-588)4011146-5 (DE-588)4001183-5 |
title | Algorithms and data structures for external memory |
title_auth | Algorithms and data structures for external memory |
title_exact_search | Algorithms and data structures for external memory |
title_exact_search_txtP | Algorithms and data structures for external memory |
title_full | Algorithms and data structures for external memory Jeffrey Scott Vitter |
title_fullStr | Algorithms and data structures for external memory Jeffrey Scott Vitter |
title_full_unstemmed | Algorithms and data structures for external memory Jeffrey Scott Vitter |
title_short | Algorithms and data structures for external memory |
title_sort | algorithms and data structures for external memory |
topic | Accès disque (Informatique) Structures de données (Informatique) Data structures (Computer science) Disk access (Computer science) Peripherer Speicher (DE-588)4173792-1 gnd Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Accès disque (Informatique) Structures de données (Informatique) Data structures (Computer science) Disk access (Computer science) Peripherer Speicher Datenstruktur Algorithmus |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016554794&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT vitterjeffreyscott algorithmsanddatastructuresforexternalmemory |