Algorithms for Big Data : : DFG Priority Program 1736 / / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck.
This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics fo...
Saved in:
Superior document: | Lecture Notes in Computer Science, 13201 |
---|---|
: | |
TeilnehmendeR: | |
Place / Publishing House: | Cham : : Springer Nature Switzerland :, Imprint: Springer,, 2022. |
Year of Publication: | 2022 |
Edition: | 1st ed. 2022. |
Language: | English |
Series: | Lecture Notes in Computer Science,
13201 |
Physical Description: | 1 online resource (296 pages) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
993599245804498 |
---|---|
ctrlnum |
(CKB)5710000000108202 (MiAaPQ)EBC7179459 (Au-PeEL)EBL7179459 (OCoLC)1369653470 (DE-He213)978-3-031-21534-6 (PPN)267806841 (EXLCZ)995710000000108202 |
collection |
bib_alma |
record_format |
marc |
spelling |
Bast, Hannah. Algorithms for Big Data : DFG Priority Program 1736 / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck. 1st ed. 2022. Cham : Springer Nature Switzerland : Imprint: Springer, 2022. 1 online resource (296 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Lecture Notes in Computer Science, 1611-3349 ; 13201 This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics for Big Data where researchers from theoretical computer science worked together with application experts in order to tackle problems in domains such as networking, genomics research, and information retrieval. Such domains are unthinkable without substantial hardware and software support, and these systems acquire, process, exchange, and store data at an exponential rate. The chapters of this volume summarize the results of projects realized within the program and survey-related work. This is an open access book. Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices. Open Access Computer networks. Data structures (Computer science). Information theory. Computer science—Mathematics. Algorithms. Computer Communication Networks. Data Structures and Information Theory. Mathematics of Computing. Design and Analysis of Algorithms. 3-031-21533-8 Korzen, Claudius. Meyer, Ulrich. Penschuck, Manuel. |
language |
English |
format |
eBook |
author |
Bast, Hannah. |
spellingShingle |
Bast, Hannah. Algorithms for Big Data : DFG Priority Program 1736 / Lecture Notes in Computer Science, Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices. |
author_facet |
Bast, Hannah. Korzen, Claudius. Meyer, Ulrich. Penschuck, Manuel. |
author_variant |
h b hb |
author2 |
Korzen, Claudius. Meyer, Ulrich. Penschuck, Manuel. |
author2_variant |
c k ck u m um m p mp |
author2_role |
TeilnehmendeR TeilnehmendeR TeilnehmendeR |
author_sort |
Bast, Hannah. |
title |
Algorithms for Big Data : DFG Priority Program 1736 / |
title_sub |
DFG Priority Program 1736 / |
title_full |
Algorithms for Big Data : DFG Priority Program 1736 / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck. |
title_fullStr |
Algorithms for Big Data : DFG Priority Program 1736 / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck. |
title_full_unstemmed |
Algorithms for Big Data : DFG Priority Program 1736 / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck. |
title_auth |
Algorithms for Big Data : DFG Priority Program 1736 / |
title_new |
Algorithms for Big Data : |
title_sort |
algorithms for big data : dfg priority program 1736 / |
series |
Lecture Notes in Computer Science, |
series2 |
Lecture Notes in Computer Science, |
publisher |
Springer Nature Switzerland : Imprint: Springer, |
publishDate |
2022 |
physical |
1 online resource (296 pages) |
edition |
1st ed. 2022. |
contents |
Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices. |
isbn |
3-031-21534-6 3-031-21533-8 |
issn |
1611-3349 ; |
callnumber-first |
T - Technology |
callnumber-subject |
TK - Electrical and Nuclear Engineering |
callnumber-label |
TK5105 |
callnumber-sort |
TK 45105.5 45105.9 |
illustrated |
Not Illustrated |
dewey-hundreds |
000 - Computer science, information & general works |
dewey-tens |
000 - Computer science, knowledge & systems |
dewey-ones |
004 - Data processing & computer science |
dewey-full |
004.6 |
dewey-sort |
14.6 |
dewey-raw |
004.6 |
dewey-search |
004.6 |
oclc_num |
1369653470 |
work_keys_str_mv |
AT basthannah algorithmsforbigdatadfgpriorityprogram1736 AT korzenclaudius algorithmsforbigdatadfgpriorityprogram1736 AT meyerulrich algorithmsforbigdatadfgpriorityprogram1736 AT penschuckmanuel algorithmsforbigdatadfgpriorityprogram1736 |
status_str |
n |
ids_txt_mv |
(CKB)5710000000108202 (MiAaPQ)EBC7179459 (Au-PeEL)EBL7179459 (OCoLC)1369653470 (DE-He213)978-3-031-21534-6 (PPN)267806841 (EXLCZ)995710000000108202 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Lecture Notes in Computer Science, 13201 |
hierarchy_sequence |
13201 |
is_hierarchy_title |
Algorithms for Big Data : DFG Priority Program 1736 / |
container_title |
Lecture Notes in Computer Science, 13201 |
author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField |
_version_ |
1805527091326746624 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04328nam a22006135i 4500</leader><controlfield tag="001">993599245804498</controlfield><controlfield tag="005">20230117203247.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">230117s2022 sz | o |||| 0|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3-031-21534-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-031-21534-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5710000000108202</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC7179459</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL7179459</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1369653470</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)978-3-031-21534-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PPN)267806841</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995710000000108202</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">TK5105.5-5105.9</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UKN</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM075000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UKN</subfield><subfield code="2">thema</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bast, Hannah.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for Big Data :</subfield><subfield code="b">DFG Priority Program 1736 /</subfield><subfield code="c">edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2022.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham :</subfield><subfield code="b">Springer Nature Switzerland :</subfield><subfield code="b">Imprint: Springer,</subfield><subfield code="c">2022.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (296 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture Notes in Computer Science,</subfield><subfield code="x">1611-3349 ;</subfield><subfield code="v">13201</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics for Big Data where researchers from theoretical computer science worked together with application experts in order to tackle problems in domains such as networking, genomics research, and information retrieval. Such domains are unthinkable without substantial hardware and software support, and these systems acquire, process, exchange, and store data at an exponential rate. The chapters of this volume summarize the results of projects realized within the program and survey-related work. This is an open access book.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices.</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">Open Access</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data structures (Computer science).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Information theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science—Mathematics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield></datafield><datafield tag="650" ind1="1" ind2="4"><subfield code="a">Computer Communication Networks.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Data Structures and Information Theory.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Mathematics of Computing.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Design and Analysis of Algorithms.</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-031-21533-8</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Korzen, Claudius.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meyer, Ulrich.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Penschuck, Manuel.</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science,</subfield><subfield code="x">1611-3349 ;</subfield><subfield code="v">13201</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-07-25 05:52:13 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2023-02-11 21:29:23 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5345652230004498&Force_direct=true</subfield><subfield code="Z">5345652230004498</subfield><subfield code="b">Available</subfield><subfield code="8">5345652230004498</subfield></datafield></record></collection> |