Streaming Algorithms and Graph Connectivity

The streaming model treats the input as a sequence of items that can be read in one single pass using only limited storage, preferably poly-logarithmic in the input size. Streaming algorithms have numerous applications such as Internet monitoring, databases, and trend detection. In the first part of...

Full description

Saved in:
Bibliographic Details
Main Author: Wang, Zhengyu
Format: Dissertation
Language:English
Published: ProQuest Dissertations & Theses 01.01.2019
Subjects:
Computer science
ISBN:9798684635618
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The streaming model treats the input as a sequence of items that can be read in one single pass using only limited storage, preferably poly-logarithmic in the input size. Streaming algorithms have numerous applications such as Internet monitoring, databases, and trend detection. In the first part of the thesis, I describe several new contributions to streaming algorithms, including: (i) A space and time optimal algorithm (taking O(1) words, O(1) update and query time) that finds ell_2-heavy hitters in insertion streams. ell_2-heavy hitter is the strongest notion of heavy hitters (or frequent items) achievable in poly-logarithmic space. (ii) An optimal space lower bound for samplers. Samplers are used as the building blocks for streaming graph algorithms such as graph connectivity. Graph connectivity is one of the most fundamental graph problems. In the second part of the thesis, I present new algorithms for graph connectivity in the dynamic streaming setting and parallel computing setting: (i) A randomized algorithm for dynamic graph connectivity using O(n log^3 n) bits with improved update time: With 1/poly(n) failure probability, the algorithm has worst-case running time O(log^3 n) per edge insertion, O(log^4 n) per edge deletion, and O(log n / loglog n) per query, where n is the number of vertices. (ii) A randomized graph connectivity algorithm that runs in O(log diam(G) loglog_{M/n} n) parallel time under the Massive Parallel Computing (MPC) model for undirected graph G with n vertices and total memory constraint M, where diam(G) refers to the largest diameter among all its connected components.
AbstractList The streaming model treats the input as a sequence of items that can be read in one single pass using only limited storage, preferably poly-logarithmic in the input size. Streaming algorithms have numerous applications such as Internet monitoring, databases, and trend detection. In the first part of the thesis, I describe several new contributions to streaming algorithms, including: (i) A space and time optimal algorithm (taking O(1) words, O(1) update and query time) that finds ell_2-heavy hitters in insertion streams. ell_2-heavy hitter is the strongest notion of heavy hitters (or frequent items) achievable in poly-logarithmic space. (ii) An optimal space lower bound for samplers. Samplers are used as the building blocks for streaming graph algorithms such as graph connectivity. Graph connectivity is one of the most fundamental graph problems. In the second part of the thesis, I present new algorithms for graph connectivity in the dynamic streaming setting and parallel computing setting: (i) A randomized algorithm for dynamic graph connectivity using O(n log^3 n) bits with improved update time: With 1/poly(n) failure probability, the algorithm has worst-case running time O(log^3 n) per edge insertion, O(log^4 n) per edge deletion, and O(log n / loglog n) per query, where n is the number of vertices. (ii) A randomized graph connectivity algorithm that runs in O(log diam(G) loglog_{M/n} n) parallel time under the Massive Parallel Computing (MPC) model for undirected graph G with n vertices and total memory constraint M, where diam(G) refers to the largest diameter among all its connected components.
Author Wang, Zhengyu
Author_xml – sequence: 1
  givenname: Zhengyu
  surname: Wang
  fullname: Wang, Zhengyu
BookMark eNotjctKAzEUQAMqqHX-YcClDGRy81yWQatQcGH3Ja_bRtpMTVLBv7egq7M659yT6zzneEU6o4yWmksQctS3pKs1OSqACiOFuSNPH61Ee0x51y8Pu7mktj_W3ubQr4o97ftpzjn6lr5T-3kgN2gPNXb_XJDNy_Nmeh3W76u3abkevKbjIKxCB8JFJhHAA3cOBQbLHZOceUSqcAwMBafBW6MDRB8UjYCKs3hxFuTxL3sq89c51rb9nM8lX45bxqWiHJgZ4RfkIkD8
ContentType Dissertation
Copyright Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Copyright_xml – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
DBID 053
0BH
0H~
CBPLH
EU9
G20
M8-
PHGZT
PKEHL
PQEST
PQQKQ
PQUKI
DatabaseName Dissertations & Theses Europe Full Text: Science & Technology
ProQuest Dissertations and Theses Professional
Dissertations & Theses @ Harvard University
ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection
ProQuest Dissertations & Theses A&I
ProQuest Dissertations & Theses Global
ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
DatabaseTitle Dissertations & Theses Europe Full Text: Science & Technology
Dissertations & Theses @ Harvard University
ProQuest One Academic Middle East (New)
ProQuest One Academic UKI Edition
ProQuest One Academic Eastern Edition
ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection
ProQuest Dissertations and Theses Professional
ProQuest One Academic
ProQuest Dissertations & Theses A&I
ProQuest One Academic (New)
ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection
ProQuest Dissertations & Theses Global
DatabaseTitleList Dissertations & Theses Europe Full Text: Science & Technology
Database_xml – sequence: 1
  dbid: G20
  name: ProQuest Dissertations & Theses Global
  url: https://www.proquest.com/pqdtglobal1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Genre Dissertation/Thesis
GroupedDBID 053
0BH
0H~
A6X
ALMA_UNASSIGNED_HOLDINGS
CBPLH
EU9
G20
M8-
PHGZT
PKEHL
PQEST
PQQKQ
PQUKI
ID FETCH-LOGICAL-c801-5a7fb35be26f33c34bbf5fda4b2642cff07f1d2f540dca98d3ecd70e3f742e6f3
IEDL.DBID G20
ISBN 9798684635618
IngestDate Sun Jun 29 15:50:58 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c801-5a7fb35be26f33c34bbf5fda4b2642cff07f1d2f540dca98d3ecd70e3f742e6f3
Notes SourceType-Dissertations & Theses-1
ObjectType-Dissertation/Thesis-1
content type line 12
PQID 2467043291
PQPubID 18750
ParticipantIDs proquest_journals_2467043291
PublicationCentury 2000
PublicationDate 20190101
PublicationDateYYYYMMDD 2019-01-01
PublicationDate_xml – month: 01
  year: 2019
  text: 20190101
  day: 01
PublicationDecade 2010
PublicationYear 2019
Publisher ProQuest Dissertations & Theses
Publisher_xml – name: ProQuest Dissertations & Theses
SSID ssib053059659
ssib000933042
Score 1.8183064
Snippet The streaming model treats the input as a sequence of items that can be read in one single pass using only limited storage, preferably poly-logarithmic in the...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Computer science
Title Streaming Algorithms and Graph Connectivity
URI https://www.proquest.com/docview/2467043291
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60ehAP9YmPKnvwGuzmsdmcRNTqQYqHIr2VJJOooFvtVn-_SbqLBcGLxxASQh7zfZlJ5gM4E6JERZESRpklnEpKDKc5KSTlKDlanvRTHu_lcFiOx-qhcbjVzbPK1iYmQ41TG33k5zSc6Jg-TuUX7x8kqkbF6GojobEKa_F3bfrsu0x_Frf1tixY1JoRKSOUVGURoJcF-lD-MsMJWwbd_45qCzavl4Lq27Diqh3otnINWXN6dyFFoPVbwKrs8vUp9DJ_fqszXWF2G7NWZ-nNi12oSezBaHAzurojjVYCsQFjiNDSGyaMo4VnzDJujBceNTeB8FDrfV_6HKkP_AytViUyZ1H2HfPhauxCm33oVNPKHUAWI7HosCwwV9xIqXWEcFtQbaXnvjyEXjsVk2a_15OfeTj6u_oYNgLlUAsnRg8689mnO4F1-zV_qWenafm-AbIipAo
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NS8MwFH_MKSge5id-TM1Bj0GbpE17EBHn3NgcHobsVtJ8qOA6XafiH-X_aNKuOBC87eCxlJbwkvzeL--9vB_Ase-HKiKKYEqoxIxwghNGPBxwwhRnSrJcP-W-y3u9cDCI7irwVd6FcWWVJSbmQK1G0sXIT4nd0a59XORdvLxipxrlsqulhEaxLDr688Me2bLzdsPO7wkhzev-VQtPVQWwtGiMfcFNQv1Ek8BQKilLEuMbJVhiqQGRxpxx4yliLJNRUkSholoqfqapsYdIbb-xv12AReY63bm7xbNsqwgOlM8-ddI2ft6AikdhYD09tWwl_IX6uStr1v6ZEdZgtTFTMrAOFZ1uQK0Uo0BTbNqEPL8uhtYTo8vnBzvoyeMwQyJV6Mb15EZ5RY8stDK2oD-P4W5DNR2legeQyzMrrcJAeRFLOBfCERQZECG5YSbchXpp-Xi6m7P4x-x7f78-guVW_7Ybd9u9zj6sWHIVFeGaOlQn4zd9AEvyffKUjQ_zlYMgnvMkfQMg4QMy
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=Streaming+Algorithms+and+Graph+Connectivity&rft.DBID=053%3B0BH%3B0H%7E%3BCBPLH%3BEU9%3BG20%3BM8-%3BPHGZT%3BPKEHL%3BPQEST%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Wang%2C+Zhengyu&rft.date=2019-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9798684635618&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9798684635618/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9798684635618/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9798684635618/sc.gif&client=summon&freeimage=true