Searching algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Leipzig
Teubner
1987
|
| Ausgabe: | 1. Aufl. |
| Schriftenreihe: | Teubner-Texte zur Mathematik
99 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zsfassung in dt., franz. u. russ. Sprache |
| Beschreibung: | 123 S. graph. Darst. |
| ISBN: | 3322004333 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV002208645 | ||
| 003 | DE-604 | ||
| 005 | 20220608 | ||
| 007 | t | ||
| 008 | 890928s1987 d||| |||| 00||| eng d | ||
| 020 | |a 3322004333 |9 3-322-00433-3 | ||
| 035 | |a (OCoLC)17719145 | ||
| 035 | |a (DE-599)BVBBV002208645 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-384 |a DE-703 |a DE-739 |a DE-29T |a DE-355 |a DE-706 |a DE-634 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA76.9.D35 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 271 |0 (DE-625)143639: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a DAT 536f |2 stub | ||
| 100 | 1 | |a Wiedermann, Jiří |d 1948- |e Verfasser |0 (DE-588)135879396 |4 aut | |
| 245 | 1 | 0 | |a Searching algorithms |c Jiří Wiedermann |
| 250 | |a 1. Aufl. | ||
| 264 | 1 | |a Leipzig |b Teubner |c 1987 | |
| 300 | |a 123 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Teubner-Texte zur Mathematik |v 99 | |
| 500 | |a Zsfassung in dt., franz. u. russ. Sprache | ||
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Hashing (Computer science) | |
| 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 |
| 650 | 0 | 7 | |a Suchverfahren |0 (DE-588)4132315-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Suchverfahren |0 (DE-588)4132315-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 830 | 0 | |a Teubner-Texte zur Mathematik |v 99 |w (DE-604)BV000012607 |9 99 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001450759&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001450759 | ||
Datensatz im Suchindex
| _version_ | 1804116663178625024 |
|---|---|
| adam_text | CONTENTS:
1. INTRODUCTION 6
1.1 Motivation 6
1.2 State of the art 7
1.3 Form and contents of the book 8
2. BASIC NOTATIONS AND DEFINITIONS 9
2.1 Searching problems 9
2.2 Static *nd dynamic data types 10
2.3 Examples of searching problems 11
2.4 Taxonomy of searching algorithms 13
2.5 Computational model and complexity measures 13
3. ONE DIMENSIONAL SEARCHING: DICTIONARIES AND
PRIORITY QUEUES 15
3.1 Introduction 15
3.2 Address calculation based searching 16
3.2.1 A characteristic vector 16
3.2.2 A brute force approach 17
3.2.3 Hashing 18
3.2.4 Open addressing 18
3.2.5 Separate chaining 20
3.2.6 Growing hash tables 21
3.2.7 Optimal hash tables 21
3.2.8 Self adjusting hash tables 23
3.2.9 Sorted hash tables 23
3.2.10 Split sequence hash tables 24
3.2.11 The worst case of hashing 25
3.2.12 Perfect hashing 26
3.2.13 Minimal perfect hashing 27
3.2.14 Practical perfect hashing 29
3.2.15 Interpolation hashing 31
3.2.16 External interpolation hashing 33
3.2.17 Extendible hashing 34
3.2.18 Digital search trees 35
3.2.19 Tries 36
3.3 Associative searching 38
3.3.1 Unsorted array 38
3.3.2 Selforganizing sequential search
heuristics 39
3.3.3 Sorted array 41
3.3.4 Interpolation search 42
3.3.5 Interpolation binary search 43
3
3.3.6 Unbounded searching 44
3.3.7 Binary search trees 44
3.3.8 Balanced search trees 48
3.3.9 Weight balanced trees 49
3.3.10 Height balanced trees 51
3.3.11 Finger search trees 54
3.3.12 Optimum search trees 55
3.3.13 Splay trees 57
3.4 Minimal space searching 61
3.4.1 Minimal space data structures for
the dictionary problem 61
3.4.2 Block sorted array 62
3.4.3 Mesh sorted array 63
3.4.4 Rotated lists 65
3.4.5 An implicit data structure for the
dictionary problem that runs in
polylogarithmic time 67
4. MULTIDIMENSIONAL SEARCHING 71
4.1 Introduction 71
4.2 Basic problems of multidimensional searching 72
4.3 Exact match queries 73
4.3.1 Lexicographic searching in an array 73
4.3.2 Lexicographic search trees 75
4.4 Partial match query 78
4.4.1 k dimensional binary search trees 78
4.4.2 Implicit data structures for partial
match searching 81
4.4.3 Optimal partial match searching 81
4.4.4 Multidimensional tries for partial
match retrieval 83
4.4.5 Partitioned hashing 84
4.5 Interval match queries 85
4.5.1 Sequential searching 85
4.5.2 Projections 86
4.5.3 Grids 87
4.5.4 k d trees 89
4.5.5 Range trees 89
4.5.6 Optimal interval match searching 92
5. SYHTHETIZING EFFICIENT SOLUTIONS OF SEARCHING
PROBLEMS 93
5.1 Introduction 93
5.2 Class membership problem 93
4
5.2.1 Problem definition 93
5.2.2 Transforming searching problems into
class membership problems 94
5.2.3 Class membership problem in lattices 97
5.2.4 Lattices with trivial and total ordering 98
5.2.5 Lattices with partial ordering 99
5.2.6 Lattices with natural partial ordering 99
5.3 Dynamizing solutions of searching problems 102
5.3.1 Dynamization 102
5.3.2 Periodical reconstruction of data
structures 103
5.3.3 Continuous reconstruction of data
structures 105
5.3.4 Decomposable searching problems 107
5.3.5 Dynamization of decomposable searching
problems 108
5.3.6 The method of equal size substructures 108
5.3.7 The logarithmic method 110
5.3.8 Applications 112
References I15
5
|
| any_adam_object | 1 |
| author | Wiedermann, Jiří 1948- |
| author_GND | (DE-588)135879396 |
| author_facet | Wiedermann, Jiří 1948- |
| author_role | aut |
| author_sort | Wiedermann, Jiří 1948- |
| author_variant | j w jw |
| building | Verbundindex |
| bvnumber | BV002208645 |
| 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 | SK 130 SK 820 ST 130 ST 134 ST 271 ST 600 |
| classification_tum | DAT 536f |
| ctrlnum | (OCoLC)17719145 (DE-599)BVBBV002208645 |
| discipline | Informatik Mathematik |
| edition | 1. Aufl. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02102nam a2200553 cb4500</leader><controlfield tag="001">BV002208645</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220608 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1987 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3322004333</subfield><subfield code="9">3-322-00433-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)17719145</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002208645</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-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D35</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</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">ST 271</subfield><subfield code="0">(DE-625)143639:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 536f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wiedermann, Jiří</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135879396</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Searching algorithms</subfield><subfield code="c">Jiří Wiedermann</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Leipzig</subfield><subfield code="b">Teubner</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">123 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="490" ind1="1" ind2=" "><subfield code="a">Teubner-Texte zur Mathematik</subfield><subfield code="v">99</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zsfassung in dt., franz. u. russ. Sprache</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</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">Hashing (Computer science)</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="650" ind1="0" ind2="7"><subfield code="a">Suchverfahren</subfield><subfield code="0">(DE-588)4132315-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Suchverfahren</subfield><subfield code="0">(DE-588)4132315-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Teubner-Texte zur Mathematik</subfield><subfield code="v">99</subfield><subfield code="w">(DE-604)BV000012607</subfield><subfield code="9">99</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=001450759&sequence=000002&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-001450759</subfield></datafield></record></collection> |
| id | DE-604.BV002208645 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:42:05Z |
| institution | BVB |
| isbn | 3322004333 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001450759 |
| oclc_num | 17719145 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-384 DE-703 DE-739 DE-29T DE-355 DE-BY-UBR DE-706 DE-634 DE-11 DE-188 |
| owner_facet | DE-91 DE-BY-TUM DE-384 DE-703 DE-739 DE-29T DE-355 DE-BY-UBR DE-706 DE-634 DE-11 DE-188 |
| physical | 123 S. graph. Darst. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Teubner |
| record_format | marc |
| series | Teubner-Texte zur Mathematik |
| series2 | Teubner-Texte zur Mathematik |
| spelling | Wiedermann, Jiří 1948- Verfasser (DE-588)135879396 aut Searching algorithms Jiří Wiedermann 1. Aufl. Leipzig Teubner 1987 123 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Teubner-Texte zur Mathematik 99 Zsfassung in dt., franz. u. russ. Sprache Computer algorithms Data structures (Computer science) Hashing (Computer science) Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Suchverfahren (DE-588)4132315-4 gnd rswk-swf Suchverfahren (DE-588)4132315-4 s DE-604 Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s Teubner-Texte zur Mathematik 99 (DE-604)BV000012607 99 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001450759&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Wiedermann, Jiří 1948- Searching algorithms Teubner-Texte zur Mathematik Computer algorithms Data structures (Computer science) Hashing (Computer science) Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd Suchverfahren (DE-588)4132315-4 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4001183-5 (DE-588)4132315-4 |
| title | Searching algorithms |
| title_auth | Searching algorithms |
| title_exact_search | Searching algorithms |
| title_full | Searching algorithms Jiří Wiedermann |
| title_fullStr | Searching algorithms Jiří Wiedermann |
| title_full_unstemmed | Searching algorithms Jiří Wiedermann |
| title_short | Searching algorithms |
| title_sort | searching algorithms |
| topic | Computer algorithms Data structures (Computer science) Hashing (Computer science) Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd Suchverfahren (DE-588)4132315-4 gnd |
| topic_facet | Computer algorithms Data structures (Computer science) Hashing (Computer science) Datenstruktur Algorithmus Suchverfahren |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001450759&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000012607 |
| work_keys_str_mv | AT wiedermannjiri searchingalgorithms |