Full Citation

Title: Ερωτήματα Συνένωσης και Βαθμολογημένης Συνένωσης σε Κατανεμημένα Συστήματα

Citation Type: Dissertation/Thesis

Publication Year: 2011

ISBN:

ISSN:

DOI:

NSFID:

PMCID:

PMID:

Abstract: The advent of peer-to-peer databases and the recent rise of cloudstores as key large-scale data management paradigms, have led researchers to look into the problem of supporting complex queries in a fully decentralized manner. Among the classes of queries considered in related centralized work, there is one that stands out as largely overlooked in widely distributed settings, albeit very common in real-world workloads: top-k joins. With this work we tackle such queries over data distributed across an internet-scale network. Our contributions include: (a) a novel distributed indexing scheme, allowing access to tuples in both a random and an ordered manner; (b) a set of query processing algorithms based on a novel adaptation of rank-join and threshold algorithms, appropriate for use in a distributed environment; (c) a novel use of Bloom Filters and histograms to further reduce the bandwidth consumption of the above algorithms; a proof that ensures that our algorithms based on Bloom filters and histograms produce the correct top-k results; and (d) an in- depth discussion of the design space and related performance trade-offs. We further investigate the efficiency and quality of the proposed solutions through an elaborate experimental evaluation, showcasing their appropriateness for widely-distributed and massively decentralized environments and highlighting related trade-offs.

Url: http://nemertes.lis.upatras.gr/jspui/bitstream/10889/5871/1/thesis.pdf

User Submitted?: No

Authors: Πατλάκας, Ιωάννης

Institution: Πανεπιστήμιο Πατρών

Department:

Advisor:

Degree: για το Μεταπτυχιακό ∆ίπλωμα Ειδίκευσης Επιστήμη και Τεχνολογία Υπολογιστών

Publisher Location:

Pages: 75

Data Collections: IPUMS International

Topics: Population Data Science

Countries: