Page 1 |
Save page Remove page | Previous | 1 of 151 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
APPROXIMATE QUERY ANSWERING IN
UNSTRUCTURED PEER-TO-PEER DATABASES
by
Farnoush Banaei-Kashani
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
May 2007
Copyright 2007 Farnoush Banaei-Kashani
Object Description
| Title | Approximate query answering in unstructured peer-to-peer databases |
| Author | Banaei-Kashani, Farnoush |
| Author email | banaeika@usc.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2006-12-14 |
| Date submitted | 2007 |
| Restricted until | Unrestricted |
| Date published | 2007-02-15 |
| Advisor (committee member) |
Shahabi, Cyrus Govindan, Ramesh Kempe, David Kalia, Rajiv Alexander, Kenneth S. |
| Abstract | Peer-to-peer networks are considered the new generation of distributed databases, termed peer-to-peer databases. With very large size, open architecture, and extreme dynamism and autonomy, approximate query answering is arguably the most promising approach for query answering in peer-to-peer databases. To enable approximate query answering, in this dissertation we propose a set of universal sampling operations specifically designed for probing the data in peer-to-peer databases. We complement these operations at the bottom tier by a set of approximate query processing techniques at the top tier to develop a two-tier system for answering both set-valued and aggregate queries in peer-to-peer databases. |
| Keyword | peer-to-peer databases; peer-to-peer networks; approximate query; continuous query; sample-based query answering; epidemic algorithms |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Type | texts |
| Legacy record ID | usctheses-m263 |
| Rights | Banaei-Kashani, Farnoush |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-BanaeiKashani-20070215 |
| Archival file | uscthesesreloadpub_Volume32/etd-BanaeiKashani-20070215.pdf |
Description
| Title | Page 1 |
| Full text | APPROXIMATE QUERY ANSWERING IN UNSTRUCTURED PEER-TO-PEER DATABASES by Farnoush Banaei-Kashani A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) May 2007 Copyright 2007 Farnoush Banaei-Kashani |
Comments
Post a Comment for Page 1
