Ask a Librarian

Threre are lots of ways to contact a librarian. Choose what works best for you.

HOURS TODAY

10:00 am - 4:00 pm

Reference Desk

CONTACT US BY PHONE

(802) 656-2022

Voice

(802) 503-1703

Text

MAKE AN APPOINTMENT OR EMAIL A QUESTION

Schedule an Appointment

Meet with a librarian or subject specialist for in-depth help.

Email a Librarian

Submit a question for reply by e-mail.

WANT TO TALK TO SOMEONE RIGHT AWAY?

Library Hours for Thursday, November 21st

All of the hours for today can be found below. We look forward to seeing you in the library.
HOURS TODAY
8:00 am - 12:00 am
MAIN LIBRARY

SEE ALL LIBRARY HOURS
WITHIN HOWE LIBRARY

MapsM-Th by appointment, email govdocs@uvm.edu

Media Services8:00 am - 7:00 pm

Reference Desk10:00 am - 4:00 pm

OTHER DEPARTMENTS

Special Collections10:00 am - 6:00 pm

Dana Health Sciences Library7:30 am - 11:00 pm

 

CATQuest

Search the UVM Libraries' collections

UVM Theses and Dissertations

Browse by Department
Format:
Print
Author:
Tran, Tri Minh
Dept./Program:
Computer Science
Year:
2010
Degree:
PhD
Abstract:
A data stream is a continuous unbounded sequence of data items. In many stream applications (e.g., network monitoring, sensor network monitoring, online auction monitoring), join queries (Le., queries involving join operators) are one of the most common types of queries. Due to the unbounded and continuous nature of data streams, however, processing this type of queries over data streams is very different from processing them over databases, and this difference brings numerous challenges. This journal-format 'dissertation addresses three problems important to improve the efficiency of stream-join query processing: (1) efficiently processing join queries when aggregation operators are in the query as well, with the focus on a new query transformation rule to derive more efficient query execution plans, (2) efficiently processing join queries in a distributed environment, with the focus on utilizing semi-joins to reduce the communication cost, and (3) efficiently processing join queries by continuously adapting the query execution plan to the changes in a distributed environment, with the focus on detecting the changes locally at individual nodes and generating and gracefully migrating to more efficient execution plans.