Grant: Discovery Grants Program - Individual
University of Waterloo
$70,000.00
Studies in advanced distributed data management
FY 2013-14
Summary
This proposal covers distributed data management issues in two increasingly important domains: XML query processing and data stream systems.- Distributed XML query processing: XML has emerged as the de-facto standard for publishing and exchanging data of many different types. While extensive research has been conducted on efficiently querying XML data in a wide range of settings, these have primarily focused on data that reside on a single machine (i.e., centralized). This has two potential problems. On the one hand the solutions may not be scalable to very large XML databases, while on the other hand, these approaches do not address the necessity to query and retrieve existing XML data that may already be distributed. In this research we will study distributed XML query processing in two main environments: (1) when there is some control over where the XML data can be placed (i.e., tightly controlled distribution), and (2) when data are already distributed (i.e., the data integration scenario). - Mining data streams: A data stream is a real-time, continuous, ordered (implicitly by arrival time or explicitly by timestamp) sequence of items. The particular problem that will be studied is the mining of data streams with distribution changes (i.e., ""dynamic data streams""). Traditional data mining assumes that data are entirely stored on disk, and almost all traditional mining algorithms require scanning the data multiple times. Neither of these assumptions hold in the case of streaming data. ""Distribution change"" refers to changes over time in the underlying statistical distribution of the data. For dynamic data streams, mining results generated in the past may not be relevant as time progresses. However, since data can be looked at only once, historical data are no longer available, and, thus, it is even hard to just determine the change point of the underlying distribution, let alone updating mining results to fit the new data. We will perform a systematic study of the problem focusing on effective (and statistically meaningful) detection of distribution changes and online mining algorithms to cope with these changes.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
951-2009
Name nom
Ôzsu, Tamer
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2009
Award amount
70000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2711
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Database management
Research subject fr
Gestion de bases de données
Partie
5
Nb partie
5
Application title
Studies in advanced distributed data management
Keyword
NSERC
Application summary
This proposal covers distributed data management issues in two increasingly important domains: XML query processing and data stream systems.- Distributed XML query processing: XML has emerged as the de-facto standard for publishing and exchanging data of many different types. While extensive research has been conducted on efficiently querying XML data in a wide range of settings, these have primarily focused on data that reside on a single machine (i.e., centralized). This has two potential problems. On the one hand the solutions may not be scalable to very large XML databases, while on the other hand, these approaches do not address the necessity to query and retrieve existing XML data that may already be distributed. In this research we will study distributed XML query processing in two main environments: (1) when there is some control over where the XML data can be placed (i.e., tightly controlled distribution), and (2) when data are already distributed (i.e., the data integration scenario). - Mining data streams: A data stream is a real-time, continuous, ordered (implicitly by arrival time or explicitly by timestamp) sequence of items. The particular problem that will be studied is the mining of data streams with distribution changes (i.e., ""dynamic data streams""). Traditional data mining assumes that data are entirely stored on disk, and almost all traditional mining algorithms require scanning the data multiple times. Neither of these assumptions hold in the case of streaming data. ""Distribution change"" refers to changes over time in the underlying statistical distribution of the data. For dynamic data streams, mining results generated in the past may not be relevant as time progresses. However, since data can be looked at only once, historical data are no longer available, and, thus, it is even hard to just determine the change point of the underlying distribution, let alone updating mining results to fit the new data. We will perform a systematic study of the problem focusing on effective (and statistically meaningful) detection of distribution changes and online mining algorithms to cope with these changes.