{"id":{"repo_id":"greece","oai_identifier":"oai:10442/17653"},"canonical_url":"https://search.ndltd.org/etd/greece/oai:10442/17653","repository":{"repo_id":"greece","name":"Greek National Archive of PhD Theses","base_url":"https://phdtheses.ekt.gr/eadd_oai/request"},"display":{"title":"Efficient query processing over highly distributed data","abstract":"The objective of this thesis is to investigate the performance of query processing over highly distributed data. Peer-to-peer (P2P) systems emerge as a powerful model for searching vast amounts of data distributed over independent sources. While different peer-to-peer architectures have been proposed in the related research literature, in this thesis we focus on unstructured peer-to-peer networks. Some peers, called super-peers, have special roles due to their enhanced features, such as availability, stability, storage and bandwidth capacity, and form a super-peer network. We study how various advanced query operators, such as similarity search (range and k nearest neighbor queries), top-k and skyline queries can be performed efficiently over a super-peer network, where the data objects are horizontally distributed over the peers. In order to support query processing, queries are first routed on the super-peer backbone and afterwards, if necessary, they are forwarded to the peers with relevant data. In this thesis, we study efficient query processing over such a highly distributed architecture, by using routing information at super-peer level in a deliberate way, aiming at minimizing contacted peers and transferred data.","abstract_html":"The objective of this thesis is to investigate the performance of query processing over highly distributed data. Peer-to-peer (P2P) systems emerge as a powerful model for searching vast amounts of data distributed over independent sources. While different peer-to-peer architectures have been proposed in the related research literature, in this thesis we focus on unstructured peer-to-peer networks. Some peers, called super-peers, have special roles due to their enhanced features, such as availability, stability, storage and bandwidth capacity, and form a super-peer network. We study how various advanced query operators, such as similarity search (range and k nearest neighbor queries), top-k and skyline queries can be performed efficiently over a super-peer network, where the data objects are horizontally distributed over the peers. In order to support query processing, queries are first routed on the super-peer backbone and afterwards, if necessary, they are forwarded to the peers with relevant data. In this thesis, we study efficient query processing over such a highly distributed architecture, by using routing information at super-peer level in a deliberate way, aiming at minimizing contacted peers and transferred data.","abstract_has_math":false,"creators":["Vlachou, Akrivi","Βλάχου, Ακριβή"],"institution":"Athens University Economics and Business (AUEB)","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008","date_published":"2008","updated_at":"2026-11-18T20:37:13Z","subjects":["Δίκτυα ομότιμων","Επεξεργασία επερωτήσεων","Επεξεργασία top-k επερωτήσεων","Επερώτηση κορυφογραμμών","Αναζήτηση βάση ομοιότητας","Ετρετήρια δρομολόγησης","Επερωτήσεις κοντινότερου γείτονα","Επερωτήσεις διαστήματος τιμών","Peer-to-peer","Query processing","Top-k query","Skyline query","Similarity search","Routing index","Nearest neighbor search","Range query","Φυσικές Επιστήμες","Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική","Natural Sciences","Computer and Information Sciences"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["10.12681/eadd/17653"],"render_values":[{"text":"10.12681/eadd/17653","href":"https://doi.org/10.12681/eadd/17653","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10442/hedi/17653","outbound_label":"Handle","outbound_source":"dc:identifier","record_url":"http://hdl.handle.net/10442/hedi/17653","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://phdtheses.ekt.gr/eadd_oai/request?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3A10442%2F17653","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Vlachou, Akrivi","Βλάχου, Ακριβή"]},{"key":"dc:creator.fathername","label":"Dc Creator Fathername","values":["Nikolaos"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2008"]},{"key":"dc:publisher","label":"Institution","values":["Athens University Economics and Business (AUEB)","Οικονομικό Πανεπιστήμιο Αθηνών"]},{"key":"dc:type","label":"Dc Type","values":["PhD Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Δίκτυα ομότιμων","Επεξεργασία επερωτήσεων","Επεξεργασία top-k επερωτήσεων","Επερώτηση κορυφογραμμών","Αναζήτηση βάση ομοιότητας","Ετρετήρια δρομολόγησης","Επερωτήσεις κοντινότερου γείτονα","Επερωτήσεις διαστήματος τιμών","Peer-to-peer","Query processing","Top-k query","Skyline query","Similarity search","Routing index","Nearest neighbor search","Range query","Φυσικές Επιστήμες","Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική","Natural Sciences","Computer and Information Sciences"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.12681/eadd/17653","http://hdl.handle.net/10442/hedi/17653"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The objective of this thesis is to investigate the performance of query processing over highly distributed data. Peer-to-peer (P2P) systems emerge as a powerful model for searching vast amounts of data distributed over independent sources. While different peer-to-peer architectures have been proposed in the related research literature, in this thesis we focus on unstructured peer-to-peer networks. Some peers, called super-peers, have special roles due to their enhanced features, such as availability, stability, storage and bandwidth capacity, and form a super-peer network. We study how various advanced query operators, such as similarity search (range and k nearest neighbor queries), top-k and skyline queries can be performed efficiently over a super-peer network, where the data objects are horizontally distributed over the peers. In order to support query processing, queries are first routed on the super-peer backbone and afterwards, if necessary, they are forwarded to the peers with relevant data. In this thesis, we study efficient query processing over such a highly distributed architecture, by using routing information at super-peer level in a deliberate way, aiming at minimizing contacted peers and transferred data.","Η παρούσα διδακτορική διατριβή επικεντρώνεται στον χώρο της επεξεργασίας μη παραδοσιακών τύπων επερωτήσεων σε ευρέως κατανεμημένα δεδομένα όπως αυτά που συναντώνται σε δίκτυα ομότιμων (peer-to-peer). Τα δίκτυα ομότιμων προβάλλουν ως ένα δυναμικό μοντέλο για την αναζήτηση και διαχείριση τεράστιων ποσοτήτων δεδομένων κατανεμημένων σε ανεξάρτητες πηγές δεδομένων. Ενώ διάφορες αρχιτεκτονικές ομότιμων συστημάτων έχουν προταθεί στη σχετική βιβλιογραφία, σε αυτή τη διατριβή βρίσκονται στο επίκεντρο τα αδόμητα δίκτυα ομότιμων κόμβων. Ορισμένοι ομότιμοι, που ονομάζονται super-peers, έχουν ειδικό ρόλο λόγω των ιδιαίτερων χαρακτηριστικών τους, όπως διαθεσιμότητα, σταθερότητα, αυξημένη αποθηκευτική δυνατότητα και μεγάλο εύρος ζώνης, και διαμορφώνουν ένα super-peer δίκτυο. Μελετώνται διάφοροι προηγμένοι τελεστές επερώτησης, όπως η αναζήτηση με βάση την ομοιότητα, οι top-k και skyline επερωτήσεις, καθώς και ο αποδοτικός υπολογισμός αυτών σε ένα super-peer δίκτυο, όπου τα δεδομένα είναι οριζόντια κατατμημένα στους ομότιμους. Για την επεξεργασία επερωτήσεων, οι επερωτήσεις πρώτα δρομολογούνται στο δίκτυο των super-peers, και στη συνέχεια προωθούνται σε εκείνους τους ομότιμους που έχουν σχετικά δεδομένα. Σε αυτή τη διατριβή εξετάζεται η αποδοτική επεξεργασία επερωτήσεων σε μια τέτοια ευρέως κατανεμημένη αρχιτεκτονική, χρησιμοποιώντας πληροφορία δρομολόγησης σε επίπεδο super-peers, με στόχο την ελαχιστοποίηση των ομότιμων που θα επεξεργαστούν την επερώτηση και του όγκου των δεδομένων που θα μεταφερθούν."]},{"key":"dc:title","label":"Title","values":["Efficient query processing over highly distributed data"]}]}],"canonical_facts":{"dc:creator":["Vlachou, Akrivi","Βλάχου, Ακριβή"],"dc:creator.fathername":["Nikolaos"],"dc:date":["2008"],"dc:description":["The objective of this thesis is to investigate the performance of query processing over highly distributed data. Peer-to-peer (P2P) systems emerge as a powerful model for searching vast amounts of data distributed over independent sources. While different peer-to-peer architectures have been proposed in the related research literature, in this thesis we focus on unstructured peer-to-peer networks. Some peers, called super-peers, have special roles due to their enhanced features, such as availability, stability, storage and bandwidth capacity, and form a super-peer network. We study how various advanced query operators, such as similarity search (range and k nearest neighbor queries), top-k and skyline queries can be performed efficiently over a super-peer network, where the data objects are horizontally distributed over the peers. In order to support query processing, queries are first routed on the super-peer backbone and afterwards, if necessary, they are forwarded to the peers with relevant data. In this thesis, we study efficient query processing over such a highly distributed architecture, by using routing information at super-peer level in a deliberate way, aiming at minimizing contacted peers and transferred data.","Η παρούσα διδακτορική διατριβή επικεντρώνεται στον χώρο της επεξεργασίας μη παραδοσιακών τύπων επερωτήσεων σε ευρέως κατανεμημένα δεδομένα όπως αυτά που συναντώνται σε δίκτυα ομότιμων (peer-to-peer). Τα δίκτυα ομότιμων προβάλλουν ως ένα δυναμικό μοντέλο για την αναζήτηση και διαχείριση τεράστιων ποσοτήτων δεδομένων κατανεμημένων σε ανεξάρτητες πηγές δεδομένων. Ενώ διάφορες αρχιτεκτονικές ομότιμων συστημάτων έχουν προταθεί στη σχετική βιβλιογραφία, σε αυτή τη διατριβή βρίσκονται στο επίκεντρο τα αδόμητα δίκτυα ομότιμων κόμβων. Ορισμένοι ομότιμοι, που ονομάζονται super-peers, έχουν ειδικό ρόλο λόγω των ιδιαίτερων χαρακτηριστικών τους, όπως διαθεσιμότητα, σταθερότητα, αυξημένη αποθηκευτική δυνατότητα και μεγάλο εύρος ζώνης, και διαμορφώνουν ένα super-peer δίκτυο. Μελετώνται διάφοροι προηγμένοι τελεστές επερώτησης, όπως η αναζήτηση με βάση την ομοιότητα, οι top-k και skyline επερωτήσεις, καθώς και ο αποδοτικός υπολογισμός αυτών σε ένα super-peer δίκτυο, όπου τα δεδομένα είναι οριζόντια κατατμημένα στους ομότιμους. Για την επεξεργασία επερωτήσεων, οι επερωτήσεις πρώτα δρομολογούνται στο δίκτυο των super-peers, και στη συνέχεια προωθούνται σε εκείνους τους ομότιμους που έχουν σχετικά δεδομένα. Σε αυτή τη διατριβή εξετάζεται η αποδοτική επεξεργασία επερωτήσεων σε μια τέτοια ευρέως κατανεμημένη αρχιτεκτονική, χρησιμοποιώντας πληροφορία δρομολόγησης σε επίπεδο super-peers, με στόχο την ελαχιστοποίηση των ομότιμων που θα επεξεργαστούν την επερώτηση και του όγκου των δεδομένων που θα μεταφερθούν."],"dc:identifier":["10.12681/eadd/17653","http://hdl.handle.net/10442/hedi/17653"],"dc:language":["eng"],"dc:publisher":["Athens University Economics and Business (AUEB)","Οικονομικό Πανεπιστήμιο Αθηνών"],"dc:subject":["Δίκτυα ομότιμων","Επεξεργασία επερωτήσεων","Επεξεργασία top-k επερωτήσεων","Επερώτηση κορυφογραμμών","Αναζήτηση βάση ομοιότητας","Ετρετήρια δρομολόγησης","Επερωτήσεις κοντινότερου γείτονα","Επερωτήσεις διαστήματος τιμών","Peer-to-peer","Query processing","Top-k query","Skyline query","Similarity search","Routing index","Nearest neighbor search","Range query","Φυσικές Επιστήμες","Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική","Natural Sciences","Computer and Information Sciences"],"dc:title":["Efficient query processing over highly distributed data"],"dc:type":["PhD Thesis"]},"updated_at":"2026-11-18T20:37:13Z"}