Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Bamberg
University of Bamberg Press
2019
|
| Schriftenreihe: | Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg
Band 38 |
| Schlagworte: | |
| Online-Zugang: | kostenfrei Inhaltsverzeichnis |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV046304044 | ||
| 003 | DE-604 | ||
| 005 | 20220418 | ||
| 007 | t | ||
| 008 | 191216s2019 gw a||| m||| 00||| eng d | ||
| 015 | |a 19,N40 |2 dnb | ||
| 016 | 7 | |a 1195795920 |2 DE-101 | |
| 020 | |a 9783863096724 |c Broschur : EUR 45.50 (DE), EUR 46.80 (AT) |9 978-3-86309-672-4 | ||
| 020 | |a 386309672X |9 3-86309-672-X | ||
| 024 | 3 | |a 9783863096724 | |
| 035 | |a (OCoLC)1121492045 | ||
| 035 | |a (DE-599)DNB1195795920 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BY | ||
| 049 | |a DE-473 |a DE-12 |a DE-22 | ||
| 084 | |a ST 265 |0 (DE-625)143634: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Kufer, Stefan |e Verfasser |0 (DE-588)120160334X |4 aut | |
| 245 | 1 | 0 | |a Effective and efficient summarization of two-dimensional point data |b approaches for resource description and selection in spatial application scenarios |c Stefan Kufer |
| 264 | 1 | |a Bamberg |b University of Bamberg Press |c 2019 | |
| 300 | |a XXIV, 501 Seiten |b Illustrationen, Diagramme, Karten |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg |v Band 38 | |
| 502 | |b Dissertation |c Otto-Friedrich-Universität Bamberg |d 2019 | ||
| 650 | 0 | 7 | |a Raumdaten |0 (DE-588)4206012-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Abfrage |0 (DE-588)4198788-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Geoinformatik |0 (DE-588)7571300-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nächste-Nachbarn-Problem |0 (DE-588)4376579-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Big Data |0 (DE-588)4802620-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Geoinformation |0 (DE-588)4429674-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Peer-to-Peer-Netz |0 (DE-588)4343110-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenanalyse |0 (DE-588)4123037-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ähnlichkeitssuche |0 (DE-588)4621546-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverwaltung |0 (DE-588)4011168-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a RDF |g Informatik |0 (DE-588)4737512-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mehrdimensionale Datenstruktur |0 (DE-588)4203964-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Geoinformatik |0 (DE-588)7571300-7 |D s |
| 689 | 0 | 1 | |a RDF |g Informatik |0 (DE-588)4737512-7 |D s |
| 689 | 0 | 2 | |a Big Data |0 (DE-588)4802620-7 |D s |
| 689 | 0 | 3 | |a Datenanalyse |0 (DE-588)4123037-1 |D s |
| 689 | 0 | 4 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Geoinformation |0 (DE-588)4429674-5 |D s |
| 689 | 1 | 1 | |a Raumdaten |0 (DE-588)4206012-6 |D s |
| 689 | 1 | 2 | |a Datenverwaltung |0 (DE-588)4011168-4 |D s |
| 689 | 1 | 3 | |a Ähnlichkeitssuche |0 (DE-588)4621546-3 |D s |
| 689 | 1 | 4 | |a Peer-to-Peer-Netz |0 (DE-588)4343110-0 |D s |
| 689 | 1 | 5 | |a Abfrage |0 (DE-588)4198788-3 |D s |
| 689 | 1 | 6 | |a Nächste-Nachbarn-Problem |0 (DE-588)4376579-8 |D s |
| 689 | 1 | 7 | |a Mehrdimensionale Datenstruktur |0 (DE-588)4203964-2 |D s |
| 689 | 1 | 8 | |a RDF |g Informatik |0 (DE-588)4737512-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 710 | 2 | |a University of Bamberg Press |0 (DE-588)1068114681 |4 pbl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:bvb:473-opus4-551376 |o 10.20378/irbo-55137 |z 978-3-86309-673-1 |
| 830 | 0 | |a Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg |v Band 38 |w (DE-604)BV035260948 |9 38 | |
| 856 | 4 | 1 | |u https://fis.uni-bamberg.de/handle/uniba/46917 |x Verlag |z kostenfrei |3 Volltext |
| 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=031681297&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031681297 | ||
Datensatz im Suchindex
| DE-473_call_number | 61/ST 265 GA 13001 60/ST 265 GA 13001a |
|---|---|
| DE-473_location | 0 6 |
| DE-BY-UBG_katkey | 196629115 |
| DE-BY-UBG_media_number | 013908392568 013908414576 |
| _version_ | 1811361245056466944 |
| adam_text | CONTENTS
GLOSSARY
XIII
PART
I:
BACKGROUND
AND
PROBLEM
DESCRIPTION
1
1
INTRODUCTION
3
1.1
MOTIVATION
.................................................................................
3
1.2
INVESTIGATED
APPLICATION
SCENARIOS
.........................................
7
1.2.1
DISTRIBUTED
APPLICATION
SCENARIO
...............................
8
1.2.2
CENTRALIZED
APPLICATION
SCENARIO
...............................
9
1.3
PROBLEM
DESCRIPTION
..................................................................
11
1.4
THESIS
OBJECTIVES
.....................................................................
13
1.5
THESIS
OUTLINE
...........................................................................
14
2
RELATED
WORK
19
2.1
COMPRESSING
DATA
.....................................................................
21
2.1.1
BIT
VECTOR
COMPRESSION
SCHEMES
...............................
21
2.1.2
FLOATING-POINT
DATA
COMPRESSION
SCHEMES
............
23
2.2
APPROXIMATING
A
POINT
SET
WITH
BOUNDING
VOLUMES
............
24
2.3
REPRESENTING
A
COMPLEX
OBJECT
WITH
A
SET
OF
SIMPLER
OBJECTS
26
2.3.1
POLYGON
DECOMPOSITION
PROBLEM
...............................
27
2.3.2 POLYGON
COVER
PROBLEM
...............................................
28
2.3.3
BINARY
IMAGE
COMPRESSION
.........................................
29
2.4
DIVIDING
A
SET
OF
POINTS
INTO
GROUPS
AND
REPRESENTING
EACH
GROUP
BY
A
SEPARATE
AREA
....................................................
30
2.4.1
CLUSTERING
.....................................................................
33
2.4.2
COMPUTATIONAL
GEOMETRY
............................................
34
2.4.3
MULTIDIMENSIONAL
DATA
STRUCTURES
............................
35
2.5
QUERYING
FOR
SPATIAL
DATA
.....................................................
49
2.6
FURTHER
RELATED
WORK
..............................................................
52
2.6.1
LINEAR
QUADTREE
ENCODINGS
.........................................
53
2.6.2
P2P
MULTIDIMENSIONAL
INDEXING
METHODS
AND
P2P
OVERLAY
NETWORKS
........................................................
54
2.6.3
METRIC
ACCESS
METHODS
...............................................
55
2.6.4
PTOLEMAIC
ACCESS
METHODS
............................................
58
PART
II:
DISTRIBUTED
APPLICATION
SCENARIO
59
3
PRELIMINARIES
FOR
THE
DISTRIBUTED
APPLICATION
SCENARIO
61
3.1
GENERAL
PRELIMINARIES
..............................................................
61
3.2
QUADTREE-RELATED
PRELIMINARIES
............................................
62
3.3
EXCURSUS:
DEALING
WITH
SPATIAL
ERRORS
..................................
66
X
CONTENTS
4
SUMMARIZATION
APPROACHES
FOR
SPATIAL
DATA
POINT
SETS
71
4.1
DATA
PARTITIONING
APPROACHES
...............................................
72
4.2
SPACE
PARTITIONING
APPROACHES
...............................................
75
4.3
HYBRID
APPROACHES
..................................................................
82
5
RESOURCE
SELECTION
99
5.1
CONCEPTUAL
RESOURCE
RANKING
ALGORITHMS
............................
100
5.2
A
CONCEPTUAL
&NN
ALGORITHM
................................................
104
6
GENERAL
EVALUATION
ENVIRONMENT
109
6.1
ASSESSMENT
OF
THE
RESULTS
.....................................................
109
6.2
DATA
COLLECTIONS
........................................................................
ILL
6.3
EXPERIMENTAL
SETUP
..................................................................
114
6.4
ADJUSTMENTS
FOR
SIMULATING
A
*
REAL-WORLD-SYSTEM
*
.............
117
6.4.1
ADJUSTMENTS
CONCERNING
THE
RESOURCE
DESCRIPTION
DATA
(AND
THEIR
CONSEQUENCES)
...................................
118
6.4.2
REDUCING
THE
INITIAL
QUERY
RADIUS
............................
123
6.4.3
SELECTION
OF
THE
SITES
AND
THE
TRAINING
DATA
.............
124
7
EXPERIMENTAL
RESULTS
*
ANALYSIS
OF
THE
T1
COLLECTION
127
7.1
GENERAL
OVERVIEW
OF
THE
RESULTS
............................................
127
7.1.1
ANALYSIS
OF
THE
SKYLINES
...............................................
128
7.1.2
ANALYSIS
OF
THE
KEY
FIGURES
FOR
THE
SKYLINE
PARAME
TERISATIONS
.........................................................
131
7.1.3
COMPARISON
OF
THE
APPROACHES
AT
*
MBRSIZE
*
............
144
7.2
RESULTS
FOR
THE
MBR-BASED
APPROACHES
...............................
148
7.3
RESULTS
FOR
THE
K-D-BASED
APPROACHES
...................................
151
7.4
RESULTS
FOR
THE
QUADTREE-BASED
APPROACHES
.........................
156
7.5
RESULTS
FOR
THE
VORONOI-BASED
APPROACHES
............................
162
7.6
COMPARISON
OF
THE
PURE
SPACE
PARTITIONING
APPROACHES
AND
THE
IMPROVEMENTS
ACHIEVABLE
BY
THEIR
SIMPLEST
HYBRID
EX
TENSIONS
.....................................................................................
169
8
IN-DEPTH
EVALUATION
OF
THE
SELECTED
APPROACHES
177
8.1
FURTHER
EVALUATION
OF
THE
T1
COLLECTION
...............................
181
8.1.1
RESULTS
AT
*
MBRSIZE
*
...................................................
182
8.1.2
RESULTS
AT
*
MBRSIZE-
*
................................................
186
8.1.3
RESULTS
AT
*
MBRSIZE+
*
................................................
198
8.2
EVALUATION
OF
THE
F
COLLECTION
...............................................
214
8.3
EVALUATION
OF
THE
T1
COLLECTION
(DISALLOWING
A
DIRECT
REPRE
SENTATION)
.........................................................................
224
8.4
EVALUATION
OF
THE
F
COLLECTION
(DISALLOWING
A
DIRECT
REPRE
SENTATION)
.........................................................................
230
8.5
EVALUATION
OF
THE
F
COLLECTION
WITH
AN
ALTERED
SELECTION
OF
THE
QUERY
POINTS
.....................................................................
233
8.6
EVALUATION
OF
THE
T2
COLLECTION
................................................
237
CONTENTS
XI
8.7
EVALUATION
OF
THE
SELECTED
APPROACHES
FOR
APPROXIMATE
SIM
ILARITY
SEARCH
..................................................................
243
8.8
EXCURSUS:
EVALUATION
OF
ADDITIONAL
PROPERTIES
...................
249
8.8.1
EVALUATION
OF
THE
QUERY
RADIUS
REDUCTION
.............
249
8.8.2
EVALUATION
OF
THE
DURATION
OF
THE
INITIAL
RESOURCE
RANKING
........................................................................
257
8.9
SUMMARIZATION
OF
THE
RESULTS
FOR
THE
DISTRIBUTED
APPLICA
TION
SCENARIO
......................................................................
262
8.9.1
KEY
RESULTS
OF
THE
EVALUATION
..................................
262
8.9.2
DEGREE
OF
THESIS
OBJECTIVE
ACHIEVEMENT
AND
CONTRI
BUTIONS
...............................................................
265
8.9.3
STARTING
POINTS
FOR
FUTURE
WORK
...............................
268
PART
III:
CENTRALIZED
APPLICATION
SCENARIO
273
9
PRELIMINARIES
AND
MOTIVATION
FOR
THE
CENTRALIZED
APPLICA
TION
SCENARIO
275
10
INTEGRATING
SUMMARIES
INTO
AN
R-TREE
279
10.1
THE
CLASSICAL
R-TREE
..................................................................
279
10.2
MODIFICATIONS
TO
THE
TRADITIONAL
R-TREE
...............................
284
10.2.1
SELECTBEST-MODIFICATIONS
.....................................
285
10.2.2
BACKTRACKING
OPTIMIZATION
.........................................
285
10.2.3
SPLIT-MODIFICATIONS
.....................................................
286
10.3
REQUIREMENTS
FOR
SUMMARIES
IN
AN
R-TREE
............................
286
10.4
SUMMARY-FROM-SUMMARIES
CALCULATION
AND
STORAGE
STRUC
TURES
..................................................................................
288
10.4.1
MBRQT
CA
.....................................................................
289
10.4.2
QTMBR*?
A
.....................................................................
291
10.5
EFFECTS
AND
TRADE-OFFS
OF
THE
INTEGRATION
OF
SOPHISTICATED
SUMMARIZATION
APPROACHES
..................................................
293
11
QUERY
ALGORITHMS
295
11.1
RANGE
QUERY
ALGORITHM
...........................................................
295
11.2
&NN
QUERY
ALGORITHM
...........................................................
295
12
EVALUATION
ENVIRONMENT
299
12.1
ASSESSMENT
OF
THE
RESULTS
.....................................................
299
12.2
DATA
COLLECTIONS
........................................................................
299
12.3
EXPERIMENTAL
SETUP
.................................................................
300
13
EVALUATION
307
13.1
ASSESSMENT
OF
THE
R-TREE
CONSTRUCTION
TIMES
......................
307
13.2
ASSESSMENT
OF
THE
STRUCTURAL
DIFFERENCES
............................
318
13.2.1
MBR-LIKE
R-TREES
.......................................................
318
XII
CONTENTS
13.2.2
SUMMARY-LIKE
R-TREES
................................................
345
13.3
ASSESSMENT
OF
THE
QUERY
RESULTS
............................................
370
13.3.1
RESULTS
FOR
THE
T_5
SCENARIO
.........................................
370
13.3.2
RESULTS
FOR
THE
T_25
SCENARIO
......................................
400
13.3.3
RESULTS
FOR
THE
R_5
SCENARIO
.........................................
408
13.3.4
RESULTS
FOR
THE
R_25
SCENARIO
......................................
422
13.4
SUMMARIZATION
OF
THE
RESULTS
FOR
THE
CENTRALIZED
APPLICA
TION
SCENARIO
..............................................................................
428
13.4.1
KEY
RESULTS
OF
THE
EVALUATION
...................................
428
13.4.2
DEGREE
OF
THESIS
OBJECTIVE
ACHIEVEMENT
AND
CONTRI
BUTIONS
...........................................................................
438
13.4.3
STARTING
POINTS
FOR
FUTURE
WORK
...............................
439
PART
IV:
CONCLUSION
449
14
OVERALL
CONCLUSION
451
A.
APPENDIX
453
LIST
OF
FIGURES
457
LIST
OF
TABLES
471
REFERENCES
479
|
| any_adam_object | 1 |
| author | Kufer, Stefan |
| author_GND | (DE-588)120160334X |
| author_facet | Kufer, Stefan |
| author_role | aut |
| author_sort | Kufer, Stefan |
| author_variant | s k sk |
| building | Verbundindex |
| bvnumber | BV046304044 |
| classification_rvk | ST 265 |
| collection | ebook |
| ctrlnum | (OCoLC)1121492045 (DE-599)DNB1195795920 |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03834nam a2200793 cb4500</leader><controlfield tag="001">BV046304044</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220418 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">191216s2019 gw a||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">19,N40</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1195795920</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783863096724</subfield><subfield code="c">Broschur : EUR 45.50 (DE), EUR 46.80 (AT)</subfield><subfield code="9">978-3-86309-672-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">386309672X</subfield><subfield code="9">3-86309-672-X</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783863096724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1121492045</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1195795920</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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-BY</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-22</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="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kufer, Stefan</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120160334X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Effective and efficient summarization of two-dimensional point data</subfield><subfield code="b">approaches for resource description and selection in spatial application scenarios</subfield><subfield code="c">Stefan Kufer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bamberg</subfield><subfield code="b">University of Bamberg Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIV, 501 Seiten</subfield><subfield code="b">Illustrationen, Diagramme, Karten</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="490" ind1="1" ind2=" "><subfield code="a">Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg</subfield><subfield code="v">Band 38</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Otto-Friedrich-Universität Bamberg</subfield><subfield code="d">2019</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Raumdaten</subfield><subfield code="0">(DE-588)4206012-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abfrage</subfield><subfield code="0">(DE-588)4198788-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geoinformatik</subfield><subfield code="0">(DE-588)7571300-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nächste-Nachbarn-Problem</subfield><subfield code="0">(DE-588)4376579-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Big Data</subfield><subfield code="0">(DE-588)4802620-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geoinformation</subfield><subfield code="0">(DE-588)4429674-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Peer-to-Peer-Netz</subfield><subfield code="0">(DE-588)4343110-0</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">Datenanalyse</subfield><subfield code="0">(DE-588)4123037-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ähnlichkeitssuche</subfield><subfield code="0">(DE-588)4621546-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverwaltung</subfield><subfield code="0">(DE-588)4011168-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">RDF</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4737512-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrdimensionale Datenstruktur</subfield><subfield code="0">(DE-588)4203964-2</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">Geoinformatik</subfield><subfield code="0">(DE-588)7571300-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">RDF</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4737512-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Big Data</subfield><subfield code="0">(DE-588)4802620-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Datenanalyse</subfield><subfield code="0">(DE-588)4123037-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Geoinformation</subfield><subfield code="0">(DE-588)4429674-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Raumdaten</subfield><subfield code="0">(DE-588)4206012-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Datenverwaltung</subfield><subfield code="0">(DE-588)4011168-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Ähnlichkeitssuche</subfield><subfield code="0">(DE-588)4621546-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Peer-to-Peer-Netz</subfield><subfield code="0">(DE-588)4343110-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="5"><subfield code="a">Abfrage</subfield><subfield code="0">(DE-588)4198788-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="6"><subfield code="a">Nächste-Nachbarn-Problem</subfield><subfield code="0">(DE-588)4376579-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="7"><subfield code="a">Mehrdimensionale Datenstruktur</subfield><subfield code="0">(DE-588)4203964-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="8"><subfield code="a">RDF</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4737512-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">University of Bamberg Press</subfield><subfield code="0">(DE-588)1068114681</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">urn:nbn:de:bvb:473-opus4-551376</subfield><subfield code="o">10.20378/irbo-55137</subfield><subfield code="z">978-3-86309-673-1</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg</subfield><subfield code="v">Band 38</subfield><subfield code="w">(DE-604)BV035260948</subfield><subfield code="9">38</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://fis.uni-bamberg.de/handle/uniba/46917</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</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=031681297&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031681297</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV046304044 |
| illustrated | Illustrated |
| indexdate | 2024-09-27T16:47:09Z |
| institution | BVB |
| institution_GND | (DE-588)1068114681 |
| isbn | 9783863096724 386309672X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031681297 |
| oclc_num | 1121492045 |
| open_access_boolean | 1 |
| owner | DE-473 DE-BY-UBG DE-12 DE-22 DE-BY-UBG |
| owner_facet | DE-473 DE-BY-UBG DE-12 DE-22 DE-BY-UBG |
| physical | XXIV, 501 Seiten Illustrationen, Diagramme, Karten 24 cm |
| psigel | ebook |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | University of Bamberg Press |
| record_format | marc |
| series | Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg |
| series2 | Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg |
| spellingShingle | Kufer, Stefan Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg Raumdaten (DE-588)4206012-6 gnd Abfrage (DE-588)4198788-3 gnd Geoinformatik (DE-588)7571300-7 gnd Nächste-Nachbarn-Problem (DE-588)4376579-8 gnd Big Data (DE-588)4802620-7 gnd Geoinformation (DE-588)4429674-5 gnd Peer-to-Peer-Netz (DE-588)4343110-0 gnd Algorithmus (DE-588)4001183-5 gnd Datenanalyse (DE-588)4123037-1 gnd Ähnlichkeitssuche (DE-588)4621546-3 gnd Datenverwaltung (DE-588)4011168-4 gnd RDF Informatik (DE-588)4737512-7 gnd Mehrdimensionale Datenstruktur (DE-588)4203964-2 gnd |
| subject_GND | (DE-588)4206012-6 (DE-588)4198788-3 (DE-588)7571300-7 (DE-588)4376579-8 (DE-588)4802620-7 (DE-588)4429674-5 (DE-588)4343110-0 (DE-588)4001183-5 (DE-588)4123037-1 (DE-588)4621546-3 (DE-588)4011168-4 (DE-588)4737512-7 (DE-588)4203964-2 (DE-588)4113937-9 |
| title | Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios |
| title_auth | Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios |
| title_exact_search | Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios |
| title_full | Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios Stefan Kufer |
| title_fullStr | Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios Stefan Kufer |
| title_full_unstemmed | Effective and efficient summarization of two-dimensional point data approaches for resource description and selection in spatial application scenarios Stefan Kufer |
| title_short | Effective and efficient summarization of two-dimensional point data |
| title_sort | effective and efficient summarization of two dimensional point data approaches for resource description and selection in spatial application scenarios |
| title_sub | approaches for resource description and selection in spatial application scenarios |
| topic | Raumdaten (DE-588)4206012-6 gnd Abfrage (DE-588)4198788-3 gnd Geoinformatik (DE-588)7571300-7 gnd Nächste-Nachbarn-Problem (DE-588)4376579-8 gnd Big Data (DE-588)4802620-7 gnd Geoinformation (DE-588)4429674-5 gnd Peer-to-Peer-Netz (DE-588)4343110-0 gnd Algorithmus (DE-588)4001183-5 gnd Datenanalyse (DE-588)4123037-1 gnd Ähnlichkeitssuche (DE-588)4621546-3 gnd Datenverwaltung (DE-588)4011168-4 gnd RDF Informatik (DE-588)4737512-7 gnd Mehrdimensionale Datenstruktur (DE-588)4203964-2 gnd |
| topic_facet | Raumdaten Abfrage Geoinformatik Nächste-Nachbarn-Problem Big Data Geoinformation Peer-to-Peer-Netz Algorithmus Datenanalyse Ähnlichkeitssuche Datenverwaltung RDF Informatik Mehrdimensionale Datenstruktur Hochschulschrift |
| url | https://fis.uni-bamberg.de/handle/uniba/46917 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031681297&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV035260948 |
| work_keys_str_mv | AT kuferstefan effectiveandefficientsummarizationoftwodimensionalpointdataapproachesforresourcedescriptionandselectioninspatialapplicationscenarios AT universityofbambergpress effectiveandefficientsummarizationoftwodimensionalpointdataapproachesforresourcedescriptionandselectioninspatialapplicationscenarios |